/dports/games/rubix/rubix-1.0.6/ |
H A D | cube.c | 902 c->cubes[6].colors[0]=old.cubes[8].colors[0]; in cube_do_rotate() 903 c->cubes[6].colors[3]=old.cubes[8].colors[5]; in cube_do_rotate() 904 c->cubes[6].colors[4]=old.cubes[8].colors[3]; in cube_do_rotate() 905 c->cubes[9].colors[0]=old.cubes[7].colors[0]; in cube_do_rotate() 906 c->cubes[9].colors[4]=old.cubes[7].colors[3]; in cube_do_rotate() 958 c->cubes[8].colors[3]=old.cubes[6].colors[3]; in cube_do_rotate() 959 c->cubes[8].colors[0]=old.cubes[6].colors[4]; in cube_do_rotate() 960 c->cubes[8].colors[5]=old.cubes[6].colors[0]; in cube_do_rotate() 1037 c->cubes[8].colors[0]=old.cubes[6].colors[0]; in cube_do_rotate() 1038 c->cubes[8].colors[5]=old.cubes[6].colors[3]; in cube_do_rotate() [all …]
|
H A D | screen.c | 332 c->cubes[25].colors[1] = color_marks[0]; in get_marks() 333 c->cubes[22].colors[1] = color_marks[1]; in get_marks() 334 c->cubes[20].colors[1] = color_marks[2]; in get_marks() 335 c->cubes[24].colors[1] = color_marks[3]; in get_marks() 336 c->cubes[1].colors[1] = color_marks[4]; in get_marks() 337 c->cubes[19].colors[1] = color_marks[5]; in get_marks() 338 c->cubes[23].colors[1] = color_marks[6]; in get_marks() 339 c->cubes[21].colors[1] = color_marks[7]; in get_marks() 398 color_marks[4] = c->cubes[1].colors[1]; in set_marks() 427 color_marks[40]= c->cubes[5].colors[5]; in set_marks() [all …]
|
/dports/games/xcubes/xcubes/ |
H A D | Cubes.c | 331 w->cubes.faceSize.x = w->cubes.offset.x * w->cubes.sizeX + in ResizeCubes() 333 w->cubes.faceSize.y = w->cubes.offset.y * w->cubes.sizeY + in ResizeCubes() 337 w->cubes.puzzleSize.y = (w->cubes.faceSize.y - w->cubes.delta.y) * in ResizeCubes() 338 w->cubes.sizeZ + w->cubes.delta.y; in ResizeCubes() 340 w->cubes.puzzleSize.x = (w->cubes.faceSize.x - w->cubes.delta.x) * in ResizeCubes() 341 w->cubes.sizeZ + w->cubes.delta.x; in ResizeCubes() 348 w->cubes.brickSize.x = MAX(w->cubes.offset.x - w->cubes.delta.x, 0); in ResizeCubes() 349 w->cubes.brickSize.y = MAX(w->cubes.offset.y - w->cubes.delta.y, 0); in ResizeCubes() 380 w->cubes.mono != c->cubes.mono) { in SetValuesCubes() 919 w->cubes.sizeRect = w->cubes.sizeX * w->cubes.sizeY; in ResetBricks() [all …]
|
H A D | CubesU.c | 170 startSpace = w->cubes.spacePosition; in FlushMoves() 171 startPosition[w->cubes.sizeBlock - 1] = 0; in FlushMoves() 172 for (i = 0; i < w->cubes.sizeBlock; i++) in FlushMoves() 173 startPosition[i] = w->cubes.brickOfPosition[i]; in FlushMoves() 218 for (i = 0; i < w->cubes.sizeBlock; i++) { in ScanStartPosition() 232 for (i = 0; i < w->cubes.sizeBlock; i++) { in PrintStartPosition() 234 if (!((i + 1) % w->cubes.sizeX)) in PrintStartPosition() 236 if (!((i + 1) % w->cubes.sizeRect)) in PrintStartPosition() 247 w->cubes.spacePosition = startSpace; in SetStartPosition() 248 for (i = 0; i < w->cubes.sizeBlock; i++) in SetStartPosition() [all …]
|
/dports/graphics/reallyslick/rss-glx_0.9.1/src/Implicit/ |
H A D | impCubeVolume.cpp | 44 cubes.clear(); in ~impCubeVolume() 97 cubes[ci].value = function(&(cubes[ci].x)); in makeSurface() 130 cubes[ci].value = function(&(cubes[ci].x)); in makeSurface() 614 cubes[index].value = function(&(cubes[index].x)); in findcornervalues() 620 cubes[index].value = function(&(cubes[index].x)); in findcornervalues() 626 cubes[index].value = function(&(cubes[index].x)); in findcornervalues() 632 cubes[index].value = function(&(cubes[index].x)); in findcornervalues() 638 cubes[index].value = function(&(cubes[index].x)); in findcornervalues() 644 cubes[index].value = function(&(cubes[index].x)); in findcornervalues() 650 cubes[index].value = function(&(cubes[index].x)); in findcornervalues() [all …]
|
/dports/math/dune-grid/dune-grid-de36e4b4e99da4cd7a120a39779345e701821115/dune/grid/io/file/dgfparser/blocks/ |
H A D | simplex.cc | 174 elements.swap( cubes ); in cube2simplex() 179 elements.resize( 6*cubes.size() ); in cube2simplex() 181 params.resize( 6*cubes.size() ); in cube2simplex() 200 elements.resize( 2*cubes.size() ); in cube2simplex() 202 params.resize( 2*cubes.size() ); in cube2simplex() 215 const double dist = vtx[ cubes[ c ][ d ] ][ i ] - vtx[ cubes[ c ][ 3-d ] ][ i ]; in cube2simplex() 226 int tmp0 = cubes[ c ][ 0 ]; in cube2simplex() 227 cubes[ c ][ 0 ] = cubes[ c ][ 1 ]; in cube2simplex() 228 cubes[ c ][ 1 ] = cubes[ c ][ 3 ]; in cube2simplex() 229 cubes[ c ][ 3 ] = cubes[ c ][ 2 ]; in cube2simplex() [all …]
|
H A D | interval.cc | 120 …int IntervalBlock::getHexa ( int block, std::vector< std::vector< unsigned int > > &cubes, int off… in getHexa() argument 127 size_t old_size = cubes.size(); in getHexa() 128 cubes.resize( old_size + nofhexa( block ) ); in getHexa() 129 for( size_t i = old_size; i < cubes.size(); ++i ) in getHexa() 130 cubes[ i ].resize( verticesPerCube ); in getHexa() 142 assert( m < cubes.size() ); in getHexa() 145 cubes[ m ][ j ] = offset; in getHexa() 149 cubes[ m ][ j ] += factor*(i[ d ] + ((j >> d) & 1)); in getHexa() 158 assert( m == cubes.size() ); in getHexa()
|
/dports/x11-toolkits/vte3/vte-0.64.2/perf/ |
H A D | deco.sh | 54 cubes() { function 64 cubes "%d${sep}0${sep}0" "%d${sep}0${sep}0" 66 cubes "0${sep}%d${sep}0" "0${sep}%d${sep}0" 68 cubes "0${sep}0${sep}%d" "0${sep}0${sep}%d" 70 cubes "%d${sep}0${sep}0" "0${sep}%d${sep}0" 72 cubes "%d${sep}0${sep}0" "0${sep}0${sep}%d" 74 cubes "0${sep}%d${sep}0" "%d${sep}0${sep}0" 76 cubes "0${sep}%d${sep}0" "0${sep}0${sep}%d" 78 cubes "0${sep}0${sep}%d" "%d${sep}0${sep}0" 80 cubes "0${sep}0${sep}%d" "0${sep}%d${sep}0"
|
/dports/games/kjumpingcube/kjumpingcube-21.12.3/src/ |
H A D | kcubeboxwidget.cpp | 31 cubes.clear(); in KCubeBoxWidget() 88 cubes.at(index)->setOwner (owner); in displayCube() 89 cubes.at(index)->setValue (value); in displayCube() 95 cubes.at(index)->setDark(); in highlightCube() 98 cubes.at(index)->setNeutral(); in highlightCube() 107 cubes.at(index)->setDark(); in timedCubeHighlight() 197 qDeleteAll (cubes); in initCubes() 198 cubes.clear(); in initCubes() 203 cubes.append (cube); in initCubes() 352 cubes.at (index)->move ( in reCalculateGraphics() [all …]
|
/dports/science/fasthenry/fasthenry-3.0wr/src/fasthenry/ |
H A D | mulSetup.c | 91 cube *****cubes, *nextc; local 217 if(cubes[i] == NULL) { 443 sys->cubes = cubes; 523 cube *nextc, *****cubes = sys->cubes; local 615 cube *nextc, *parent, *****cubes = sys->cubes; local 656 cube *nextc, *parent, *****cubes = sys->cubes; local 779 cube *nc, *nkid, *****cubes = sys->cubes; local 904 cube *nc, *np, *****cubes = sys->cubes; local 980 cube *nc, **plnc, **pdnc, **pmnc, *****cubes = sys->cubes; local 1037 cube *nc, *****cubes = sys->cubes; local [all …]
|
H A D | Prec_cost.c | 14 double OneCubeCost(cubes, i,j,k,l,side, dir_cost) in OneCubeCost() argument 15 cube *****cubes; in OneCubeCost() 22 this_size = cubes[i][j][k][l]->upnumeles[0]; 30 && (cubes[i][m][n][p] != NULL) ) { 33 total += cubes[i][m][n][p]->multisize/2.0; 94 cube *****cubes = sys->cubes; local 105 nc = cubes[i][j][k][m]; 138 int *****cubes; local 147 CALLOC(cubes[i][j], side, int**, ON, AMSC); 151 cubes[i][j][k][m] = 0; [all …]
|
/dports/science/fastcap/fastcap-2.0wr/src/ |
H A D | mulSetup.c | 118 cube *****cubes, *nextc; local 211 if(cubes[i][j] == NULL) { 328 sys->cubes = cubes; 405 cube *nextc, *****cubes = sys->cubes; local 497 cube *nextc, *parent, *****cubes = sys->cubes; local 619 cube *nc, *nkid, *****cubes = sys->cubes; local 730 cube *nc, *np, *****cubes = sys->cubes; local 747 nc = cubes[i][j][k][l]; 806 cube *nc, **plnc, **pdnc, **pmnc, *****cubes = sys->cubes; local 863 cube *nc, *****cubes = sys->cubes; local [all …]
|
/dports/math/vtk8/VTK-8.2.0/Accelerators/Vtkm/Testing/Cxx/ |
H A D | TestVTKMMarchingCubes.cxx | 43 vtkNew<vtkmContour> cubes; in RunVTKPipeline() local 45 cubes->SetInputConnection(t->GetOutputPort()); in RunVTKPipeline() 46 cubes->SetInputArrayToProcess( in RunVTKPipeline() 48 cubes->SetNumberOfContours(1); in RunVTKPipeline() 49 cubes->SetValue(0,50.5f); in RunVTKPipeline() 50 cubes->ComputeScalarsOn(); in RunVTKPipeline() 51 cubes->ComputeNormalsOn(); in RunVTKPipeline() 54 mapper->SetInputConnection(cubes->GetOutputPort()); in RunVTKPipeline() 74 vtkDataSet *output = cubes->GetOutput(); in RunVTKPipeline()
|
/dports/math/vtk9/VTK-9.1.0/Accelerators/Vtkm/Filters/Testing/Cxx/ |
H A D | TestVTKMMarchingCubes.cxx | 43 vtkNew<vtkmContour> cubes; in RunVTKPipeline() local 45 cubes->SetInputConnection(t->GetOutputPort()); in RunVTKPipeline() 46 cubes->SetInputArrayToProcess(0, 0, 0, vtkDataObject::FIELD_ASSOCIATION_POINTS, "Iterations"); in RunVTKPipeline() 47 cubes->SetNumberOfContours(1); in RunVTKPipeline() 48 cubes->SetValue(0, 50.5f); in RunVTKPipeline() 49 cubes->ComputeScalarsOn(); in RunVTKPipeline() 50 cubes->ComputeNormalsOn(); in RunVTKPipeline() 53 mapper->SetInputConnection(cubes->GetOutputPort()); in RunVTKPipeline() 73 vtkDataSet* output = cubes->GetOutput(); in RunVTKPipeline()
|
/dports/graphics/processing/processing-1.5.1/modes/android/examples/OpenGL/SpaceJunk/ |
H A D | SpaceJunk.pde | 4 // Rotating cubes in space using a custom Cube class. 14 // Array for all cubes 15 Cube[]cubes = new Cube[limit]; 24 // Instantiate cubes, passing in random vals for size and postion 25 for (int i = 0; i< cubes.length; i++){ 26 cubes[i] = new Cube(int(random(-10, 10)), int(random(-10, 10)), 55 // Draw cubes 56 for (int i = 0; i < cubes.length; i++){ 57 cubes[i].drawCube();
|
/dports/graphics/processing/processing-1.5.1/modes/java/libraries/opengl/examples/SpaceJunk/ |
H A D | SpaceJunk.pde | 7 * Rotating cubes in space using a custom Cube class. 20 // Array for all cubes 21 Cube[]cubes = new Cube[limit]; 28 // Instantiate cubes, passing in random vals for size and postion 29 for (int i = 0; i< cubes.length; i++){ 30 cubes[i] = new Cube(int(random(-10, 10)), int(random(-10, 10)), 56 // Draw cubes 57 for (int i = 0; i < cubes.length; i++){ 58 cubes[i].drawCube();
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/espresso/ |
H A D | espresso.c | 72 && (cost.out != cost.cubes*cube.part_size[cube.num_vars-1]) 99 } while (cost.cubes < best_cost.cubes); 105 if (cost.cubes >= best_cost.cubes) 111 } while (cost.cubes < best_cost.cubes || 112 (cost.cubes == best_cost.cubes && cost.total < best_cost.total));
|
H A D | cvrmisc.c | 29 cost->cubes = F->count; 66 cost->cubes, cost->cubes - cost->primes, cost->in, 70 cost->cubes, cost->cubes - cost->primes, cost->in, 89 d->cubes = s->cubes;
|
/dports/graphics/opendx/dx-4.4.4/src/exec/dxmods/ |
H A D | _refinetopo.c | 681 TETRA2(nTetras, tetras, cubes[0], cubes[3], cubes[5], cubes[1], positions); in IrregCubes2Tetrahedra() 682 TETRA2(nTetras, tetras, cubes[5], cubes[2], cubes[7], cubes[3], positions); in IrregCubes2Tetrahedra() 683 TETRA2(nTetras, tetras, cubes[5], cubes[4], cubes[7], cubes[2], positions); in IrregCubes2Tetrahedra() 684 TETRA2(nTetras, tetras, cubes[5], cubes[3], cubes[0], cubes[2], positions); in IrregCubes2Tetrahedra() 685 TETRA2(nTetras, tetras, cubes[5], cubes[2], cubes[0], cubes[4], positions); in IrregCubes2Tetrahedra() 686 TETRA2(nTetras, tetras, cubes[4], cubes[2], cubes[6], cubes[7], positions); in IrregCubes2Tetrahedra() 759 TETDATA(dataOut, dataIn, dataSize, cubes[0], cubes[3], cubes[5], cubes[1], positions); in IrregCubes2Tetrahedra() 760 TETDATA(dataOut, dataIn, dataSize, cubes[5], cubes[2], cubes[7], cubes[3], positions); in IrregCubes2Tetrahedra() 761 TETDATA(dataOut, dataIn, dataSize, cubes[5], cubes[4], cubes[7], cubes[2], positions); in IrregCubes2Tetrahedra() 762 TETDATA(dataOut, dataIn, dataSize, cubes[5], cubes[3], cubes[0], cubes[2], positions); in IrregCubes2Tetrahedra() [all …]
|
/dports/math/vtk6/VTK-6.2.0/Accelerators/Dax/Testing/Cxx/ |
H A D | TestDaxMarchingCubes.cxx | 42 vtkNew<vtkDaxContour> cubes; in RunVTKPipeline() local 44 cubes->SetInputConnection(t->GetOutputPort()); in RunVTKPipeline() 45 cubes->SetInputArrayToProcess( in RunVTKPipeline() 47 cubes->SetNumberOfContours(1); in RunVTKPipeline() 48 cubes->SetValue(0,50.5f); in RunVTKPipeline() 49 cubes->ComputeScalarsOn(); in RunVTKPipeline() 52 mapper->SetInputConnection(cubes->GetOutputPort()); in RunVTKPipeline()
|
/dports/games/blockout/BL_SRC/BlockOut/ |
H A D | Game.cpp | 263 BLOCKITEM cubes[MAX_CUBE]; in Render() local 758 BLOCKITEM cubes[MAX_CUBE]; in AddPolyCube() local 764 thePit.AddCube( cubes[i].x , cubes[i].y , cubes[i].z ); in AddPolyCube() 1127 BLOCKITEM cubes[MAX_CUBE]; in GetBottom() local 1134 if(cubes[i].z >= max) max=cubes[i].z; in GetBottom() 1147 BLOCKITEM cubes[MAX_CUBE]; in IsLower() local 1200 BLOCKITEM cubes[MAX_CUBE]; in IsOverlap() local 1207 if( thePit.GetValue( cubes[i].x , cubes[i].y , cubes[i].z ) ) { in IsOverlap() 1209 pos->x = cubes[i].x; in IsOverlap() 1210 pos->y = cubes[i].y; in IsOverlap() [all …]
|
H A D | PolyCube.cpp | 89 cubes[nbCube].x = x; in AddCube() 90 cubes[nbCube].y = y; in AddCube() 91 cubes[nbCube].z = z; in AddCube() 163 if(cubes[i].x > maxW) maxW = cubes[i].x; in GetWidth() 172 if(cubes[i].y > maxH) maxH = cubes[i].y; in GetHeight() 181 if(cubes[i].z > maxD) maxD = cubes[i].z; in GetDepth() 678 c[i] = cubes[i]; in CopyCube() 707 found = (cubes[i].x == x) && (cubes[i].y == y) && (cubes[i].z == z); in FindCube() 719 int x = cubes[cubeIdx].x; in IsFaceVisible() 720 int y = cubes[cubeIdx].y; in IsFaceVisible() [all …]
|
/dports/x11/xscreensaver/xscreensaver-5.44/hacks/glx/ |
H A D | cubetwist.c | 57 cube *cubes; member 187 if (bp->cubes) abort(); in make_cubes() 196 bp->cubes = c; in make_cubes() 317 cube *c = bp->cubes; in add_random_oscillator() 391 while (bp->cubes) in cube_handle_event() 395 bp->cubes = c; in cube_handle_event() 562 bp->cubes->pos.x = bp->cubes->pos.y = bp->cubes->pos.z = 0; in draw_cube() 563 bp->cubes->rot.x = bp->cubes->rot.y = bp->cubes->rot.z = 0; in draw_cube() 579 while (bp->cubes) in free_cube() 582 free (bp->cubes); in free_cube() [all …]
|
/dports/math/latte-integrale/latte-version_1_7_6/EXAMPLES/ |
H A D | Makefile.am | 79 cubes/cube_2.ext \ 80 cubes/cube_2.ine \ 81 cubes/cube_3.ext \ 82 cubes/cube_3.ine \ 83 cubes/cube_4.ext \ 84 cubes/cube_4.ine \ 85 cubes/cube_5.ext \ 86 cubes/cube_5.ine \ 87 cubes/cube_6.ext \ 88 cubes/cube_6.ine \ [all …]
|
/dports/math/py-numpy/numpy-1.20.3/tools/swig/test/ |
H A D | SuperTensor.cxx | 43 TYPE SNAME ## Max(TYPE * supertensor, int cubes, int slices, int rows, int cols) { \ 46 for (l=0; l<cubes; ++l) { \ 59 TYPE SNAME ## Min(int cubes, int slices, int rows, int cols, TYPE * supertensor) { \ 62 for (l=0; l<cubes; ++l) { \ 83 void SNAME ## Floor(TYPE * array, int cubes, int slices, int rows, int cols, TYPE floor) { \ 85 for (l=0; l<cubes; ++l) { \ 97 void SNAME ## Ceil(int cubes, int slices, int rows, int cols, TYPE * array, TYPE ceil) { \ 99 for (l=0; l<cubes; ++l) { \
|