/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 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_heap[1]] : -INFINITY); in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_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 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_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 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_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 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_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 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_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 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_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 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_heap[1]] : -INFINITY); in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_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 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_heap[1]] : -INFINITY); in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_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 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_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 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_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 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_heap[1]] : -INFINITY); in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_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 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_heap[1]] : INFINITY); in QPNapUp()
|
H A D | Mongoose_QPNapDown.cpp | 46 Int i, k, e, maxsteps, n_bound, n_free; in QPNapDown() local 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_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 56 n_bound = 0; in QPNapDown() 67 n_bound++; in QPNapDown() 68 bound_heap[n_bound] = i; in QPNapDown() 113 QPMaxHeap_build(bound_heap, n_bound, breakpts); in QPNapDown() 136 if (n_bound > 0) in QPNapDown() 140 n_bound = QPMaxHeap_delete(bound_heap, n_bound, breakpts); in QPNapDown() 147 if (n_bound == 0) in QPNapDown() 157 maxbound = (n_bound > 0 ? breakpts[bound_heap[1]] : -INFINITY); in QPNapDown()
|
H A D | Mongoose_QPNapUp.cpp | 45 Int i, k, e, maxsteps, n_bound, n_free; in QPNapUp() local 55 n_bound = 0; in QPNapUp() 66 n_bound++; in QPNapUp() 67 bound_heap[n_bound] = i; in QPNapUp() 107 QPMinHeap_build(bound_heap, n_bound, breakpts); in QPNapUp() 130 if (n_bound > 0) in QPNapUp() 134 n_bound = QPMinHeap_delete(bound_heap, n_bound, breakpts); in QPNapUp() 141 if (n_bound == 0) in QPNapUp() 151 minbound = (n_bound > 0 ? breakpts[bound_heap[1]] : INFINITY); in QPNapUp()
|