| /dports/math/suitesparse-klu/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| H A D | Mongoose_EdgeCutProblem.cpp | 60 void *memoryLocation = SuiteSparse_malloc(1, sizeof(EdgeCutProblem)); in create()
82 = (graph->shallow_i) ? _i : (Int *)SuiteSparse_malloc(nz, sizeof(Int)); in create()
94 graph->partition = (bool *)SuiteSparse_malloc(n, sizeof(bool)); in create()
95 graph->vertexGains = (double *)SuiteSparse_malloc(n, sizeof(double)); in create()
98 graph->bhHeap[0] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
99 graph->bhHeap[1] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
118 graph->matchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
119 graph->invmatchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
120 graph->matchtype = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
151 graph->x = (double *)SuiteSparse_malloc(_parent->nz, sizeof(double)); in create()
[all …]
|
| /dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| H A D | Mongoose_EdgeCutProblem.cpp | 60 void *memoryLocation = SuiteSparse_malloc(1, sizeof(EdgeCutProblem)); in create()
82 = (graph->shallow_i) ? _i : (Int *)SuiteSparse_malloc(nz, sizeof(Int)); in create()
94 graph->partition = (bool *)SuiteSparse_malloc(n, sizeof(bool)); in create()
95 graph->vertexGains = (double *)SuiteSparse_malloc(n, sizeof(double)); in create()
98 graph->bhHeap[0] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
99 graph->bhHeap[1] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
118 graph->matchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
119 graph->invmatchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
120 graph->matchtype = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
151 graph->x = (double *)SuiteSparse_malloc(_parent->nz, sizeof(double)); in create()
[all …]
|
| /dports/math/suitesparse-ldl/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| H A D | Mongoose_EdgeCutProblem.cpp | 60 void *memoryLocation = SuiteSparse_malloc(1, sizeof(EdgeCutProblem)); in create()
82 = (graph->shallow_i) ? _i : (Int *)SuiteSparse_malloc(nz, sizeof(Int)); in create()
94 graph->partition = (bool *)SuiteSparse_malloc(n, sizeof(bool)); in create()
95 graph->vertexGains = (double *)SuiteSparse_malloc(n, sizeof(double)); in create()
98 graph->bhHeap[0] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
99 graph->bhHeap[1] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
118 graph->matchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
119 graph->invmatchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
120 graph->matchtype = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
151 graph->x = (double *)SuiteSparse_malloc(_parent->nz, sizeof(double)); in create()
[all …]
|
| /dports/math/suitesparse-config/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| H A D | Mongoose_EdgeCutProblem.cpp | 60 void *memoryLocation = SuiteSparse_malloc(1, sizeof(EdgeCutProblem)); in create()
82 = (graph->shallow_i) ? _i : (Int *)SuiteSparse_malloc(nz, sizeof(Int)); in create()
94 graph->partition = (bool *)SuiteSparse_malloc(n, sizeof(bool)); in create()
95 graph->vertexGains = (double *)SuiteSparse_malloc(n, sizeof(double)); in create()
98 graph->bhHeap[0] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
99 graph->bhHeap[1] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
118 graph->matchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
119 graph->invmatchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
120 graph->matchtype = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
151 graph->x = (double *)SuiteSparse_malloc(_parent->nz, sizeof(double)); in create()
[all …]
|
| /dports/math/suitesparse-amd/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| H A D | Mongoose_EdgeCutProblem.cpp | 60 void *memoryLocation = SuiteSparse_malloc(1, sizeof(EdgeCutProblem)); in create()
82 = (graph->shallow_i) ? _i : (Int *)SuiteSparse_malloc(nz, sizeof(Int)); in create()
94 graph->partition = (bool *)SuiteSparse_malloc(n, sizeof(bool)); in create()
95 graph->vertexGains = (double *)SuiteSparse_malloc(n, sizeof(double)); in create()
98 graph->bhHeap[0] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
99 graph->bhHeap[1] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
118 graph->matchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
119 graph->invmatchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
120 graph->matchtype = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
151 graph->x = (double *)SuiteSparse_malloc(_parent->nz, sizeof(double)); in create()
[all …]
|
| /dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| H A D | Mongoose_EdgeCutProblem.cpp | 60 void *memoryLocation = SuiteSparse_malloc(1, sizeof(EdgeCutProblem)); in create()
82 = (graph->shallow_i) ? _i : (Int *)SuiteSparse_malloc(nz, sizeof(Int)); in create()
94 graph->partition = (bool *)SuiteSparse_malloc(n, sizeof(bool)); in create()
95 graph->vertexGains = (double *)SuiteSparse_malloc(n, sizeof(double)); in create()
98 graph->bhHeap[0] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
99 graph->bhHeap[1] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
118 graph->matchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
119 graph->invmatchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
120 graph->matchtype = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
151 graph->x = (double *)SuiteSparse_malloc(_parent->nz, sizeof(double)); in create()
[all …]
|
| /dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| /dports/math/suitesparse-colamd/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| H A D | Mongoose_EdgeCutProblem.cpp | 60 void *memoryLocation = SuiteSparse_malloc(1, sizeof(EdgeCutProblem)); in create()
82 = (graph->shallow_i) ? _i : (Int *)SuiteSparse_malloc(nz, sizeof(Int)); in create()
94 graph->partition = (bool *)SuiteSparse_malloc(n, sizeof(bool)); in create()
95 graph->vertexGains = (double *)SuiteSparse_malloc(n, sizeof(double)); in create()
98 graph->bhHeap[0] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
99 graph->bhHeap[1] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
118 graph->matchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
119 graph->invmatchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
120 graph->matchtype = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
151 graph->x = (double *)SuiteSparse_malloc(_parent->nz, sizeof(double)); in create()
[all …]
|
| /dports/math/suitesparse-camd/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| /dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| /dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| /dports/math/suitesparse-spqr/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| /dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| /dports/math/suitesparse-rbio/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| H A D | Mongoose_EdgeCutProblem.cpp | 60 void *memoryLocation = SuiteSparse_malloc(1, sizeof(EdgeCutProblem)); in create()
82 = (graph->shallow_i) ? _i : (Int *)SuiteSparse_malloc(nz, sizeof(Int)); in create()
94 graph->partition = (bool *)SuiteSparse_malloc(n, sizeof(bool)); in create()
95 graph->vertexGains = (double *)SuiteSparse_malloc(n, sizeof(double)); in create()
98 graph->bhHeap[0] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
99 graph->bhHeap[1] = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
118 graph->matchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
119 graph->invmatchmap = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
120 graph->matchtype = (Int *)SuiteSparse_malloc(n, sizeof(Int)); in create()
151 graph->x = (double *)SuiteSparse_malloc(_parent->nz, sizeof(double)); in create()
[all …]
|
| /dports/math/suitesparse-btf/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| /dports/math/suitesparse-csparse/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|
| /dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/Mongoose/Source/ |
| H A D | Mongoose_QPDelta.cpp | 24 ret->x = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
27 = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars), sizeof(Int)); in Create()
28 ret->FreeSet_list = (Int *)SuiteSparse_malloc( in Create()
30 ret->gradient = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
32 ret->D = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
37 ret->wi[i] = (Int *)SuiteSparse_malloc(static_cast<size_t>(numVars + 1), in Create()
43 ret->wx[i] = (double *)SuiteSparse_malloc(static_cast<size_t>(numVars), in Create()
|