Mirrors_Framework/fifofast
1
0
Fork 0
mirror of https://github.com/nqtronix/fifofast.git synced 2026-08-18 09:07:36 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update readme section 'limitations' to match version 0.7.x

Browse Source
This commit is contained in:
nqtronix
2018-11-12 17:10:32 +01:00
parent ad58d70907
commit b79f8fe36a
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
README.md
+1 -1
View File
@@ -43,7 +43,7 @@ First-In-First-Out (FIFO) buffers are one of the most used data structures, espe
## Limititations
- **Fifo size:**<br>
The fifo size is limited to 2ⁿ elements to make use of the fast wrapping functionality. Other sizes will be automatically rounded up. Pointable fifos are limited to 256 elements with a size of up to 256 bytes each.
The fifo size is limited to 2ⁿ elements to make use of the fast wrapping functionality. Other sizes will be automatically rounded up. Pointable fifos have the same limitation and in additon their element size is limited to 255 bytes.
- **Programm memory usage:**<br>
Each function-like macro or inline function pastes new code at its location. Compared to a regular function-based fifo the program memory usage (flash) is higher.