| /dports/math/vowpal_wabbit/vowpal_wabbit-7.10/vowpalwabbit/ |
| H A D | v_hashmap.h | 53 void init(size_t min_size, V def, bool (*eq)(K&,K&)) { in init()
67 void init(size_t min_size, bool (*eq)(K&,K&)) { in init()
81 …v_hashmap(size_t min_size, V def, bool (*eq)(K&,K&)) { init(min_size, def,… in v_hashmap()
85 …void set_equivalent(bool (*eq)(K&,K&)) { equivalent_no_data = eq; eq_data = NULL; equivalent = NUL… in set_equivalent()
99 hash_elem* e = (hash_elem*)prev; in iterator_next() local
111 hash_elem* e = dat.begin; in iterator() local
121 hash_elem* e = (hash_elem*)el; in iterator_get_value() local
125 void iter(void (*func)(K,V)) { in iter()
127 for (hash_elem* e=dat.begin; e!=dat.end_array; e++) { in iter() local
149 for (hash_elem* e=dat.begin; e!=dat.end_array; e++) in double_size() local
[all …]
|
| /dports/net/ipsumdump/ipsumdump-1.86/libclick-2.1/include/click/ |
| H A D | hashmap.cc | 60 HashMap<K, V>::copy_from(const HashMap<K, V> &o) in copy_from()
80 HashMap<K, V>::HashMap(const HashMap<K, V> &o) in HashMap()
91 HashMap<K, V>::operator=(const HashMap<K, V> &o) in operator =()
109 for (Elt *e = _buckets[i]; e; ) { in ~HashMap() local
248 Elt *e = _buckets[b]; in erase() local
309 HashMap<K, V>::swap(HashMap<K, V> &o) in swap()
427 HashMap<K, void *>::copy_from(const HashMap<K, void *> &o) in copy_from()
445 HashMap<K, void *>::HashMap(const HashMap<K, void *> &o) in HashMap()
456 HashMap<K, void *>::operator=(const HashMap<K, void *> &o) in operator =()
612 Elt *e = _buckets[b]; in erase() local
[all …]
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/ |
| H A D | LinkedHashMap.java | 194 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
234 private void transferLinks(LinkedHashMap.Entry<K,V> src, in transferLinks()
255 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
262 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
276 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
283 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
305 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
439 Node<K,V> e; in get() local
451 Node<K,V> e; in getOrDefault() local
654 Map.Entry<?,?> e = (Map.Entry<?,?>) o; in remove() local
[all …]
|
| H A D | TreeMap.java | 1204 Entry<K,V> e = next; in nextEntry() local
1215 Entry<K,V> e = next; in prevEntry() local
1306 static <K,V> Map.Entry<K,V> exportEntry(TreeMap.Entry<K,V> e) { in exportEntry()
1314 static <K,V> K keyOrNull(TreeMap.Entry<K,V> e) { in keyOrNull()
1322 static <K> K key(Entry<K,?> e) { in key()
1422 TreeMap.Entry<K,V> e = in absLowest() local
1430 TreeMap.Entry<K,V> e = in absHighest() local
2755 TreeMap.Entry<K,V> e; in tryAdvance() local
2833 TreeMap.Entry<K,V> e; in tryAdvance() local
2906 TreeMap.Entry<K,V> e; in tryAdvance() local
[all …]
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/ |
| H A D | LinkedHashMap.java | 194 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
234 private void transferLinks(LinkedHashMap.Entry<K,V> src, in transferLinks()
255 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
262 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
276 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
283 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
305 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
439 Node<K,V> e; in get() local
451 Node<K,V> e; in getOrDefault() local
654 Map.Entry<?,?> e = (Map.Entry<?,?>) o; in remove() local
[all …]
|
| H A D | TreeMap.java | 1204 Entry<K,V> e = next; in nextEntry() local
1215 Entry<K,V> e = next; in prevEntry() local
1306 static <K,V> Map.Entry<K,V> exportEntry(TreeMap.Entry<K,V> e) { in exportEntry()
1314 static <K,V> K keyOrNull(TreeMap.Entry<K,V> e) { in keyOrNull()
1322 static <K> K key(Entry<K,?> e) { in key()
1422 TreeMap.Entry<K,V> e = in absLowest() local
1430 TreeMap.Entry<K,V> e = in absHighest() local
2755 TreeMap.Entry<K,V> e; in tryAdvance() local
2833 TreeMap.Entry<K,V> e; in tryAdvance() local
2906 TreeMap.Entry<K,V> e; in tryAdvance() local
[all …]
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/ |
| H A D | LinkedHashMap.java | 194 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
234 private void transferLinks(LinkedHashMap.Entry<K,V> src, in transferLinks()
255 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
262 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
276 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
283 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
305 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
439 Node<K,V> e; in get() local
451 Node<K,V> e; in getOrDefault() local
654 Map.Entry<?,?> e = (Map.Entry<?,?>) o; in remove() local
[all …]
|
| H A D | TreeMap.java | 1207 Entry<K,V> e = next; in nextEntry() local
1218 Entry<K,V> e = next; in prevEntry() local
1309 static <K,V> Map.Entry<K,V> exportEntry(TreeMap.Entry<K,V> e) { in exportEntry()
1317 static <K,V> K keyOrNull(TreeMap.Entry<K,V> e) { in keyOrNull()
1325 static <K> K key(Entry<K,?> e) { in key()
1425 TreeMap.Entry<K,V> e = in absLowest() local
1433 TreeMap.Entry<K,V> e = in absHighest() local
2762 TreeMap.Entry<K,V> e; in tryAdvance() local
2840 TreeMap.Entry<K,V> e; in tryAdvance() local
2913 TreeMap.Entry<K,V> e; in tryAdvance() local
[all …]
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.base/share/classes/java/util/ |
| H A D | LinkedHashMap.java | 194 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
234 private void transferLinks(LinkedHashMap.Entry<K,V> src, in transferLinks()
255 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
262 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
276 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
283 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
305 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
439 Node<K,V> e; in get() local
451 Node<K,V> e; in getOrDefault() local
654 Map.Entry<?,?> e = (Map.Entry<?,?>) o; in remove() local
[all …]
|
| H A D | TreeMap.java | 1204 Entry<K,V> e = next; in nextEntry() local
1215 Entry<K,V> e = next; in prevEntry() local
1306 static <K,V> Map.Entry<K,V> exportEntry(TreeMap.Entry<K,V> e) { in exportEntry()
1314 static <K,V> K keyOrNull(TreeMap.Entry<K,V> e) { in keyOrNull()
1322 static <K> K key(Entry<K,?> e) { in key()
1422 TreeMap.Entry<K,V> e = in absLowest() local
1430 TreeMap.Entry<K,V> e = in absHighest() local
2755 TreeMap.Entry<K,V> e; in tryAdvance() local
2833 TreeMap.Entry<K,V> e; in tryAdvance() local
2906 TreeMap.Entry<K,V> e; in tryAdvance() local
[all …]
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.base/share/classes/java/util/ |
| H A D | LinkedHashMap.java | 194 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
234 private void transferLinks(LinkedHashMap.Entry<K,V> src, in transferLinks()
255 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
262 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
276 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
283 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
305 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
439 Node<K,V> e; in get() local
451 Node<K,V> e; in getOrDefault() local
654 Map.Entry<?,?> e = (Map.Entry<?,?>) o; in remove() local
[all …]
|
| H A D | TreeMap.java | 1204 Entry<K,V> e = next; in nextEntry() local
1215 Entry<K,V> e = next; in prevEntry() local
1306 static <K,V> Map.Entry<K,V> exportEntry(TreeMap.Entry<K,V> e) { in exportEntry()
1314 static <K,V> K keyOrNull(TreeMap.Entry<K,V> e) { in keyOrNull()
1322 static <K> K key(Entry<K,?> e) { in key()
1422 TreeMap.Entry<K,V> e = in absLowest() local
1430 TreeMap.Entry<K,V> e = in absHighest() local
2755 TreeMap.Entry<K,V> e; in tryAdvance() local
2833 TreeMap.Entry<K,V> e; in tryAdvance() local
2906 TreeMap.Entry<K,V> e; in tryAdvance() local
[all …]
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/ |
| H A D | LinkedHashMap.java | 194 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
234 private void transferLinks(LinkedHashMap.Entry<K,V> src, in transferLinks()
255 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
262 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
276 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
283 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
305 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
439 Node<K,V> e; in get() local
451 Node<K,V> e; in getOrDefault() local
654 Map.Entry<?,?> e = (Map.Entry<?,?>) o; in remove() local
[all …]
|
| H A D | TreeMap.java | 1207 Entry<K,V> e = next; in nextEntry() local
1218 Entry<K,V> e = next; in prevEntry() local
1309 static <K,V> Map.Entry<K,V> exportEntry(TreeMap.Entry<K,V> e) { in exportEntry()
1317 static <K,V> K keyOrNull(TreeMap.Entry<K,V> e) { in keyOrNull()
1325 static <K> K key(Entry<K,?> e) { in key()
1425 TreeMap.Entry<K,V> e = in absLowest() local
1433 TreeMap.Entry<K,V> e = in absHighest() local
2762 TreeMap.Entry<K,V> e; in tryAdvance() local
2840 TreeMap.Entry<K,V> e; in tryAdvance() local
2913 TreeMap.Entry<K,V> e; in tryAdvance() local
[all …]
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.base/share/classes/java/util/ |
| H A D | LinkedHashMap.java | 194 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
235 private void transferLinks(LinkedHashMap.Entry<K,V> src, in transferLinks()
256 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
263 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
277 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
284 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
306 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
440 Node<K,V> e; in get() local
452 Node<K,V> e; in getOrDefault() local
693 Map.Entry<?,?> e = (Map.Entry<?,?>) o; in remove() local
[all …]
|
| H A D | TreeMap.java | 1476 Entry<K,V> e = next; in nextEntry() local
1487 Entry<K,V> e = next; in prevEntry() local
1578 static <K,V> Map.Entry<K,V> exportEntry(TreeMap.Entry<K,V> e) { in exportEntry()
1586 static <K,V> K keyOrNull(TreeMap.Entry<K,V> e) { in keyOrNull()
1594 static <K> K key(Entry<K,?> e) { in key()
1698 TreeMap.Entry<K,V> e = in absLowest() local
1706 TreeMap.Entry<K,V> e = in absHighest() local
3078 TreeMap.Entry<K,V> e; in tryAdvance() local
3156 TreeMap.Entry<K,V> e; in tryAdvance() local
3229 TreeMap.Entry<K,V> e; in tryAdvance() local
[all …]
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.base/share/classes/java/util/ |
| H A D | LinkedHashMap.java | 194 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
235 private void transferLinks(LinkedHashMap.Entry<K,V> src, in transferLinks()
256 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
263 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
277 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
284 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
306 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
440 Node<K,V> e; in get() local
452 Node<K,V> e; in getOrDefault() local
693 Map.Entry<?,?> e = (Map.Entry<?,?>) o; in remove() local
[all …]
|
| H A D | TreeMap.java | 1476 Entry<K,V> e = next; in nextEntry() local
1487 Entry<K,V> e = next; in prevEntry() local
1578 static <K,V> Map.Entry<K,V> exportEntry(TreeMap.Entry<K,V> e) { in exportEntry()
1586 static <K,V> K keyOrNull(TreeMap.Entry<K,V> e) { in keyOrNull()
1594 static <K> K key(Entry<K,?> e) { in key()
1698 TreeMap.Entry<K,V> e = in absLowest() local
1706 TreeMap.Entry<K,V> e = in absHighest() local
3042 TreeMap.Entry<K,V> e; in tryAdvance() local
3120 TreeMap.Entry<K,V> e; in tryAdvance() local
3193 TreeMap.Entry<K,V> e; in tryAdvance() local
[all …]
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.base/share/classes/java/util/ |
| H A D | LinkedHashMap.java | 194 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
235 private void transferLinks(LinkedHashMap.Entry<K,V> src, in transferLinks()
256 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
263 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
277 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
284 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
306 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
440 Node<K,V> e; in get() local
452 Node<K,V> e; in getOrDefault() local
693 Map.Entry<?,?> e = (Map.Entry<?,?>) o; in remove() local
[all …]
|
| H A D | TreeMap.java | 1204 Entry<K,V> e = next; in nextEntry() local
1215 Entry<K,V> e = next; in prevEntry() local
1306 static <K,V> Map.Entry<K,V> exportEntry(TreeMap.Entry<K,V> e) { in exportEntry()
1314 static <K,V> K keyOrNull(TreeMap.Entry<K,V> e) { in keyOrNull()
1322 static <K> K key(Entry<K,?> e) { in key()
1426 TreeMap.Entry<K,V> e = in absLowest() local
1434 TreeMap.Entry<K,V> e = in absHighest() local
2770 TreeMap.Entry<K,V> e; in tryAdvance() local
2848 TreeMap.Entry<K,V> e; in tryAdvance() local
2921 TreeMap.Entry<K,V> e; in tryAdvance() local
[all …]
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.base/share/classes/java/util/ |
| H A D | TreeMap.java | 1482 Entry<K,V> e = next; in nextEntry() local
1493 Entry<K,V> e = next; in prevEntry() local
1584 static <K,V> Map.Entry<K,V> exportEntry(TreeMap.Entry<K,V> e) { in exportEntry()
1592 static <K,V> K keyOrNull(TreeMap.Entry<K,V> e) { in keyOrNull()
1600 static <K> K key(Entry<K,?> e) { in key()
1704 TreeMap.Entry<K,V> e = in absLowest() local
1712 TreeMap.Entry<K,V> e = in absHighest() local
3080 TreeMap.Entry<K,V> e; in tryAdvance() local
3158 TreeMap.Entry<K,V> e; in tryAdvance() local
3231 TreeMap.Entry<K,V> e; in tryAdvance() local
[all …]
|
| H A D | LinkedHashMap.java | 194 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
223 private void linkNodeLast(LinkedHashMap.Entry<K,V> p) { in linkNodeLast()
235 private void transferLinks(LinkedHashMap.Entry<K,V> src, in transferLinks()
256 Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) { in newNode()
263 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { in replacementNode()
277 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { in replacementTreeNode()
284 void afterNodeRemoval(Node<K,V> e) { // unlink in afterNodeRemoval()
306 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess()
440 Node<K,V> e; in get() local
452 Node<K,V> e; in getOrDefault() local
[all …]
|
| /dports/audio/libsndfile/libsndfile-1.0.31/src/GSM610/ |
| H A D | long_term.c | 346 d = lp [-5], e = lp [-4], f = lp [-3], in Cut_Calculation_of_the_LTP_parameters() local
353 # define STEP(K, a, b, c, d, e, f, g, h) \ in Cut_Calculation_of_the_LTP_parameters() argument
366 # define STEP_A(K) STEP (K, a, b, c, d, e, f, g, h) in Cut_Calculation_of_the_LTP_parameters() argument
367 # define STEP_B(K) STEP (K, b, c, d, e, f, g, h, a) in Cut_Calculation_of_the_LTP_parameters() argument
368 # define STEP_C(K) STEP (K, c, d, e, f, g, h, a, b) in Cut_Calculation_of_the_LTP_parameters() argument
516 d = lp [-5], e = lp [-4], f = lp [-3], in Calculation_of_the_LTP_parameters() local
523 # define STEP(K, a, b, c, d, e, f, g, h) \ in Calculation_of_the_LTP_parameters() argument
731 d = lp [-5], e = lp [-4], f = lp [-3], in Fast_Calculation_of_the_LTP_parameters() local
738 # define STEP(K, a, b, c, d, e, f, g, h) \ in Fast_Calculation_of_the_LTP_parameters() argument
828 register int16_t * e /* long term res. signal [0..39] OUT */) in Long_term_analysis_filtering()
[all …]
|
| /dports/audio/sox/sox-14.4.2/libgsm/ |
| H A D | long_term.c | 362 d = lp[-5], e = lp[-4], f = lp[-3], in Cut_Calculation_of_the_LTP_parameters() local
369 # define STEP(K, a, b, c, d, e, f, g, h) \ in Cut_Calculation_of_the_LTP_parameters() argument
382 # define STEP_A(K) STEP(K, a, b, c, d, e, f, g, h) in Cut_Calculation_of_the_LTP_parameters() argument
383 # define STEP_B(K) STEP(K, b, c, d, e, f, g, h, a) in Cut_Calculation_of_the_LTP_parameters() argument
384 # define STEP_C(K) STEP(K, c, d, e, f, g, h, a, b) in Cut_Calculation_of_the_LTP_parameters() argument
528 d = lp[-5], e = lp[-4], f = lp[-3], in Calculation_of_the_LTP_parameters() local
535 # define STEP(K, a, b, c, d, e, f, g, h) \ in Calculation_of_the_LTP_parameters() argument
741 d = lp[-5], e = lp[-4], f = lp[-3], in Fast_Calculation_of_the_LTP_parameters() local
748 # define STEP(K, a, b, c, d, e, f, g, h) \ in Fast_Calculation_of_the_LTP_parameters() argument
838 register word * e /* long term res. signal [0..39] OUT */ in Long_term_analysis_filtering()
[all …]
|
| /dports/net/h323plus/h323plus-1_27_2/plugins/audio/GSM0610/src/ |
| H A D | long_term.c | 364 d = lp[-5], e = lp[-4], f = lp[-3], variable
371 # define STEP(K, a, b, c, d, e, f, g, h) \ argument
384 # define STEP_A(K) STEP(K, a, b, c, d, e, f, g, h) argument
385 # define STEP_B(K) STEP(K, b, c, d, e, f, g, h, a) argument
386 # define STEP_C(K) STEP(K, c, d, e, f, g, h, a, b) argument
387 # define STEP_D(K) STEP(K, d, e, f, g, h, a, b, c) argument
388 # define STEP_E(K) STEP(K, e, f, g, h, a, b, c, d) argument
530 d = lp[-5], e = lp[-4], f = lp[-3], variable
537 # define STEP(K, a, b, c, d, e, f, g, h) \ argument
744 d = lp[-5], e = lp[-4], f = lp[-3], variable
[all …]
|