/dports/math/suitesparse-klu/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
/dports/math/suitesparse-config/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
/dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
/dports/math/suitesparse-colamd/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
/dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
/dports/math/suitesparse-camd/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
/dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
/dports/math/suitesparse-spqr/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
/dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/Mongoose/Source/ |
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 57 n_free = 0; in QPNapDown() 76 n_free++; in QPNapDown() 77 free_heap[n_free] = i; in QPNapDown() 112 QPMaxHeap_build(free_heap, n_free, breakpts); in QPNapDown() 120 if (n_free > 0) in QPNapDown() 127 n_free = QPMaxHeap_delete(free_heap, n_free, breakpts); in QPNapDown() 128 if (n_free == 0) in QPNapDown() 146 n_free = QPMaxHeap_add(e, free_heap, breakpts, n_free); in QPNapDown() 156 maxfree = (n_free > 0 ? breakpts[free_heap[1]] : -INFINITY); in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 56 n_free = 0; in QPNapUp() 75 n_free++; in QPNapUp() 76 free_heap[n_free] = i; in QPNapUp() 106 QPMinHeap_build(free_heap, n_free, breakpts); in QPNapUp() 114 if (n_free > 0) in QPNapUp() 121 n_free = QPMinHeap_delete(free_heap, n_free, breakpts); in QPNapUp() 122 if (n_free == 0) in QPNapUp() 140 n_free = QPMinHeap_add(e, free_heap, breakpts, n_free); in QPNapUp() 150 minfree = (n_free > 0 ? breakpts[free_heap[1]] : INFINITY); in QPNapUp()
|