Searched refs:find (Results 1 – 7 of 7) sorted by relevance
441 3. If our block is full of entries _and_ we can't find any garbage, then what?515 find an alternative representation of the number of static and dynamic entries:527 size to find a multiplicative cost:663 We can find the runtime complexity by looking at the path to any block from682 To find the storage overhead, we can look at the data structure as multiple730 the [On-Line Encyclopedia of Integer Sequences (OEIS)][oeis], I managed to find750 Now we can substitute into our original equation to find a more efficient765 equation to find the offset. We run into a bit of a problem with integer771 Now we can find both our block index and offset from a size in _O(1)_, letting896 Our block allocator needs to find free blocks efficiently. You could traverse[all …]
188 $(CTAGS) --totals --c-types=+p $(shell find -H -name '*.h') $(SRC)
4696 struct lfs_fs_parent_match *find = data; local4697 lfs_t *lfs = find->lfs;4710 return (lfs_pair_cmp(child, find->pair) == 0) ? LFS_CMP_EQ : LFS_CMP_LT;
257 // find child288 // find child
336 // find out max file size394 // first fill to exhaustion to find available space488 // find out max file size
493 // find standard deviation^2
105 s = s[:max(s.find('.'), w-(2 if x < 0 else 1))]124 s = s[:max(s.find('.'), w-(3 if x < 0 else 2))]
