You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+3-3Lines changed: 3 additions & 3 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -230,11 +230,11 @@ DELETE:
230
230
| (4096 bytes) | (4096 bytes) | ...
231
231
-----------------------------------------
232
232
```
233
-
Accessing a block is as simple as taking the block identifier (a 0 based number) and multiplying by the block length. Possibly include a header structure for file version and block size?
233
+
Accessing a block is as simple as taking the block identifier (a 0 based number) and multiplying by the block length.
234
234
235
235
The block file will be expanded as needed. Up to a maximum of of uint_32 (4,294,967,295) blocks.
236
236
237
-
**Future:** Defrag / Optimize routine?
237
+
**Future:** Defrag / Optimize routine? Possibly include a header structure for file version and block size?
238
238
239
239
### Filesystem
240
240
```
@@ -254,7 +254,7 @@ A Least Recently Used list will be maintained globally. This will be done via a
254
254
Hard limits will be enforced on database size (sum of value size). When this limit is exceeded the least recently used values will be expired until the database it atleast X% under the limit.
255
255
256
256
## Expiration
257
-
For now expiration will be lazy, performed on the GET request as validation. In the future an expiration cursor will be implemented.
257
+
Expiration is both lazy and implemented via a simple expiration cursor expiring a small number of tables at a time.
0 commit comments