/dports/graphics/vigra/vigra-8acd73a/test/permutation/ |
H A D | test.cxx | 55 shouldEqual(permutations[0][0], 0); in testN1() 63 shouldEqual(permutations[0][0], 0); in testN2() 64 shouldEqual(permutations[0][1], 1); in testN2() 66 shouldEqual(permutations[1][0], 1); in testN2() 67 shouldEqual(permutations[1][1], 0); in testN2() 75 shouldEqual(permutations[0][0], 0); in testN3() 76 shouldEqual(permutations[0][1], 1); in testN3() 77 shouldEqual(permutations[0][2], 2); in testN3() 79 shouldEqual(permutations[1][0], 0); in testN3() 80 shouldEqual(permutations[1][1], 2); in testN3() [all …]
|
/dports/science/py-ruffus/ruffus-2.8.3/doc/decorators/ |
H A D | permutations.rst | 2 .. _decorators.permutations: 4 pair: @permutations; Syntax 8 * :ref:`@permutations <new_manual.permutations>` in the **Ruffus** Manual 12 .. _input: `decorators.permutations.input`_ 16 .. _filter: `decorators.permutations.filter`_ 25 permutations chapter 133 # @permutations 185 .. _decorators.permutations.input: 196 .. _decorators.permutations.filter: 209 .. _decorators.permutations.output: [all …]
|
/dports/science/cdk/cdk-cdk-2.3/tool/group/src/main/java/org/openscience/cdk/group/ |
H A D | PermutationGroup.java | 102 private Permutation[][] permutations; field in PermutationGroup 131 this.permutations = new Permutation[size][size]; in PermutationGroup() 205 if (this.permutations[i][j] != null) { in order() 222 return this.permutations[uIndex][uSubIndex]; in get() 314 permutations.add(p); in all() 323 return permutations; in all() 338 Permutation g = permutations[j][a]; in changeBase() 347 Permutation g = permutations[j][a]; in changeBase() 356 this.permutations = h.permutations.clone(); in changeBase() 375 Permutation h = permutations[j][a]; in enter() [all …]
|
/dports/devel/gdb/gdb-11.1/gdb/testsuite/gdb.cp/ |
H A D | nsalias.exp | 229 set permutations {} 230 lappend permutations "outer" 231 lappend permutations "Outer" 232 lappend permutations "outer::inner" 233 lappend permutations "Outer::inner" 234 lappend permutations "outer::Inner" 235 lappend permutations "Outer::Inner" 236 lappend permutations "outer::inner::innermost" 237 lappend permutations "outer::inner::Innermost" 238 lappend permutations "outer::Inner::innermost" [all …]
|
/dports/science/py-esda/esda-2.4.1/esda/ |
H A D | lee.py | 17 def __init__(self, connectivity=None, permutations=999): argument 46 self.permutations = permutations 86 if self.permutations is None: 88 elif self.permutations < 1: 91 if self.permutations: 94 for _ in range(self.permutations) 99 extreme = numpy.minimum(self.permutations - larger, larger) 113 def __init__(self, connectivity=None, permutations=999): argument 150 self.permutations = permutations 205 if self.permutations: [all …]
|
H A D | moran.py | 163 self.permutations = permutations 180 if permutations: 415 if permutations: 581 variables=variables_n, w=w, permutations=permutations, varnames=varnames 600 results[i, j] = Moran_BV(y1, y2, w, permutations=permutations) 601 results[j, i] = Moran_BV(y2, y1, w, permutations=permutations) 734 permutations=permutations, 1021 self.permutations = permutations 1031 if permutations: 1318 self.permutations = permutations [all …]
|
H A D | geary_local_mv.py | 11 def __init__(self, connectivity=None, permutations=999): argument 35 self.permutations = permutations 79 permutations = self.permutations 87 if permutations: 92 low_extreme = (permutations - larger) < larger 93 larger[low_extreme] = permutations - larger[low_extreme] 94 self.p_sim = (larger + 1.0) / (permutations + 1.0) 134 Gs = np.zeros((self.n, self.permutations)) 135 prange = list(range(self.permutations))
|
H A D | join_counts_local.py | 18 permutations=PERMUTATIONS, argument 60 self.permutations = permutations 65 def fit(self, y, n_jobs=1, permutations=999): argument 120 if permutations: 125 permutations=permutations,
|
H A D | getisord.py | 108 def __init__(self, y, w, permutations=PERMUTATIONS): argument 114 self.permutations = permutations 125 if permutations: 132 if (self.permutations - larger) < larger: 133 larger = self.permutations - larger 135 self.EG_sim = sum(sim) / permutations 389 permutations=PERMUTATIONS, argument 402 self.permutations = permutations 406 if permutations: 411 permutations, [all …]
|
H A D | geary_local.py | 20 permutations=999, argument 80 self.permutations = permutations 118 permutations = self.permutations 126 if permutations: 131 permutations=permutations,
|
H A D | join_counts_local_bv.py | 25 permutations=PERMUTATIONS, argument 58 self.permutations = permutations 63 def fit(self, x, z, case="CLC", n_jobs=1, permutations=999): argument 138 if permutations: 144 permutations=permutations, 156 permutations=permutations,
|
/dports/devel/libluksde/libluksde-20200205/libfcrypto/ |
H A D | libfcrypto_rc4_context.c | 214 internal_context->permutations[ byte_value ] = (uint8_t) byte_value; in libfcrypto_rc4_context_set_key() 224 …values_index = ( values_index + internal_context->permutations[ byte_value ] + key[ key_byte_index… in libfcrypto_rc4_context_set_key() 226 permutation_value = internal_context->permutations[ byte_value ]; in libfcrypto_rc4_context_set_key() 227 internal_context->permutations[ byte_value ] = internal_context->permutations[ values_index ]; in libfcrypto_rc4_context_set_key() 228 internal_context->permutations[ values_index ] = permutation_value; in libfcrypto_rc4_context_set_key() 332 values_index2 = ( values_index2 + internal_context->permutations[ values_index1 ] ) & 0xff; in libfcrypto_rc4_crypt() 334 permutation_value = internal_context->permutations[ values_index1 ]; in libfcrypto_rc4_crypt() 335 internal_context->permutations[ values_index1 ] = internal_context->permutations[ values_index2 ]; in libfcrypto_rc4_crypt() 336 internal_context->permutations[ values_index2 ] = permutation_value; in libfcrypto_rc4_crypt() 338 …permutation_value = ( permutation_value + internal_context->permutations[ values_index1 ] ) & 0xff; in libfcrypto_rc4_crypt() [all …]
|
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/github.com/GoASTScanner/gas/vendor/github.com/nbutton23/zxcvbn-go/matching/ |
H A D | leet.go | 13 permutations := getAllPermutationsOfLeetSubstitutions(password, substitutions) 17 for _, permutation := range permutations { 33 var permutations []string 42 permutations = append(permutations, permutation) 46 permutations = append(permutations, permutation[:index+1]+temp) 55 return permutations
|
/dports/graphics/py-pointpats/pointpats-2.2.0/pointpats/ |
H A D | spacetime.py | 243 if permutations: 244 joint = np.zeros((permutations, 1), int) 245 for p in range(permutations): 251 if (permutations - larger) < larger: 252 larger = permutations - larger 347 if not permutations: 352 for i in range(permutations): 453 if not permutations: 458 for p in range(permutations): 580 if not permutations: [all …]
|
/dports/math/pear-Math_Combinatorics/Math_Combinatorics-1.0.0/ |
H A D | Combinatorics.php | 140 public function permutations(array $set, $subset_size = null) function in Math_Combinatorics 143 $permutations = array(); 146 $permutations = array_merge($permutations, 150 return $permutations; 166 $permutations = array(); 172 $permutations[] = array_merge(array($key => $val), $permutation); 186 $permutations[] = array_merge(array($key => $val), $permutation); 193 return $permutations;
|
/dports/games/alephone/alephone-release-20190331/Extras/extract/ |
H A D | sndextract.cpp | 144 definition->permutations= 0; in extract_sound_resources() 148 short permutations; in extract_sound_resources() local 153 for (permutations= 0; permutations<MAXIMUM_PERMUTATIONS_PER_SOUND; ++permutations) in extract_sound_resources() 155 Handle sound_handle= GetResource('snd ', definition->sound_code + permutations + base_resource); in extract_sound_resources() 188 definition->sound_offsets[permutations]= definition->total_length; in extract_sound_resources() 191 if (!permutations) definition->single_length= definition->total_length; in extract_sound_resources() 201 if (!(definition->permutations= permutations)) in extract_sound_resources()
|
/dports/graphics/py-giddy/giddy-2.3.3/giddy/ |
H A D | rank.py | 104 self.permutations = permutations 105 if permutations: 111 den = permutations + 1.0 370 if permutations > 0: 371 taus = np.zeros(permutations) 373 for r in range(permutations): 611 if permutations > 0: 630 1 + permutations 777 if permutations > 0: 797 1 + permutations [all …]
|
/dports/biology/py-scikit-bio/scikit-bio-0.5.6/skbio/stats/distance/ |
H A D | _mantel.py | 21 def mantel(x, y, method='pearson', permutations=999, alternative='two-sided', argument 262 if permutations < 0: 280 if permutations == 0 or np.isnan(orig_stat): 284 for _ in range(permutations)) 285 permuted_stats = np.fromiter(perm_gen, np.float, count=permutations) 295 p_value = (count_better + 1) / (permutations + 1) 301 def pwmantel(dms, labels=None, method='pearson', permutations=999, argument 416 stat, p_val, n = mantel(x, y, method=method, permutations=permutations, 420 results[i] = (xlabel, ylabel, stat, p_val, n, method, permutations,
|
/dports/science/R-cran-e1071/e1071/man/ |
H A D | permutations.Rd | 1 \name{permutations} 2 \alias{permutations} 5 Returns a matrix containing all permutations of the integers 9 permutations(n) 16 permutations(3)
|
/dports/math/polymake/polymake-4.5/apps/common/cpperl/ |
H A D | auto-permuted.cpperl | 3 …ermuted", "include": ["polymake/Array.h", "polymake/Set.h", "polymake/permutations.h"], "sig": "pe… 4 …Array.h", "polymake/Rational.h", "polymake/SparseVector.h", "polymake/permutations.h"], "sig": "pe… 5 …ymake/Array.h", "polymake/Rational.h", "polymake/Vector.h", "polymake/permutations.h"], "sig": "pe… 6 …ermuted", "include": ["polymake/Array.h", "polymake/Set.h", "polymake/permutations.h"], "sig": "pe… 7 …t>&>"], "func": "permuted", "include": ["polymake/Array.h", "polymake/permutations.h"], "sig": "pe… 8 …t>&>"], "func": "permuted", "include": ["polymake/Array.h", "polymake/permutations.h"], "sig": "pe… 9 …nclude": ["polymake/Array.h", "polymake/IncidenceMatrix.h", "polymake/permutations.h"], "sig": "pe… 10 …ional.h", "polymake/TropicalNumber.h", "polymake/Vector.h", "polymake/permutations.h"], "sig": "pe…
|
/dports/science/py-inequality/inequality-1.0.0/inequality/ |
H A D | gini.py | 148 def __init__(self, x, w, permutations=99): argument 165 if permutations: 167 wcgp = np.zeros((permutations, )) 168 for perm in range(permutations): 173 if (permutations - larger) < larger: 174 larger = permutations - larger 176 self.p_sim = (larger + 1.) / (permutations + 1.)
|
/dports/math/maxima/maxima-5.43.2/share/combinatorics/ |
H A D | README | 9 I have added a package that implements some of the permutations 13 Since Maxima's nset package already includes functions permutations 15 list, I have used the name "perm" for permutations written as a list 17 will give the list of permutations of degree n, in contrast to 18 permutations(set) which gives that list of permutations applied to the 32 perms_lex returns the list of permutations of degree n in 35 perms(n) gives tht complete list of permutations using a
|
/dports/science/py-phonopy/phonopy-2.11.0/phonopy/harmonic/ |
H A D | force_constants.py | 102 permutations = symmetry.atomic_permutations 107 permutations, 223 permutations = primitive.atomic_permutations 245 permutations, argument 249 permutations, atom_list_done) 262 permutations, 398 permutations = symmetry.atomic_permutations 403 permutations) 554 permutations): argument 844 assert permutations.ndim == 2 [all …]
|
/dports/science/phonopy/phonopy-2.11.0/phonopy/harmonic/ |
H A D | force_constants.py | 102 permutations = symmetry.atomic_permutations 107 permutations, 223 permutations = primitive.atomic_permutations 245 permutations, argument 249 permutations, atom_list_done) 262 permutations, 398 permutations = symmetry.atomic_permutations 403 permutations) 554 permutations): argument 844 assert permutations.ndim == 2 [all …]
|
/dports/math/polymake/polymake-4.5/apps/common/rules/ |
H A D | permutations | 18 # Base class for permutations of `big' objects 32 function permuted(Array, *) : c++ (include => "polymake/permutations.h"); 40 function permuted_inv(Array, *) : c++ (include => "polymake/permutations.h"); 48 function permuted_elements(Array, *) : c++ (include => "polymake/permutations.h"); 50 function permuted_elements(Set, *) : c++ (include => "polymake/permutations.h"); 55 function permuted_elements_inv(Set, *) : c++ (include => "polymake/permutations.h"); 91 user_function find_permutation(*,*) : c++ (include => "polymake/permutations.h"); 145 user_function permutation_sign(*) : c++ (include => "polymake/permutations.h"); 155 user_function n_fixed_points(*) : c++ (include => "polymake/permutations.h"); 166 user_function are_permuted(*,*) : c++ (include => "polymake/permutations.h"); [all …]
|