Home
last modified time | relevance | path

Searched refs:it (Results 1 – 14 of 14) sorted by relevance

/littlefs-3.5.0-3.4.0/scripts/
Dtest.py12 import itertools as it namespace
309 line = (next(it.islice(f, lineno-1, None))
359 for cycles in it.count(1):
456 for init, pinit in it.product(inits, pending):
486 it.product(self.classes, expanded)):
676 list(it.chain.from_iterable(['-f', m] for m in makefiles)) +
706 line = next(it.islice(f, lineno-1, None)).strip('\n')
776 list(it.chain.from_iterable(['-f', m] for m in makefiles)) +
Dreadtree.py7 import itertools as it namespace
21 for m in it.chain((m for d in dirs for m in d), mdirs):
60 for a,b in it.zip_longest(gstate, ngstate.data))
Dreadmdir.py6 import itertools as it namespace
209 self.ids = list(it.takewhile(
211 it.count()))
Ddata.py10 import itertools as it namespace
Dcode.py10 import itertools as it namespace
Dstructs.py8 import itertools as it namespace
Dstack.py9 import itertools as it namespace
/littlefs-3.5.0-3.4.0/
DDESIGN.md19 This document covers the high-level design of littlefs, how it is different
38 To make the situation more annoying, it's very common for these embedded
138 SPIFFS is a very interesting case here, as it uses the fact that repeated
140 solution, however it limits the type of storage you can support.
146 before it occurs.
247 can write atomically!), but what it does do is prevent the upward motion of
382 filesystems do this, but it limits what you can update in a single atomic
413 written. If the entry is the most recent we append it to our new block. This
599 following blocks, but can reuse any blocks before it. Since most file writes
713 offset in the head block. But it's worth noting that each size maps to a unique
[all …]
DREADME.md32 of how many times it has been booted and without corrupting the filesystem:
187 I would suggest reading it as the tradeoffs at work are quite interesting.
222 want this, but it is handy for demos. You can see it in action
DSPEC.md617 errors before it can be used reliably. Note that the threaded linked-list can
708 threaded linked-list will need to be checked for errors before it can be used
/littlefs-3.5.0-3.4.0/tests/
Dtest_relocations.toml173 // if it does not exist, we create it, else we destroy
235 // if it does not exist, we create it, else we destroy
Dtest_orphans.toml84 // if it does not exist, we create it, else we destroy
Dtest_files.toml356 // with syncs we could be any size, but it at least must be valid data
Dtest_move.toml1334 // a create and delete as it overwrites the destination file
1587 // fix the move in our parent before it falls out of date