Searched full:_ (Results 1 – 6 of 6) sorted by relevance
14 _: &install-common24 _: &test-example34 _: &test-default38 _: &test-nor41 _: &test-emmc44 _: &test-nand48 _: &test-no-intrinsics50 _: &test-no-inline52 _: &test-byte-writes54 _: &test-block-cycles[all …]
135 1. _O(n²)_ runtime136 2. _O(n)_ RAM238 Consider logging. It has either a _O(n²)_ runtime or _O(n)_ RAM cost. We242 complexity is _O(1)_ by bounding the input.494 one time cost (_O(n²)_ for littlefs), but also depends on how often538 giving us an amortized runtime complexity of _O(1)_.545 entry has a worst case runtime complexity of _O(nm)_. For _updating_ a specific546 entry, the worst case complexity is _O(nm²)_, with an amortized complexity547 of only _O(nm)_.613 over a file _in order_ has a runtime cost of _O(n²)_. A quadratic runtime[all …]
498 2‍_ˣ_, that block contains a pointer to block _n_-2‍_ˣ_.
239 _O(|address|)_ pointer structure stored on each block and in RAM.
10 ASSERT = "__{PREFIX}_ASSERT_{TYPE}_{COMP}"48 #define __{PREFIX}_ASSERT_{TYPE}_{COMP}(file, line, lh, rh)70 #define __{PREFIX}_ASSERT_{TYPE}_{COMP}(file, line, lh, rh)103 #define __{PREFIX}_ASSERT_{TYPE}_{COMP}(file, line, lh, rh, size)124 #define __{PREFIX}_ASSERT_{TYPE}_{COMP}(file, line, lh, rh)
109 suite=None, caseno=None, lineno=None, **_): argument136 def permute(self, class_=None, defines={}, permno=None, **_): argument146 def build(self, f, **_): argument577 k, v, *_ = define.split('=', 2) + ['']
