/dports/graphics/Coin/coin-Coin-4.0.0/src/rendering/ |
H A D | SoVertexArrayIndexer.cpp | 82 this->indexarray.append(static_cast<GLint> (i)); in addIndex() 222 this->indexarray.fit(); in close() 319 int count = this->indexarray.getLength(); in getNumVertices() 433 if (this->indexarray.getLength()) { in sort_triangles() 434 qsort((void*) this->indexarray.getArrayPtr(), in sort_triangles() 435 this->indexarray.getLength() / 3, in sort_triangles() 449 if (this->indexarray.getLength()) { in sort_lines() 450 qsort((void*) this->indexarray.getArrayPtr(), in sort_lines() 451 this->indexarray.getLength() / 2, in sort_lines() 464 return this->indexarray.getLength(); in getNumIndices() [all …]
|
H A D | SoVertexArrayIndexer.h | 89 SbList <GLint> indexarray; variable
|
/dports/japanese/w3m/w3m-2b59b9e/ |
H A D | matrix.c | 63 LUfactor(Matrix A, int *indexarray) in LUfactor() argument 72 indexarray[i] = i; in LUfactor() 103 SWAPI(indexarray[i_max], indexarray[k]); in LUfactor() 122 LUsolve(Matrix A, int *indexarray, Vector b, Vector x) in LUsolve() argument 127 x->ve[i] = b->ve[indexarray[i]]; in LUsolve() 140 int *indexarray = NewAtom_N(int, A->dim); 143 LUfactor(A1, indexarray); 144 return LUinverse(A1, indexarray, out); 149 LUinverse(Matrix A, int *indexarray, Matrix out) in LUinverse() argument 162 if (LUsolve(A, indexarray, tmp, tmp2) == -1) in LUinverse()
|
H A D | table.c | 184 short *indexarray; in dv2sv() local 203 indexarray[ii] = indexarray[ii - 1]; in dv2sv() 205 indexarray[i] = k; in dv2sv() 212 k = indexarray[i]; in dv2sv() 868 j = indexarray[k]; in check_cell_height() 901 j = indexarray[k]; in check_cell_width() 997 indexarray[ii] = indexarray[ii - 1]; in set_integered_width() 999 indexarray[i] = k; in set_integered_width() 1523 short *indexarray; in check_table_height() member 1572 cell.indexarray = New_Reuse(short, cell.indexarray, in check_table_height() [all …]
|
/dports/japanese/w3m-img/w3m-2b59b9e/ |
H A D | matrix.c | 63 LUfactor(Matrix A, int *indexarray) in LUfactor() argument 72 indexarray[i] = i; in LUfactor() 103 SWAPI(indexarray[i_max], indexarray[k]); in LUfactor() 122 LUsolve(Matrix A, int *indexarray, Vector b, Vector x) in LUsolve() argument 127 x->ve[i] = b->ve[indexarray[i]]; in LUsolve() 140 int *indexarray = NewAtom_N(int, A->dim); 143 LUfactor(A1, indexarray); 144 return LUinverse(A1, indexarray, out); 149 LUinverse(Matrix A, int *indexarray, Matrix out) in LUinverse() argument 162 if (LUsolve(A, indexarray, tmp, tmp2) == -1) in LUinverse()
|
H A D | table.c | 184 short *indexarray; in dv2sv() local 203 indexarray[ii] = indexarray[ii - 1]; in dv2sv() 205 indexarray[i] = k; in dv2sv() 212 k = indexarray[i]; in dv2sv() 868 j = indexarray[k]; in check_cell_height() 901 j = indexarray[k]; in check_cell_width() 997 indexarray[ii] = indexarray[ii - 1]; in set_integered_width() 999 indexarray[i] = k; in set_integered_width() 1523 short *indexarray; in check_table_height() member 1572 cell.indexarray = New_Reuse(short, cell.indexarray, in check_table_height() [all …]
|
/dports/www/w3m/w3m-2b59b9e/ |
H A D | matrix.c | 63 LUfactor(Matrix A, int *indexarray) in LUfactor() argument 72 indexarray[i] = i; in LUfactor() 103 SWAPI(indexarray[i_max], indexarray[k]); in LUfactor() 122 LUsolve(Matrix A, int *indexarray, Vector b, Vector x) in LUsolve() argument 127 x->ve[i] = b->ve[indexarray[i]]; in LUsolve() 140 int *indexarray = NewAtom_N(int, A->dim); 143 LUfactor(A1, indexarray); 144 return LUinverse(A1, indexarray, out); 149 LUinverse(Matrix A, int *indexarray, Matrix out) in LUinverse() argument 162 if (LUsolve(A, indexarray, tmp, tmp2) == -1) in LUinverse()
|
H A D | table.c | 184 short *indexarray; in dv2sv() local 203 indexarray[ii] = indexarray[ii - 1]; in dv2sv() 205 indexarray[i] = k; in dv2sv() 212 k = indexarray[i]; in dv2sv() 868 j = indexarray[k]; in check_cell_height() 901 j = indexarray[k]; in check_cell_width() 997 indexarray[ii] = indexarray[ii - 1]; in set_integered_width() 999 indexarray[i] = k; in set_integered_width() 1523 short *indexarray; in check_table_height() member 1572 cell.indexarray = New_Reuse(short, cell.indexarray, in check_table_height() [all …]
|
/dports/www/w3m-img/w3m-2b59b9e/ |
H A D | matrix.c | 63 LUfactor(Matrix A, int *indexarray) in LUfactor() argument 72 indexarray[i] = i; in LUfactor() 103 SWAPI(indexarray[i_max], indexarray[k]); in LUfactor() 122 LUsolve(Matrix A, int *indexarray, Vector b, Vector x) in LUsolve() argument 127 x->ve[i] = b->ve[indexarray[i]]; in LUsolve() 140 int *indexarray = NewAtom_N(int, A->dim); 143 LUfactor(A1, indexarray); 144 return LUinverse(A1, indexarray, out); 149 LUinverse(Matrix A, int *indexarray, Matrix out) in LUinverse() argument 162 if (LUsolve(A, indexarray, tmp, tmp2) == -1) in LUinverse()
|
H A D | table.c | 184 short *indexarray; in dv2sv() local 203 indexarray[ii] = indexarray[ii - 1]; in dv2sv() 205 indexarray[i] = k; in dv2sv() 212 k = indexarray[i]; in dv2sv() 868 j = indexarray[k]; in check_cell_height() 901 j = indexarray[k]; in check_cell_width() 997 indexarray[ii] = indexarray[ii - 1]; in set_integered_width() 999 indexarray[i] = k; in set_integered_width() 1523 short *indexarray; in check_table_height() member 1572 cell.indexarray = New_Reuse(short, cell.indexarray, in check_table_height() [all …]
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/OPTPP/src/PDS/ |
H A D | create_scheme.C | 93 int *indexarray = new int[scheme_limit]; in create_scheme() local 108 {indexarray[i] = (int) index(i);} in create_scheme() 115 make_search(ndim, fptrscheme, &scheme_limit, scheme, indexarray, in create_scheme() 136 if (indexarray != NULL) in create_scheme() 137 delete[] indexarray; in create_scheme()
|
/dports/www/phpgroupware/phpgroupware-0.9.16.017/sitemgr/modules/ |
H A D | class.module_toc_block.inc.php | 15 $indexarray = $objbo->getCatLinks(); 18 foreach($indexarray as $cat) 27 if (count($indexarray)==0)
|
H A D | class.module_index.inc.php | 15 $indexarray = $objbo->getIndex(); 20 foreach($indexarray as $temppage) 45 if (count($indexarray)==0)
|
H A D | class.module_index_block.inc.php | 15 $indexarray = $objbo->getIndex(false,true); 18 foreach($indexarray as $page) 42 if (count($indexarray)==0)
|
/dports/devel/boost-docs/boost_1_72_0/libs/python/test/numpy/ |
H A D | indexing.py | 36 numpy.testing.assert_equal(indexing_ext.indexarray(x,chk),chk) 38 numpy.testing.assert_equal(indexing_ext.indexarray(x,chk),chk) 43 numpy.testing.assert_equal(indexing_ext.indexarray(x,y,z),chk) 47 numpy.testing.assert_equal(indexing_ext.indexarray(x,b),chk)
|
H A D | indexing.cpp | 15 p::object indexarray(np::ndarray ndarr, np::ndarray d1) { return ndarr[d1];} in indexarray() function 24 p::def("indexarray", indexarray); in BOOST_PYTHON_MODULE()
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/python/test/numpy/ |
H A D | indexing.py | 36 numpy.testing.assert_equal(indexing_ext.indexarray(x,chk),chk) 38 numpy.testing.assert_equal(indexing_ext.indexarray(x,chk),chk) 43 numpy.testing.assert_equal(indexing_ext.indexarray(x,y,z),chk) 47 numpy.testing.assert_equal(indexing_ext.indexarray(x,b),chk)
|
H A D | indexing.cpp | 15 p::object indexarray(np::ndarray ndarr, np::ndarray d1) { return ndarr[d1];} in indexarray() function 24 p::def("indexarray", indexarray); in BOOST_PYTHON_MODULE()
|
/dports/devel/boost-libs/boost_1_72_0/libs/python/test/numpy/ |
H A D | indexing.py | 36 numpy.testing.assert_equal(indexing_ext.indexarray(x,chk),chk) 38 numpy.testing.assert_equal(indexing_ext.indexarray(x,chk),chk) 43 numpy.testing.assert_equal(indexing_ext.indexarray(x,y,z),chk) 47 numpy.testing.assert_equal(indexing_ext.indexarray(x,b),chk)
|
H A D | indexing.cpp | 15 p::object indexarray(np::ndarray ndarr, np::ndarray d1) { return ndarr[d1];} in indexarray() function 24 p::def("indexarray", indexarray); in BOOST_PYTHON_MODULE()
|
/dports/devel/hyperscan/boost_1_75_0/libs/python/test/numpy/ |
H A D | indexing.py | 36 numpy.testing.assert_equal(indexing_ext.indexarray(x,chk),chk) 38 numpy.testing.assert_equal(indexing_ext.indexarray(x,chk),chk) 43 numpy.testing.assert_equal(indexing_ext.indexarray(x,y,z),chk) 47 numpy.testing.assert_equal(indexing_ext.indexarray(x,b),chk)
|
H A D | indexing.cpp | 15 p::object indexarray(np::ndarray ndarr, np::ndarray d1) { return ndarr[d1];} in indexarray() function 24 p::def("indexarray", indexarray); in BOOST_PYTHON_MODULE()
|
/dports/graphics/Coin/coin-Coin-4.0.0/src/profiler/ |
H A D | SoProfilingReportGenerator.cpp | 459 boost::scoped_array<int> indexarray; in generate() local 462 indexarray[c] = c; in generate() 466 arraystart = &indexarray[0]; in generate() 467 arrayend = &indexarray[numindexes-1]; in generate() 485 entryidx = indexarray[c]; in generate() 511 boost::scoped_array<int> indexarray; in generate() local 514 indexarray[c] = c; in generate() 518 arraystart = &indexarray[0]; in generate() 564 boost::scoped_array<int> indexarray; in generate() local 567 indexarray[c] = c; in generate() [all …]
|
/dports/math/barvinok/barvinok-0.41.5/zsolve/ |
H A D | Makefile.am | 32 indexarray.c \ 44 indexarray.h \
|
H A D | Makefile.in | 143 linearsystem.lo indexarray.lo lattice.lo matrix.lo \ 170 ./$(DEPDIR)/indexarray.Plo ./$(DEPDIR)/lattice.Plo \ 387 indexarray.c \ 399 indexarray.h \ 489 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/indexarray.Plo@am__quote@ # am--include-marker 664 -rm -f ./$(DEPDIR)/indexarray.Plo 722 -rm -f ./$(DEPDIR)/indexarray.Plo
|