/dports/devel/splint/splint-3.1.2/src/Headers/ |
H A D | stateClauseList.h | 61 { int m_ind; stateClause *m_elements = &((x)->elements[0]); \ 62 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \ 70 { int m_ind; stateClause *m_elements = &((x)->elements[0]); \ 71 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \ 79 { int m_ind; stateClause *m_elements = &((x)->elements[0]); \ 80 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | sRefSet.h | 32 { int m_ind; if (sRefSet_isDefined (x)) \ 33 { for (m_ind = 0 ; m_ind < (x)->entries; m_ind++) \ 34 { sRef m_el = (x)->elements[m_ind]; if (!(sRef_isExternal(m_el))) { 43 { int m_ind; if (sRefSet_isDefined (x)) { \ 44 for (m_ind = 0 ; m_ind < (x)->entries; m_ind++) \ 45 { sRef m_el = (x)->elements[m_ind];
|
H A D | intSet.h | 24 { int m_ind; for (m_ind = 0 ; m_ind < (x)->entries; m_ind++) \ 25 { int m_el = (x)->elements[m_ind];
|
H A D | lsymbolSet.h | 31 { int m_ind; \ 32 for (m_ind = 0 ; m_ind < (x)->entries; m_ind++) \ 33 { lsymbol m_el = (x)->elements[m_ind];
|
H A D | lslOpSet.h | 24 { if (lslOpSet_isDefined (x)) { int m_ind; \ 25 for (m_ind = 0 ; m_ind < (x)->entries; m_ind++) \ 26 { lslOp m_el = (x)->elements[m_ind];
|
H A D | sortSet.h | 24 if (sortSet_isDefined (x)) { int m_ind; \ 25 for (m_ind = 0 ; m_ind < (x)->entries; m_ind++) \ 26 { sort m_el = (x)->elements[m_ind];
|
H A D | sigNodeSet.h | 27 int m_ind; \ 28 for (m_ind = 0 ; m_ind < (x)->entries; m_ind++) \ 29 { sigNode m_el = (x)->elements[m_ind];
|
H A D | usymIdSet.h | 52 { int m_ind; if (usymIdSet_isDefined (x)) { \ 53 for (m_ind = 0 ; m_ind < usymIdSet_size(x); m_ind++) \ 54 { usymId m_el = (x)->elements[m_ind];
|
H A D | lsymbolList.h | 19 { int m_ind; lsymbol *m_elements = &((x)->elements[0]); \ 20 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | genericTable.h | 73 { int m_ind; if (genericTable_isDefined (p_g)) \ 74 { for (m_ind = 0 ; m_ind < (p_g)->size; m_ind++) \ 75 { ghbucket m_hb; m_hb = (p_g)->buckets[m_ind]; \
|
H A D | programNodeList.h | 20 { int m_ind; programNode *m_elements = &((x)->elements[0]); \ 21 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | letDeclNodeList.h | 20 { int m_ind; letDeclNode *m_elements = &((x)->elements[0]); \ 21 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | importNodeList.h | 20 { int m_ind; importNode *m_elements = &((x)->elements[0]); \ 21 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | initDeclNodeList.h | 21 { int m_ind; initDeclNode *m_elements = &((x)->elements[0]); \ 22 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | traitRefNodeList.h | 19 { int m_ind; traitRefNode *m_elements = &((x)->elements[0]); \ 20 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | varDeclarationNodeList.h | 20 { int m_ind; varDeclarationNode *m_elements = &((x)->elements[0]); \ 21 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | idDeclList.h | 20 { int m_ind; idDecl *m_elements = &((x)->elements[0]); \ 21 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | storeRefNodeList.h | 19 { int m_ind; storeRefNode *m_elements = &((x)->elements[0]); \ 20 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | varNodeList.h | 19 { int m_ind; varNode *m_elements = &((x)->elements[0]); \ 20 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
H A D | declaratorNodeList.h | 20 { int m_ind; declaratorNode *m_elements = &((x)->elements[0]); \ 21 for (m_ind = 0 ; m_ind < (x)->nelements; m_ind++) \
|
/dports/benchmarks/bonnie++/bonnie++-1.98/ |
H A D | rand.h | 13 Rand() : m_arr(NULL) , m_size(0) , m_ind(0) { } in Rand() 23 m_ind++; in getNum() 24 if(m_ind >= m_size) in getNum() 25 m_ind = 0; in getNum() 26 return m_arr[m_ind]; in getNum() 41 int m_ind; variable
|
/dports/science/chrono/chrono-7.0.1/src/chrono/motion_functions/ |
H A D | ChFunction_Poly.h | 46 void Set_coeff(double m_coeff, int m_ind) { in Set_coeff() argument 47 if (m_ind >= POLY_COEFF_ARRAY) { in Set_coeff() 50 coeff[m_ind] = m_coeff; in Set_coeff() 60 double Get_coeff(int m_ind) const { in Get_coeff() argument 61 if (m_ind >= POLY_COEFF_ARRAY) { in Get_coeff() 64 return coeff[m_ind]; in Get_coeff()
|
/dports/misc/vxl/vxl-3.3.2/contrib/rpl/rgrl/ |
H A D | rgrl_initializer_inv_indexing.cxx | 98 for (unsigned int m_ind = 0; m_ind<num_moving_sets; ++m_ind) in add_multiple_data() local 101 for (unsigned int pt = 0; pt<moving_sets[m_ind].size(); pt++) in add_multiple_data() 105 query_pt.set_cartesian(moving_sets[m_ind][pt]->cartesian_invariants()); in add_multiple_data() 106 query_pt.set_angular(moving_sets[m_ind][pt]->angular_invariants()); in add_multiple_data() 123 …matches_[m_ind].push_back( new rgrl_invariant_match(moving_sets[m_ind][pt], fixed_set[near_neighbo… in add_multiple_data() 126 std::sort(matches_[m_ind].begin(), matches_[m_ind].end(), dist_greater); in add_multiple_data()
|
/dports/science/gromacs/gromacs-2021.4/src/gromacs/gmxana/ |
H A D | cmat.cpp | 65 snew(m->m_ind, n1); in init_mat() 90 dst->m_ind[i] = src->m_ind[i]; in copy_t_mat() 99 srenew(m->m_ind, m->nn + deltan); in enlarge_mat() 126 m->m_ind[i] = i; in reset_index() 145 sfree((*m)->m_ind); in done_mat() 169 itmp = m->m_ind[iswap]; in swap_rows() 170 m->m_ind[iswap] = m->m_ind[jswap]; in swap_rows() 171 m->m_ind[jswap] = itmp; in swap_rows() 197 tmp->mat[m->m_ind[i]][m->m_ind[j]] = m->mat[i][j]; in swap_mat()
|
/dports/devel/splint/splint-3.1.2/test/ |
H A D | forbody.c | 4 { for (m_ind = 0 ; m_ind < 4; m_ind++) \ 5 { int m_el; m_el = m_ind; m_el = 'a'; }
|