/dports/science/healpix/Healpix_3.50/src/f90/mod/ |
H A D | long_intrinsic.F90 | 77 dim8=dim ; mysize = size(array, dim8) 79 mysize = size(array, dim=dim) 94 dim8=dim ; mysize = size(array, dim8) 96 mysize = size(array, dim=dim) 115 dim8=dim ; mysize = size(array, dim8) 117 mysize = size(array, dim=dim) 134 mysize = size(array, dim=dim) 154 mysize = size(array, dim=dim) 171 mysize = size(array, dim=dim) 191 mysize = size(array, dim=dim) [all …]
|
/dports/math/combblas/CombBLAS_beta_16_2/psort-1.0/driver/ |
H A D | psort_driver.cc | 34 static void check_result (double *work, int mysize) { in check_result() argument 50 if (vpsort::is_sorted (work, work + mysize, in check_result() 59 void genData (char type, int rank, double *work, int mysize) in genData() argument 68 for (long i=0; i<mysize; ++i) work[i] = rank * mysize + i; in genData() 73 for (long i=0; i<mysize; ++i) work[i] = mtrand (); in genData() 126 long mysize = size / (long) nproc; in main() local 127 double *work = new double[mysize]; in main() 130 for (int i=0; i<nproc; ++i) dist[i] = mysize; in main() 132 genData (datagen, rank, work, mysize); in main() 167 genData (datagen, rank, work, mysize); in main() [all …]
|
/dports/multimedia/avidemux-qt5/avidemux_2.7.6/avidemux_core/ADM_coreUtils/src/Source/ |
H A D | JSONChildren.h | 68 array[mysize++] = item; in push_back() 97 return mysize; in size() 103 return mysize == 0; in empty() 112 mysize = 0; in clear() 126 return array + mysize; in end() 221 mysize += num; in insert() 244 array = json_realloc<JSONNode*>(array, mysize); in insert() 247 mycapacity = mysize; in insert() 270 json_index_t mysize; //the number of valid items in insert() variable 301 } else if (mysize > myreserved){ in shrink() [all …]
|
H A D | JSONChildren.cpp | 23 if (json_unlikely(mysize == mycapacity)){ //it's full in inc() 48 if (json_likely(mysize + amount >= mycapacity)){ //it's full in inc() 60 mycapacity = mysize + amount; //increment the size of the array in inc() 62 while(mysize + amount > mycapacity){ in inc() 84 JSON_ASSERT(position + number <= array + mysize, JSON_TEXT("erasing out of bounds 2")); in doerase() 85 if (position + number >= array + mysize){ in doerase() 86 mysize = (json_index_t)(position - array); in doerase() 91 …std::memmove(position, position + number, (mysize - (position - array) - number) * sizeof(JSONNode… in doerase() 92 mysize -= number; in doerase()
|
/dports/multimedia/avidemux-cli/avidemux_2.7.6/avidemux_core/ADM_coreUtils/src/Source/ |
H A D | JSONChildren.h | 68 array[mysize++] = item; in push_back() 97 return mysize; in size() 103 return mysize == 0; in empty() 112 mysize = 0; in clear() 126 return array + mysize; in end() 221 mysize += num; in insert() 244 array = json_realloc<JSONNode*>(array, mysize); in insert() 247 mycapacity = mysize; in insert() 270 json_index_t mysize; //the number of valid items in insert() variable 301 } else if (mysize > myreserved){ in shrink() [all …]
|
H A D | JSONChildren.cpp | 23 if (json_unlikely(mysize == mycapacity)){ //it's full in inc() 48 if (json_likely(mysize + amount >= mycapacity)){ //it's full in inc() 60 mycapacity = mysize + amount; //increment the size of the array in inc() 62 while(mysize + amount > mycapacity){ in inc() 84 JSON_ASSERT(position + number <= array + mysize, JSON_TEXT("erasing out of bounds 2")); in doerase() 85 if (position + number >= array + mysize){ in doerase() 86 mysize = (json_index_t)(position - array); in doerase() 91 …std::memmove(position, position + number, (mysize - (position - array) - number) * sizeof(JSONNode… in doerase() 92 mysize -= number; in doerase()
|
/dports/multimedia/avidemux-plugins/avidemux_2.7.6/avidemux_core/ADM_coreUtils/src/Source/ |
H A D | JSONChildren.h | 68 array[mysize++] = item; in push_back() 97 return mysize; in size() 103 return mysize == 0; in empty() 112 mysize = 0; in clear() 126 return array + mysize; in end() 221 mysize += num; in insert() 244 array = json_realloc<JSONNode*>(array, mysize); in insert() 247 mycapacity = mysize; in insert() 270 json_index_t mysize; //the number of valid items in insert() variable 301 } else if (mysize > myreserved){ in shrink() [all …]
|
H A D | JSONChildren.cpp | 23 if (json_unlikely(mysize == mycapacity)){ //it's full in inc() 48 if (json_likely(mysize + amount >= mycapacity)){ //it's full in inc() 60 mycapacity = mysize + amount; //increment the size of the array in inc() 62 while(mysize + amount > mycapacity){ in inc() 84 JSON_ASSERT(position + number <= array + mysize, JSON_TEXT("erasing out of bounds 2")); in doerase() 85 if (position + number >= array + mysize){ in doerase() 86 mysize = (json_index_t)(position - array); in doerase() 91 …std::memmove(position, position + number, (mysize - (position - array) - number) * sizeof(JSONNode… in doerase() 92 mysize -= number; in doerase()
|
/dports/multimedia/avidemux/avidemux_2.7.6/avidemux_core/ADM_coreUtils/src/Source/ |
H A D | JSONChildren.h | 68 array[mysize++] = item; in push_back() 97 return mysize; in size() 103 return mysize == 0; in empty() 112 mysize = 0; in clear() 126 return array + mysize; in end() 221 mysize += num; in insert() 244 array = json_realloc<JSONNode*>(array, mysize); in insert() 247 mycapacity = mysize; in insert() 270 json_index_t mysize; //the number of valid items in insert() variable 301 } else if (mysize > myreserved){ in shrink() [all …]
|
H A D | JSONChildren.cpp | 23 if (json_unlikely(mysize == mycapacity)){ //it's full in inc() 48 if (json_likely(mysize + amount >= mycapacity)){ //it's full in inc() 60 mycapacity = mysize + amount; //increment the size of the array in inc() 62 while(mysize + amount > mycapacity){ in inc() 84 JSON_ASSERT(position + number <= array + mysize, JSON_TEXT("erasing out of bounds 2")); in doerase() 85 if (position + number >= array + mysize){ in doerase() 86 mysize = (json_index_t)(position - array); in doerase() 91 …std::memmove(position, position + number, (mysize - (position - array) - number) * sizeof(JSONNode… in doerase() 92 mysize -= number; in doerase()
|
/dports/audio/infamous-plugins-lv2/infamousPlugins-0.3.0-7-g778e591/src/qsvgui/ |
H A D | qsvgdial.cpp | 18 mysize = k.width(); in qSVGDial() 19 if (mysize<n.width()) mysize = n.width(); in qSVGDial() 20 if (mysize<k.height()) mysize = k.height(); in qSVGDial() 21 if (mysize<n.height()) mysize = n.height(); in qSVGDial() 48 mysize = k.width(); in qSVGDial() 49 if (mysize<n.width()) mysize = n.width(); in qSVGDial() 50 if (mysize<k.height()) mysize = k.height(); in qSVGDial() 51 if (mysize<n.height()) mysize = n.height(); in qSVGDial() 81 knob->setScale(this->height()/mysize); in resizeEvent() 89 knob->setScale(this->width()/mysize); in resizeEvent() [all …]
|
/dports/converters/R-cran-RJSONIO/RJSONIO/src/libjson/Source/ |
H A D | JSONChildren.h | 71 array[mysize++] = item; in push_back() 100 return mysize; in size() 106 return mysize == 0; in empty() 115 mysize = 0; in clear() 129 return array + mysize; in end() 224 mysize += num; in insert() 247 array = json_realloc<JSONNode*>(array, mysize); in insert() 250 mycapacity = mysize; in insert() 273 json_index_t mysize; //the number of valid items in insert() variable 304 } else if (mysize > myreserved){ in shrink() [all …]
|
H A D | JSONChildren.cpp | 27 if (json_unlikely(mysize == mycapacity)){ //it's full in inc() 52 if (json_likely(mysize + amount >= mycapacity)){ //it's full in inc() 64 mycapacity = mysize + amount; //increment the size of the array in inc() 66 while(mysize + amount > mycapacity){ in inc() 89 if (position + number >= array + mysize){ in doerase() 90 mysize = (json_index_t)(position - array); in doerase() 95 …std::memmove(position, position + number, (mysize - (position - array) - number) * sizeof(JSONNode… in doerase() 96 mysize -= number; in doerase()
|
/dports/net/mpich2/mpich2-1.5/src/mpe2/src/graphics/contrib/life/ |
H A D | life_g.c | 28 int mysize, sum ; in life() local 48 mysize = matrix_size/size + ((rank < (matrix_size % size)) ? 1 : 0 ) ; in life() 56 matrix = (int **) malloc(sizeof(int *)*(mysize+2)) ; in life() 57 temp = (int **) malloc(sizeof(int *)*(mysize+2)) ; in life() 58 for (i = 0; i < mysize+2; i++) { in life() 65 matrix[0][j] = matrix[mysize+1][j] = temp[0][j] = temp[mysize+1][j] = DIES ; in life() 66 for (i = 0; i < mysize+2; i++) in life() 70 for (i = 1; i <= mysize; i++) { in life() 71 srand48((long)(1000^(i-1+mysize))) ; in life() 93 MPI_Isend(&matrix[mysize][0],matrix_size+2,MPI_INT,next,0,comm,req+2); in life() [all …]
|
/dports/www/dillo2/dillo-3.0.5/src/ |
H A D | gif.c | 773 if (!mysize) in Gif_get_descriptor() 908 if (!mysize) in GIF_Block() 924 if (!mysize) in GIF_Block() 967 size_t mysize; in Gif_process_bytes() local 972 if (!mysize) in Gif_process_bytes() 975 ibuf += mysize; in Gif_process_bytes() 981 if (!mysize) in Gif_process_bytes() 984 ibuf += mysize; in Gif_process_bytes() 993 if (!mysize) in Gif_process_bytes() 996 ibuf += mysize; in Gif_process_bytes() [all …]
|
/dports/dns/unbound/unbound-1.14.0/testcode/ |
H A D | unitregional.c | 54 size_t mysize; in corner_cases() local 118 mysize = 1280; /* does not fit in current chunk */ in corner_cases() 119 a = regional_alloc(r, mysize); in corner_cases() 120 memset(a, 0x42, mysize); in corner_cases() 132 mysize = r->available; /* exactly fits */ in corner_cases() 133 a = regional_alloc(r, mysize); in corner_cases() 134 memset(a, 0x42, mysize); in corner_cases() 159 a = regional_alloc(r, mysize); in corner_cases() 160 memset(a, 0x42, mysize); in corner_cases() 173 a = regional_alloc(r, mysize); in corner_cases() [all …]
|
/dports/science/cp2k-data/cp2k-7.1.0/src/ |
H A D | hfx_libint_interface.F | 433 a_mysize = mysize 1312 a_mysize = mysize 1495 a_mysize = mysize 1529 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1574 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1619 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1664 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1709 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1754 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1799 work(1:mysize) = work(1:mysize) + p_work(1:mysize) [all …]
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/ |
H A D | hfx_libint_interface.F | 433 a_mysize = mysize 1312 a_mysize = mysize 1495 a_mysize = mysize 1529 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1574 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1619 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1664 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1709 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1754 work(1:mysize) = work(1:mysize) + p_work(1:mysize) 1799 work(1:mysize) = work(1:mysize) + p_work(1:mysize) [all …]
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/common/ |
H A D | eigenvalueproblems.F | 52 SUBROUTINE diagonalise_ssyev(matrix, mysize, storageform, eigenvalues, & argument 56 INTEGER, INTENT(IN) :: mysize local 66 REAL(KIND=dp) :: work(3*mysize - 1) 81 lwork = 3*mysize - 1 85 CALL lapack_ssyev(jobz, uplo, mysize, eigenvectors, lda, eigenvalues, & 101 SUBROUTINE diagonalise_chpev(matrix, mysize, storageform, eigenvalues, & argument 105 INTEGER, INTENT(IN) :: mysize local 116 COMPLEX(KIND=dp) :: work(2*mysize - 1) 117 REAL(KIND=dp) :: rwork(3*mysize - 2) 131 CALL lapack_chpev(jobz, uplo, mysize, matrix, eigenvalues, & [all …]
|
/dports/science/cp2k-data/cp2k-7.1.0/src/common/ |
H A D | eigenvalueproblems.F | 52 SUBROUTINE diagonalise_ssyev(matrix, mysize, storageform, eigenvalues, & argument 56 INTEGER, INTENT(IN) :: mysize local 66 REAL(KIND=dp) :: work(3*mysize - 1) 81 lwork = 3*mysize - 1 85 CALL lapack_ssyev(jobz, uplo, mysize, eigenvectors, lda, eigenvalues, & 101 SUBROUTINE diagonalise_chpev(matrix, mysize, storageform, eigenvalues, & argument 105 INTEGER, INTENT(IN) :: mysize local 116 COMPLEX(KIND=dp) :: work(2*mysize - 1) 117 REAL(KIND=dp) :: rwork(3*mysize - 2) 131 CALL lapack_chpev(jobz, uplo, mysize, matrix, eigenvalues, & [all …]
|
/dports/math/py-pygsl/pygsl-2.3.0/typemaps/ |
H A D | gsl_block_special_typemaps.i | 24 int mysize = 0; variable 37 mysize = PyArray_DIM(_PyVector_1$argnum, 0); 39 …_PyVector_2$argnum = PyGSL_vector_check(PySequence_GetItem($input, 1), mysize, PyGSL_DARRAY_CINPUT… 45 $3 = (size_t) mysize; 59 int mysize = 0; variable 64 mysize = PyArray_DIM(_PyVector$argnum, 0); 66 $2 = (size_t) mysize;
|
/dports/devel/boost-docs/boost_1_72_0/libs/mpi/test/ |
H A D | scatter_test.cpp | 129 int mysize = comm.rank() + 1; in scatterv_test() local 130 std::vector<value_type> myvalues(mysize); in scatterv_test() 145 assert(mysize == sizes[comm.rank()]); in scatterv_test() 148 scatterv(comm, &(myvalues[0]), mysize, root); in scatterv_test() 151 for (int i = 0; i < mysize; ++i) in scatterv_test() 171 int mysize = comm.rank() + 1; in scatterd_test() local 172 std::vector<value_type> myvalues(mysize); in scatterd_test() 200 assert(mysize == sizes[comm.rank()]); in scatterd_test() 201 scatterv(comm, values, sizes, displs, &(myvalues[0]), mysize, root); in scatterd_test() 203 scatterv(comm, &(myvalues[0]), mysize, root); in scatterd_test() [all …]
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/mpi/test/ |
H A D | scatter_test.cpp | 129 int mysize = comm.rank() + 1; in scatterv_test() local 130 std::vector<value_type> myvalues(mysize); in scatterv_test() 145 assert(mysize == sizes[comm.rank()]); in scatterv_test() 148 scatterv(comm, &(myvalues[0]), mysize, root); in scatterv_test() 151 for (int i = 0; i < mysize; ++i) in scatterv_test() 171 int mysize = comm.rank() + 1; in scatterd_test() local 172 std::vector<value_type> myvalues(mysize); in scatterd_test() 200 assert(mysize == sizes[comm.rank()]); in scatterd_test() 201 scatterv(comm, values, sizes, displs, &(myvalues[0]), mysize, root); in scatterd_test() 203 scatterv(comm, &(myvalues[0]), mysize, root); in scatterd_test() [all …]
|
/dports/devel/boost-libs/boost_1_72_0/libs/mpi/test/ |
H A D | scatter_test.cpp | 129 int mysize = comm.rank() + 1; in scatterv_test() local 130 std::vector<value_type> myvalues(mysize); in scatterv_test() 145 assert(mysize == sizes[comm.rank()]); in scatterv_test() 148 scatterv(comm, &(myvalues[0]), mysize, root); in scatterv_test() 151 for (int i = 0; i < mysize; ++i) in scatterv_test() 171 int mysize = comm.rank() + 1; in scatterd_test() local 172 std::vector<value_type> myvalues(mysize); in scatterd_test() 200 assert(mysize == sizes[comm.rank()]); in scatterd_test() 201 scatterv(comm, values, sizes, displs, &(myvalues[0]), mysize, root); in scatterd_test() 203 scatterv(comm, &(myvalues[0]), mysize, root); in scatterd_test() [all …]
|
/dports/devel/hyperscan/boost_1_75_0/libs/mpi/test/ |
H A D | scatter_test.cpp | 129 int mysize = comm.rank() + 1; in scatterv_test() local 130 std::vector<value_type> myvalues(mysize); in scatterv_test() 145 assert(mysize == sizes[comm.rank()]); in scatterv_test() 148 scatterv(comm, &(myvalues[0]), mysize, root); in scatterv_test() 151 for (int i = 0; i < mysize; ++i) in scatterv_test() 171 int mysize = comm.rank() + 1; in scatterd_test() local 172 std::vector<value_type> myvalues(mysize); in scatterd_test() 200 assert(mysize == sizes[comm.rank()]); in scatterd_test() 201 scatterv(comm, values, sizes, displs, &(myvalues[0]), mysize, root); in scatterd_test() 203 scatterv(comm, &(myvalues[0]), mysize, root); in scatterd_test() [all …]
|