Home
last modified time | relevance | path

Searched refs:IntHeap (Results 1 – 11 of 11) sorted by relevance

/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/test/
H A Dheap_test.cc180 heapSortTest<IntHeap>(); in main()
192 heapSortTest<IntHeap>(); in main()
204 heapSortTest<IntHeap>(); in main()
216 heapSortTest<IntHeap>(); in main()
228 heapSortTest<IntHeap>(); in main()
240 heapSortTest<IntHeap>(); in main()
252 heapSortTest<IntHeap>(); in main()
264 heapSortTest<IntHeap>(); in main()
278 heapSortTest<IntHeap>(); in main()
289 heapSortTest<IntHeap>(); in main()
[all …]
/dports/math/lemon/lemon-1.3.1/test/
H A Dheap_test.cc180 heapSortTest<IntHeap>(); in main()
192 heapSortTest<IntHeap>(); in main()
204 heapSortTest<IntHeap>(); in main()
216 heapSortTest<IntHeap>(); in main()
228 heapSortTest<IntHeap>(); in main()
240 heapSortTest<IntHeap>(); in main()
252 heapSortTest<IntHeap>(); in main()
264 heapSortTest<IntHeap>(); in main()
278 heapSortTest<IntHeap>(); in main()
289 heapSortTest<IntHeap>(); in main()
[all …]
/dports/net/rclone/rclone-1.57.0/vendor/github.com/aalpar/deheap/
H A Ddeheap_test.go36 type IntHeap []int type
310 h = &IntHeap{2}
348 h = &IntHeap{2}
365 h := &IntHeap{}
373 h = &IntHeap{}
381 h = &IntHeap{}
398 h IntHeap
660 h := &IntHeap{}
684 h = &IntHeap{}
805 h := &IntHeap{}
[all …]
/dports/net/google-cloud-sdk-app-engine-go/platform/google_appengine/goroot-1.9/src/container/heap/
H A Dexample_intheap_test.go14 type IntHeap []int type
16 func (h IntHeap) Len() int { return len(h) }
17 func (h IntHeap) Less(i, j int) bool { return h[i] < h[j] }
18 func (h IntHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
20 func (h *IntHeap) Push(x interface{}) {
26 func (h *IntHeap) Pop() interface{} {
37 h := &IntHeap{2, 1, 5}
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/container/heap/
H A Dexample_intheap_test.go14 type IntHeap []int type
16 func (h IntHeap) Len() int { return len(h) }
17 func (h IntHeap) Less(i, j int) bool { return h[i] < h[j] }
18 func (h IntHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
20 func (h *IntHeap) Push(x any) {
26 func (h *IntHeap) Pop() any {
37 h := &IntHeap{2, 1, 5}
/dports/devel/yaegi/yaegi-0.9.23/_test/
H A Dheap.go10 type IntHeap []int type
12 func (h IntHeap) Len() int { return len(h) }
13 func (h IntHeap) Less(i, j int) bool { return h[i] < h[j] }
14 func (h IntHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
16 func (h *IntHeap) Push(x interface{}) {
22 func (h *IntHeap) Pop() interface{} {
33 h := &IntHeap{2, 1, 5}
/dports/textproc/htmltest/htmltest-0.15.0/vendor/github.com/daviddengcn/go-villa/heap/
H A Dheap_test.go11 type IntHeap []int type
13 func (h *IntHeap) Pop() int {
21 func (h *IntHeap) Push(x int) {
32 var h IntHeap
/dports/lang/mosml/mosml-ver-2.10.1/src/compiler/test/
H A Dokasaki.sml126 structure IntHeap = Bootstrap(PairingHeap)(IntElem); structure
130 fun mkHeap [] = IntHeap.empty
131 | mkHeap (h::t) = IntHeap.insert(h,mkHeap t);
134 val test1 = (1 = IntHeap.findMin(heap));
135 val test2 = (2 = IntHeap.findMin(IntHeap.deleteMin(heap)));
H A Dresult.ok4224 structure IntHeap :
/dports/lang/mosml/mosml-ver-2.10.1/examples/modules/
H A Dbootstrap.sml148 structure IntHeap = Bootstrap(PairingHeap)(IntElem); structure
152 fun mkHeap [] = IntHeap.empty
153 | mkHeap (h::t) = IntHeap.insert(h,mkHeap t);
156 val test1 = (1 = IntHeap.findMin(heap));
157 val test2 = (2 = IntHeap.findMin(IntHeap.deleteMin(heap)));
/dports/lang/ghc/ghc-8.10.7/compiler/cmm/Hoopl/
H A DDataflow.hs141 :: IntHeap -- ^ Worklist, i.e., blocks to process
205 :: IntHeap -- ^ Worklist, i.e., blocks to process
330 -> (IntHeap, FactBase f)
333 -> (IntHeap, FactBase f)
441 type IntHeap = IntSet function