Home
last modified time | relevance | path

Searched refs:nb_chains (Results 1 – 3 of 3) sorted by relevance

/dports/graphics/libpillowfight/libpillowfight-dae21f97de872e4ad2e94f1b0fc53302a00259fd/src/pillowfight/
H A D_swt.c1086 int nb_chains, nb_after; in merge_chains() local
1101 nb_chains = 0; in merge_chains()
1103 nb_chains++; in merge_chains()
1104 chains = calloc(nb_chains, sizeof(struct swt_chain *)); in merge_chains()
1118 (chains, nb_chains, sizeof(struct swt_chain *), compare_chains, NULL); in merge_chains()
1121 for (i = 0 ; i < nb_chains ; i++) { in merge_chains()
1125 for (j = 0 ; j < nb_chains ; j++) { in merge_chains()
1210 for (j = 0 ; j < nb_chains ; j++) { in merge_chains()
/dports/graphics/py-pypillowfight/pypillowfight-0.3.0/src/pillowfight/
H A D_swt.c1086 int nb_chains, nb_after; in merge_chains() local
1101 nb_chains = 0; in merge_chains()
1103 nb_chains++; in merge_chains()
1104 chains = calloc(nb_chains, sizeof(struct swt_chain *)); in merge_chains()
1118 (chains, nb_chains, sizeof(struct swt_chain *), compare_chains, NULL); in merge_chains()
1121 for (i = 0 ; i < nb_chains ; i++) { in merge_chains()
1125 for (j = 0 ; j < nb_chains ; j++) { in merge_chains()
1210 for (j = 0 ; j < nb_chains ; j++) { in merge_chains()
/dports/science/lammps/lammps-stable_29Sep2021/src/MESONT/
H A Dpair_mesont_tpm.cpp69 std::vector<std::vector<std::array<int,2>>> nb_chains; member in MESONTList
77 return nb_chains; in get_nbs()
230 nb_chains.resize(nbonds); in MESONTList()
269 if (chain[0] != chain[1]) nb_chains[i].push_back(chain); in MESONTList()