Home
last modified time | relevance | path

Searched refs:m (Results 1 – 24 of 24) sorted by relevance

/littlefs-3.7.0-3.6.0/scripts/
Dperfbd.py19 import math as m namespace
43 x = m.inf
45 x = -m.inf
48 assert isinstance(x, int) or m.isinf(x), x
52 if self.x == m.inf:
54 elif self.x == -m.inf:
60 assert not m.isinf(self.x)
77 if diff == +m.inf:
79 elif diff == -m.inf:
87 if m.isinf(new) and m.isinf(old):
[all …]
Dperf.py20 import math as m namespace
52 x = m.inf
54 x = -m.inf
57 assert isinstance(x, int) or m.isinf(x), x
61 if self.x == m.inf:
63 elif self.x == -m.inf:
69 assert not m.isinf(self.x)
86 if diff == +m.inf:
88 elif diff == -m.inf:
96 if m.isinf(new) and m.isinf(old):
[all …]
Ddata.py19 import math as m namespace
43 x = m.inf
45 x = -m.inf
48 assert isinstance(x, int) or m.isinf(x), x
52 if self.x == m.inf:
54 elif self.x == -m.inf:
60 assert not m.isinf(self.x)
77 if diff == +m.inf:
79 elif diff == -m.inf:
87 if m.isinf(new) and m.isinf(old):
[all …]
Dcode.py19 import math as m namespace
43 x = m.inf
45 x = -m.inf
48 assert isinstance(x, int) or m.isinf(x), x
52 if self.x == m.inf:
54 elif self.x == -m.inf:
60 assert not m.isinf(self.x)
77 if diff == +m.inf:
79 elif diff == -m.inf:
87 if m.isinf(new) and m.isinf(old):
[all …]
Dstructs.py16 import math as m namespace
39 x = m.inf
41 x = -m.inf
44 assert isinstance(x, int) or m.isinf(x), x
48 if self.x == m.inf:
50 elif self.x == -m.inf:
56 assert not m.isinf(self.x)
73 if diff == +m.inf:
75 elif diff == -m.inf:
83 if m.isinf(new) and m.isinf(old):
[all …]
Dprettyasserts.py218 m = p.search(data)
219 if m:
220 if m.start() > 0:
221 tokens.append((None, data[:m.start()], line, col))
222 tokens.append((m.lastgroup, m.group(), line, col))
223 data = data[m.end():]
234 self.m = token[1]
235 return self.m
236 self.m = None
237 return self.m
[all …]
Dsummary.py19 import math as m namespace
30 'prod': lambda xs: m.prod(xs[1:], start=xs[0]),
36 m.sqrt(sum((float(x) - mean)**2 for x in xs) / len(xs)))
38 'gmean': lambda xs: Float(m.prod(float(x) for x in xs)**(1/len(xs))),
41 m.exp(m.sqrt(sum(m.log(float(x)/gmean)**2 for x in xs) / len(xs)))
42 if gmean else m.inf)
43 )(m.prod(float(x) for x in xs)**(1/len(xs))),
59 x = m.inf
61 x = -m.inf
64 assert isinstance(x, int) or m.isinf(x), x
[all …]
Dbench.py17 import math as m namespace
101 m = re.search(r'\brange\b\s*\('
106 if m:
107 start = (int(m.group('start'), 0)
108 if m.group('start') else 0)
109 stop = (int(m.group('stop'), 0)
110 if m.group('stop') else None)
111 step = (int(m.group('step'), 0)
112 if m.group('step') else 1)
113 if m.lastindex <= 1:
[all …]
Dtest.py17 import math as m namespace
104 m = re.search(r'\brange\b\s*\('
109 if m:
110 start = (int(m.group('start'), 0)
111 if m.group('start') else 0)
112 stop = (int(m.group('stop'), 0)
113 if m.group('stop') else None)
114 step = (int(m.group('step'), 0)
115 if m.group('step') else 1)
116 if m.lastindex <= 1:
[all …]
Dstack.py16 import math as m namespace
34 x = m.inf
36 x = -m.inf
39 assert isinstance(x, int) or m.isinf(x), x
43 if self.x == m.inf:
45 elif self.x == -m.inf:
51 assert not m.isinf(self.x)
68 if diff == +m.inf:
70 elif diff == -m.inf:
78 if m.isinf(new) and m.isinf(old):
[all …]
Dtracebd.py16 import math as m namespace
195 for i in range(2**(2*m.ceil(m.log2(max(width, height))))):
197 b = '{:0{}b}'.format(i, 2*m.ceil(m.log2(i+1)/2))
379 m.floor(start*len(self.blocks)),
380 m.ceil(stop*len(self.blocks)))
426 start = m.floor(x * (size*count)/(width*height))
427 stop = m.ceil((x+1) * (size*count)/(width*height))
435 start = m.floor(start * len(self.blocks)/(self.size*self.count))
436 stop = m.ceil(stop * len(self.blocks)/(self.size*self.count))
711 m = pattern.match(line)
[all …]
Dcov.py19 import math as m namespace
43 x = m.inf
45 x = -m.inf
48 assert isinstance(x, int) or m.isinf(x), x
52 if self.x == m.inf:
54 elif self.x == -m.inf:
60 assert not m.isinf(self.x)
77 if diff == +m.inf:
79 elif diff == -m.inf:
87 if m.isinf(new) and m.isinf(old):
[all …]
Dplotmpl.py18 import math as m namespace
101 p = 3*int(m.log(abs(x), 10**3))
117 p = 10*int(m.log(abs(x), 2**10))
151 scale = self.base ** (m.ceil(m.log((vmax-vmin) / (nbins+1), self.base)))
184 if m.isinf(x) or m.isnan(x):
357 if self_i < len(self_xweights) else m.inf)
359 if other_i < len(other_xweights) else m.inf)
378 if self_i < len(self_xweights) else m.inf)
396 if other_i < len(other_xweights) else m.inf)
408 if self_i < len(self_xweights) else m.inf)
[all …]
Dplot.py18 import math as m namespace
98 p = 3*int(m.log(abs(x)*10, 10**3))
117 p = 10*int(m.log(abs(x)*10, 2**10))
253 if m.isinf(x) or m.isnan(x):
265 return m.log(x)+1
267 return -m.log(-x)-1
611 if self_i < len(self_xweights) else m.inf)
613 if other_i < len(other_xweights) else m.inf)
632 if self_i < len(self_xweights) else m.inf)
650 if other_i < len(other_xweights) else m.inf)
[all …]
Dreadtree.py21 for m in it.chain((m for d in dirs for m in d), mdirs):
22 if set(m.blocks) == set(tail):
24 cycle = m.blocks
Dreadmdir.py366 ' (was %s)' % ', '.join('%d' % m.rev for m in mdir.pair[1:])
/littlefs-3.7.0-3.6.0/
Dlfs.c2315 if (lfs_pair_cmp(d->m.pair, oldpair) == 0) { in lfs_dir_relocatingcommit()
2316 d->m = *dir; in lfs_dir_relocatingcommit()
2317 if (d->m.pair != pair) { in lfs_dir_relocatingcommit()
2321 d->m.pair[0] = LFS_BLOCK_NULL; in lfs_dir_relocatingcommit()
2322 d->m.pair[1] = LFS_BLOCK_NULL; in lfs_dir_relocatingcommit()
2339 while (d->id >= d->m.count && d->m.split) { in lfs_dir_relocatingcommit()
2341 d->id -= d->m.count; in lfs_dir_relocatingcommit()
2342 int err = lfs_dir_fetch(lfs, &d->m, d->m.tail); in lfs_dir_relocatingcommit()
2360 if (dir != &f->m && lfs_pair_cmp(f->m.pair, dir->pair) == 0 && in lfs_dir_orphaningcommit()
2434 if (lfs_pair_cmp(lpair, d->m.pair) == 0) { in lfs_dir_orphaningcommit()
[all …]
Dlfs.h374 lfs_mdir_t m; member
385 lfs_mdir_t m; member
425 lfs_mdir_t m; member
DREADME.md221 - [littlefs-js] - A javascript wrapper for littlefs. I'm not sure why you would
DDESIGN.md2162 [m]: https://latex.codecogs.com/svg.latex?m
/littlefs-3.7.0-3.6.0/tests/
Dtest_powerloss.toml38 lfs_block_t pair[2] = {dir.m.pair[0], dir.m.pair[1]};
39 uint32_t rev = dir.m.rev;
134 lfs_block_t block = dir.m.pair[0];
135 lfs_off_t off = dir.m.off;
Dtest_move.toml108 lfs_block_t block = dir.m.pair[0];
189 lfs_block_t block = dir.m.pair[0];
206 block = dir.m.pair[0];
285 lfs_block_t block = dir.m.pair[0];
302 block = dir.m.pair[0];
568 lfs_block_t block = dir.m.pair[0];
655 lfs_block_t block = dir.m.pair[0];
672 block = dir.m.pair[0];
758 lfs_block_t block = dir.m.pair[0];
775 block = dir.m.pair[0];
[all …]
Dtest_entries.toml582 memset(path, 'm', 200);
610 memset(path, 'm', 200);
Dtest_orphans.toml20 lfs_block_t block = dir.m.pair[0];