Home
last modified time | relevance | path

Searched refs:SMALLEST (Results 1 - 10 of 10) sorted by relevance

/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.c422 #define SMALLEST 1 macro
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
434 pqdownheap(s, tree, SMALLEST); \
627 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
666 m = s->heap[SMALLEST]; /* m = node of next least frequency */
683 s->heap[SMALLEST] = node++;
684 pqdownheap(s, tree, SMALLEST);
688 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
/third_party/node/deps/zlib/
H A Dtrees.c478 #define SMALLEST 1 macro
488 top = s->heap[SMALLEST]; \
489 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
490 pqdownheap(s, tree, SMALLEST); \
634 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n + 1]. in build_tree()
673 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()
690 s->heap[SMALLEST] = node++; in build_tree()
691 pqdownheap(s, tree, SMALLEST); in build_tree()
695 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c430 #define SMALLEST 1 macro
440 top = s->heap[SMALLEST]; \
441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
442 pqdownheap(s, tree, SMALLEST); \
635 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
674 m = s->heap[SMALLEST]; /* m = node of next least frequency */
691 s->heap[SMALLEST] = node++;
692 pqdownheap(s, tree, SMALLEST);
696 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c422 #define SMALLEST 1 macro
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
434 pqdownheap(s, tree, SMALLEST); \
627 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
666 m = s->heap[SMALLEST]; /* m = node of next least frequency */
683 s->heap[SMALLEST] = node++;
684 pqdownheap(s, tree, SMALLEST);
688 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
/third_party/zlib/
H A Dtrees.c495 #define SMALLEST 1 macro
505 top = s->heap[SMALLEST]; \
506 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
507 pqdownheap(s, tree, SMALLEST); \
654 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n + 1]. in build_tree()
693 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()
710 s->heap[SMALLEST] = node++; in build_tree()
711 pqdownheap(s, tree, SMALLEST); in build_tree()
715 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
/third_party/python/Lib/test/
H A Dtest_xmlrpc.py21 from test.support import ALWAYS_EQ, LARGEST, SMALLEST namespace
568 self.assertFalse(dtime < SMALLEST)
569 self.assertTrue(dtime > SMALLEST)
570 self.assertFalse(dtime <= SMALLEST)
571 self.assertTrue(dtime >= SMALLEST)
H A Dtest_ipaddress.py14 from test.support import LARGEST, SMALLEST namespace
1000 self.assertFalse(obj < SMALLEST)
1001 self.assertTrue(obj > SMALLEST)
1002 self.assertFalse(obj <= SMALLEST)
1003 self.assertTrue(obj >= SMALLEST)
H A Ddatetimetester.py24 from test.support import is_resource_enabled, ALWAYS_EQ, LARGEST, SMALLEST namespace
367 self.assertFalse(tz < SMALLEST)
368 self.assertTrue(tz > SMALLEST)
369 self.assertFalse(tz <= SMALLEST)
370 self.assertTrue(tz >= SMALLEST)
474 self.assertFalse(me < SMALLEST)
475 self.assertTrue(me > SMALLEST)
476 self.assertFalse(me <= SMALLEST)
477 self.assertTrue(me >= SMALLEST)
/third_party/python/Lib/test/test_asyncio/
H A Dtest_events.py38 from test.support import ALWAYS_EQ, LARGEST, SMALLEST namespace
2469 self.assertFalse(h1 < SMALLEST)
2470 self.assertTrue(h1 > SMALLEST)
2471 self.assertFalse(h1 <= SMALLEST)
2472 self.assertTrue(h1 >= SMALLEST)
/third_party/python/Lib/test/support/
H A D__init__.py60 "ALWAYS_EQ", "NEVER_EQ", "LARGEST", "SMALLEST",
1981 SMALLEST = _SMALLEST() variable

Completed in 28 milliseconds