| /dports/devel/ivykis/ivykis-0.42.4/src/ |
| H A D | iv_avl.c | 25 static int height(const struct iv_avl_node *an) in height()
30 static void recalc_height(struct iv_avl_node *an) in recalc_height()
192 static int balance(const struct iv_avl_node *an) in balance()
220 find_reference(struct iv_avl_tree *tree, const struct iv_avl_node *an) in find_reference()
233 const struct iv_avl_node *an, in replace_reference()
245 static void rebalance_path(struct iv_avl_tree *tree, struct iv_avl_node *an) in rebalance_path()
265 int iv_avl_tree_insert(struct iv_avl_tree *tree, struct iv_avl_node *an) in iv_avl_tree_insert()
307 iv_avl_tree_delete_leaf(struct iv_avl_tree *tree, struct iv_avl_node *an) in iv_avl_tree_delete_leaf()
384 void iv_avl_tree_delete(struct iv_avl_tree *tree, struct iv_avl_node *an) in iv_avl_tree_delete()
396 struct iv_avl_node *iv_avl_tree_next(struct iv_avl_node *an) in iv_avl_tree_next()
[all …]
|
| /dports/sysutils/syslog-ng/syslog-ng-3.35.1/lib/ivykis/src/ |
| H A D | iv_avl.c | 25 static int height(const struct iv_avl_node *an) in height()
30 static void recalc_height(struct iv_avl_node *an) in recalc_height()
192 static int balance(const struct iv_avl_node *an) in balance()
220 find_reference(struct iv_avl_tree *tree, const struct iv_avl_node *an) in find_reference()
233 const struct iv_avl_node *an, in replace_reference()
245 static void rebalance_path(struct iv_avl_tree *tree, struct iv_avl_node *an) in rebalance_path()
265 int iv_avl_tree_insert(struct iv_avl_tree *tree, struct iv_avl_node *an) in iv_avl_tree_insert()
307 iv_avl_tree_delete_leaf(struct iv_avl_tree *tree, struct iv_avl_node *an) in iv_avl_tree_delete_leaf()
384 void iv_avl_tree_delete(struct iv_avl_tree *tree, struct iv_avl_node *an) in iv_avl_tree_delete()
396 struct iv_avl_node *iv_avl_tree_next(struct iv_avl_node *an) in iv_avl_tree_next()
[all …]
|
| /dports/graphics/tinyows/tinyows-1.1.0/src/struct/ |
| H A D | array.c | 55 array_node *an = NULL; in array_free() local
82 array_node *an; in array_add() local
107 array_node *an; in array_is_key() local
127 array_node *an; in array_is_value() local
149 array_node *an; in array_get() local
172 array_node *an; in array_get_key() local
197 array_node *an; in array_flush() local
|
| H A D | alist.c | 58 alist_node *an = NULL; in alist_free() local
85 alist_node *an; in alist_add() local
118 alist_node *an; in alist_is_key() local
140 alist_node *an; in alist_get() local
165 alist_node *an; in alist_flush() local
|
| /dports/math/py-libpoly/libpoly-0.1.11/src/polyxx/ |
| H A D | algebraic_number.cpp | 7 AlgebraicNumber::AlgebraicNumber(const lp_algebraic_number_t* an) { in AlgebraicNumber()
13 AlgebraicNumber::AlgebraicNumber(const AlgebraicNumber& an) { in AlgebraicNumber()
59 int sgn(const AlgebraicNumber& an) { in sgn()
214 double to_double(const AlgebraicNumber& an) { in to_double()
250 void refine(AlgebraicNumber& an) { in refine()
253 void refine_const(const AlgebraicNumber& an) { in refine_const()
290 bool is_rational(const AlgebraicNumber& an) { in is_rational()
293 bool is_integer(const AlgebraicNumber& an) { in is_integer()
297 bool is_one(const AlgebraicNumber& an) { in is_one()
301 Integer ceil(const AlgebraicNumber& an) { in ceil()
[all …]
|
| /dports/math/libpoly/libpoly-0.1.11/src/polyxx/ |
| H A D | algebraic_number.cpp | 7 AlgebraicNumber::AlgebraicNumber(const lp_algebraic_number_t* an) { in AlgebraicNumber()
13 AlgebraicNumber::AlgebraicNumber(const AlgebraicNumber& an) { in AlgebraicNumber()
59 int sgn(const AlgebraicNumber& an) { in sgn()
214 double to_double(const AlgebraicNumber& an) { in to_double()
250 void refine(AlgebraicNumber& an) { in refine()
253 void refine_const(const AlgebraicNumber& an) { in refine_const()
290 bool is_rational(const AlgebraicNumber& an) { in is_rational()
293 bool is_integer(const AlgebraicNumber& an) { in is_integer()
297 bool is_one(const AlgebraicNumber& an) { in is_one()
301 Integer ceil(const AlgebraicNumber& an) { in ceil()
[all …]
|
| /dports/science/tfel-edf/tfel-3.2.1/mfront/src/ |
| H A D | Hosford1972StressCriterion.cxx | 38 const auto an = StressCriterion::getVariableId("a", id, r); in initialize() local
53 const auto an = StressCriterion::getVariableId("a", id, r); in endTreatment() local
67 const auto an = StressCriterion::getVariableId( in computeElasticPrediction() local
78 const auto an = StressCriterion::getVariableId( in computeCriterion() local
90 const auto an = StressCriterion::getVariableId("a", id, r); in computeNormal() local
129 const auto an = StressCriterion::getVariableId("a", id, r); in computeNormalDerivative() local
|
| /dports/science/tfel/tfel-3.4.0/mfront/src/ |
| H A D | Hosford1972StressCriterion.cxx | 47 const auto an = StressCriterion::getVariableId("a", id, r); in initialize() local
66 const auto an = StressCriterion::getVariableId("a", id, r); in endTreatment() local
80 const auto an = StressCriterion::getVariableId( in computeElasticPrediction() local
91 const auto an = StressCriterion::getVariableId( in computeCriterion() local
103 const auto an = StressCriterion::getVariableId("a", id, r); in computeNormal() local
146 const auto an = StressCriterion::getVariableId("a", id, r); in computeNormalDerivative() local
|
| /dports/news/trn4/trn-4.0-test77/ |
| H A D | cache.h | 89 #define article_find(an) ((an) <= lastart && article_hasdata(an)? \ argument
92 #define article_hasdata(an) existing_listnum(article_list,(long)(an),0) argument
93 #define article_first(an) existing_listnum(article_list,(long)(an),1) argument
94 #define article_next(an) existing_listnum(article_list,(long)(an)+1,1) argument
95 #define article_last(an) existing_listnum(article_list,(long)(an),-1) argument
96 #define article_prev(an) existing_listnum(article_list,(long)(an)-1,-1) argument
99 #define article_exists(an) (article_ptr(an)->flags & AF_EXISTS) argument
100 #define article_unread(an) (article_ptr(an)->flags & AF_UNREAD) argument
102 #define was_read(an) (!article_hasdata(an) || !article_unread(an)) argument
103 #define is_available(an) ((an) <= lastart && article_hasdata(an) \ argument
[all …]
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/jdk/internal/org/objectweb/asm/tree/ |
| H A D | FieldNode.java | 223 AnnotationNode an = new AnnotationNode(desc); in visitAnnotation() local
241 TypeAnnotationNode an = new TypeAnnotationNode(typeRef, typePath, desc); in visitTypeAnnotation() local
309 AnnotationNode an = visibleAnnotations.get(i); in accept() local
314 AnnotationNode an = invisibleAnnotations.get(i); in accept() local
319 TypeAnnotationNode an = visibleTypeAnnotations.get(i); in accept() local
326 TypeAnnotationNode an = invisibleTypeAnnotations.get(i); in accept() local
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/jdk/internal/org/objectweb/asm/tree/ |
| H A D | FieldNode.java | 223 AnnotationNode an = new AnnotationNode(desc); in visitAnnotation() local
241 TypeAnnotationNode an = new TypeAnnotationNode(typeRef, typePath, desc); in visitTypeAnnotation() local
309 AnnotationNode an = visibleAnnotations.get(i); in accept() local
314 AnnotationNode an = invisibleAnnotations.get(i); in accept() local
319 TypeAnnotationNode an = visibleTypeAnnotations.get(i); in accept() local
326 TypeAnnotationNode an = invisibleTypeAnnotations.get(i); in accept() local
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/jdk/internal/org/objectweb/asm/tree/ |
| H A D | FieldNode.java | 223 AnnotationNode an = new AnnotationNode(desc); in visitAnnotation() local
241 TypeAnnotationNode an = new TypeAnnotationNode(typeRef, typePath, desc); in visitTypeAnnotation() local
309 AnnotationNode an = visibleAnnotations.get(i); in accept() local
314 AnnotationNode an = invisibleAnnotations.get(i); in accept() local
319 TypeAnnotationNode an = visibleTypeAnnotations.get(i); in accept() local
326 TypeAnnotationNode an = invisibleTypeAnnotations.get(i); in accept() local
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/jdk/internal/org/objectweb/asm/tree/ |
| H A D | FieldNode.java | 223 AnnotationNode an = new AnnotationNode(desc); in visitAnnotation() local
241 TypeAnnotationNode an = new TypeAnnotationNode(typeRef, typePath, desc); in visitTypeAnnotation() local
309 AnnotationNode an = visibleAnnotations.get(i); in accept() local
314 AnnotationNode an = invisibleAnnotations.get(i); in accept() local
319 TypeAnnotationNode an = visibleTypeAnnotations.get(i); in accept() local
326 TypeAnnotationNode an = invisibleTypeAnnotations.get(i); in accept() local
|
| /dports/databases/evolution-data-server/evolution-data-server-3.42.1/src/services/evolution-alarm-notify/ |
| H A D | e-alarm-notify.c | 135 e_alarm_notify_audio (EAlarmNotify *an, in e_alarm_notify_audio()
677 EAlarmNotify *an = user_data; in e_alarm_notify_dismiss_thread() local
711 EAlarmNotify *an = user_data; in e_alarm_notify_triggered_cb() local
740 EAlarmNotify *an = user_data; in e_alarm_notify_status_icon_activated_cb() local
794 EAlarmNotify *an = user_data; in e_alarm_notify_status_icon_popup_menu_cb() local
831 EAlarmNotify *an = user_data; in e_alarm_notify_status_icon_blink_cb() local
859 EAlarmNotify *an = user_data; in e_alarm_notify_reminders_changed_cb() local
971 EAlarmNotify *an = user_data; in e_alarm_notify_window_geometry_save_cb() local
1003 EAlarmNotify *an = user_data; in e_alarm_notify_paned_position_changed_cb() local
1029 EAlarmNotify *an = user_data; in e_alarm_notify_window_configure_event_cb() local
[all …]
|
| /dports/devel/ivykis/ivykis-0.42.4/src/include/ |
| H A D | iv_avl.h | 67 struct iv_avl_node *an; in iv_avl_tree_min() local
83 struct iv_avl_node *an; in iv_avl_tree_max() local
95 #define iv_avl_tree_for_each(an, tree) \ argument
98 static inline struct iv_avl_node *iv_avl_tree_next_safe(struct iv_avl_node *an) in iv_avl_tree_next_safe()
103 #define iv_avl_tree_for_each_safe(an, an2, tree) \ argument
|
| /dports/sysutils/syslog-ng/syslog-ng-3.35.1/lib/ivykis/src/include/ |
| H A D | iv_avl.h | 67 struct iv_avl_node *an; in iv_avl_tree_min() local
83 struct iv_avl_node *an; in iv_avl_tree_max() local
95 #define iv_avl_tree_for_each(an, tree) \ argument
98 static inline struct iv_avl_node *iv_avl_tree_next_safe(struct iv_avl_node *an) in iv_avl_tree_next_safe()
103 #define iv_avl_tree_for_each_safe(an, an2, tree) \ argument
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/buildtools/third_party/libc++/trunk/test/std/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
|
| /dports/devel/libc++/libcxx-10.0.1.src/test/std/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
|