| /dports/net/ns3/ns-allinone-3.35/ns-3.35/src/mobility/examples/ |
| H A D | default.ns_movements | 1 $node_(0) set X_ 150.0
2 $node_(0) set Y_ 93.98597018956875
3 $ns_ at 0.0 "$node_(0) setdest 150.0 110.0 50.40378694202284"
6 $ns_ at 0.6096214007438903 "$node_(0) setdest 170.0 110.0 50.39215470830349"
8 $ns_ at 1.1057303713701003 "$node_(0) setdest 170.0 90.0 49.99999999937131"
11 $ns_ at 1.7057303713695546 "$node_(0) setdest 210.0 90.0 50.00000000002494"
14 $ns_ at 3.3057303713680994 "$node_(0) setdest 210.0 10.0 50.13316828893697"
15 $ns_ at 3.511466340034076 "$node_(0) setdest 190.0 10.0 50.13316828895926"
20 $ns_ at 4.603339709373813 "$node_(0) setdest 190.0 50.0 50.00000000000561"
328 $node_(1) set X_ 195.41843780583298
[all …]
|
| /dports/cad/sumo/sumo-1.2.0/docs/examples/tools/traceExporter/ |
| H A D | mobilityfile.tcl | 1 $node_(0) set X_ 516.45
2 $node_(0) set Y_ 498.35
3 $node_(0) set Z_ 0
4 $ns_ at 10.0 "$node_(0) setdest 516.45 498.35 11.11"
5 $ns_ at 11.0 "$node_(0) setdest 527.56 498.35 11.11"
15 $node_(1) set X_ 498.35
16 $node_(1) set Y_ 483.55
17 $node_(1) set Z_ 0
38 $node_(2) set X_ 516.45
39 $node_(2) set Y_ 498.35
[all …]
|
| /dports/net/ns3/ns-allinone-3.35/ns-3.35/src/wave/examples/ |
| H A D | low99-ct-unterstrass-1day.filt.7.adj.mob | 81 $node_(0) set Z_ 0.0
88 $node_(1) set Z_ 0.0
95 $node_(2) set Z_ 0.0
102 $node_(3) set Z_ 0.0
109 $node_(4) set Z_ 0.0
116 $node_(5) set Z_ 0.0
123 $node_(6) set Z_ 0.0
130 $node_(7) set Z_ 0.0
137 $node_(8) set Z_ 0.0
144 $node_(9) set Z_ 0.0
[all …]
|
| /dports/devel/libxs/libxs-1.2.0/src/ |
| H A D | prefix_filter.cpp | 98 if (c < node_->min || c >= node_->min + node_->count) { in pfx_add()
111 (node_->min < c ? c - node_->min : node_->min - c) + 1; in pfx_add()
117 node_->min = std::min (node_->min, c); in pfx_add()
124 node_->count = c - node_->min + 1; in pfx_add()
141 memmove (node_->next.table + node_->min - c, node_->next.table, in pfx_add()
161 if (!node_->next.table [c - node_->min]) { in pfx_add()
162 node_->next.table [c - node_->min] = in pfx_add()
283 (new_min > node_->min || new_max < node_->min + node_->count - 1)) { in pfx_rm_all()
331 if (!node_->count || c < node_->min || c >= node_->min + node_->count) in pfx_rm()
335 node_->next.table [c - node_->min]; in pfx_rm()
[all …]
|
| /dports/math/form/form-4.2.1/doc/manual/ |
| H A D | diagrams.tex | 38 + node_(0,-Q1)*node_(1,-Q2)*node_(2,Q1,-p1,-p2)*node_(3,Q2,p1,-p3)*
40 + node_(0,-Q1)*node_(1,-Q2)*node_(2,Q1,-p1,-p2)*node_(3,p1,-p3,-p4)*
64 + node_(0,-Q1)*node_(1,-Q2)*node_(2,Q1,-p1,-p2)*node_(3,Q2,p1,-p3)*
66 + node_(0,-Q1)*node_(1,-Q2)*node_(2,Q1,-p1,-p2)*node_(3,Q2,p1,-p3)*
68 + node_(0,-Q1)*node_(1,-Q2)*node_(2,Q1,-p1,-p2)*node_(3,Q2,-p3,-p4)*
70 + node_(0,-Q1)*node_(1,-Q2)*node_(2,Q1,-p1,-p2)*node_(3,p1,-p3,-p4)*
72 + node_(0,-Q1)*node_(1,-Q2)*node_(2,Q1,-p1,-p2)*node_(3,p1,-p3,-p4)*
76 + node_(0,-Q1)*node_(1,-Q2)*node_(2,-p1,-p2,-p3)*node_(3,Q2,p1,-p4)*
78 + node_(0,-Q1)*node_(1,-Q2)*node_(2,-p1,-p2,-p3)*node_(3,p1,p2,-p4)*
100 + node_(0,-Q1)*node_(1,-Q2)*node_(2,Q1,-p1,-p2)*node_(3,Q2,p1,-p3)*
[all …]
|
| /dports/devel/hpx/hpx-1.2.1/src/lcos/ |
| H A D | barrier.cpp | 38 if ((*node_)->num_ >= (*node_)->cut_off_ || (*node_)->rank_ == 0) in barrier()
48 if ((*node_)->num_ >= (*node_)->cut_off_ || (*node_)->rank_ == 0) in barrier()
57 if ((*node_)->num_ >= (*node_)->cut_off_ || (*node_)->rank_ == 0) in barrier()
66 : node_(std::move(other.node_)) in barrier()
74 node_ = std::move(other.node_); in operator =()
97 if (node_) in release()
111 if ((*node_)->num_ >= (*node_)->cut_off_ || (*node_)->rank_ == 0) in release()
114 (*node_)->base_name_, (*node_)->rank_); in release()
135 if (node_) in detach()
141 if ((*node_)->num_ >= (*node_)->cut_off_ || (*node_)->rank_ == 0) in detach()
[all …]
|
| /dports/lang/python310/Python-3.10.1/Python/ |
| H A D | ast_opt.c | 470 switch (node_->kind) { in astfold_mod()
497 switch (node_->kind) { in astfold_expr()
504 CALL(fold_binop, expr_ty, node_); in astfold_expr()
508 CALL(fold_unaryop, expr_ty, node_); in astfold_expr()
575 CALL(fold_subscr, expr_ty, node_); in astfold_expr()
590 CALL(fold_tuple, expr_ty, node_); in astfold_expr()
593 if (node_->v.Name.ctx == Load && in astfold_expr()
626 CALL(fold_iter, expr_ty, node_->iter); in astfold_comprehension()
660 switch (node_->kind) { in astfold_stmt()
776 switch (node_->kind) { in astfold_excepthandler()
[all …]
|
| /dports/databases/py-sqlite3/Python-3.8.12/Python/ |
| H A D | ast_opt.c | 455 switch (node_->kind) { in astfold_mod()
477 switch (node_->kind) { in astfold_expr()
484 CALL(fold_binop, expr_ty, node_); in astfold_expr()
488 CALL(fold_unaryop, expr_ty, node_); in astfold_expr()
535 CALL(fold_compare, expr_ty, node_); in astfold_expr()
555 CALL(fold_subscr, expr_ty, node_); in astfold_expr()
565 CALL(fold_tuple, expr_ty, node_); in astfold_expr()
581 switch (node_->kind) { in astfold_slice()
613 CALL(fold_iter, expr_ty, node_->iter); in astfold_comprehension()
640 switch (node_->kind) { in astfold_stmt()
[all …]
|
| /dports/databases/py-gdbm/Python-3.8.12/Python/ |
| H A D | ast_opt.c | 455 switch (node_->kind) { in astfold_mod()
477 switch (node_->kind) { in astfold_expr()
484 CALL(fold_binop, expr_ty, node_); in astfold_expr()
488 CALL(fold_unaryop, expr_ty, node_); in astfold_expr()
535 CALL(fold_compare, expr_ty, node_); in astfold_expr()
555 CALL(fold_subscr, expr_ty, node_); in astfold_expr()
565 CALL(fold_tuple, expr_ty, node_); in astfold_expr()
581 switch (node_->kind) { in astfold_slice()
613 CALL(fold_iter, expr_ty, node_->iter); in astfold_comprehension()
640 switch (node_->kind) { in astfold_stmt()
[all …]
|
| /dports/lang/python-tools/Python-3.8.12/Python/ |
| H A D | ast_opt.c | 455 switch (node_->kind) { in astfold_mod()
477 switch (node_->kind) { in astfold_expr()
484 CALL(fold_binop, expr_ty, node_); in astfold_expr()
488 CALL(fold_unaryop, expr_ty, node_); in astfold_expr()
535 CALL(fold_compare, expr_ty, node_); in astfold_expr()
555 CALL(fold_subscr, expr_ty, node_); in astfold_expr()
565 CALL(fold_tuple, expr_ty, node_); in astfold_expr()
581 switch (node_->kind) { in astfold_slice()
613 CALL(fold_iter, expr_ty, node_->iter); in astfold_comprehension()
640 switch (node_->kind) { in astfold_stmt()
[all …]
|
| /dports/lang/python38/Python-3.8.12/Python/ |
| H A D | ast_opt.c | 455 switch (node_->kind) { in astfold_mod()
477 switch (node_->kind) { in astfold_expr()
484 CALL(fold_binop, expr_ty, node_); in astfold_expr()
488 CALL(fold_unaryop, expr_ty, node_); in astfold_expr()
535 CALL(fold_compare, expr_ty, node_); in astfold_expr()
555 CALL(fold_subscr, expr_ty, node_); in astfold_expr()
565 CALL(fold_tuple, expr_ty, node_); in astfold_expr()
581 switch (node_->kind) { in astfold_slice()
613 CALL(fold_iter, expr_ty, node_->iter); in astfold_comprehension()
640 switch (node_->kind) { in astfold_stmt()
[all …]
|
| /dports/x11-toolkits/py-tkinter/Python-3.8.12/Python/ |
| H A D | ast_opt.c | 455 switch (node_->kind) { in astfold_mod()
477 switch (node_->kind) { in astfold_expr()
484 CALL(fold_binop, expr_ty, node_); in astfold_expr()
488 CALL(fold_unaryop, expr_ty, node_); in astfold_expr()
535 CALL(fold_compare, expr_ty, node_); in astfold_expr()
555 CALL(fold_subscr, expr_ty, node_); in astfold_expr()
565 CALL(fold_tuple, expr_ty, node_); in astfold_expr()
581 switch (node_->kind) { in astfold_slice()
613 CALL(fold_iter, expr_ty, node_->iter); in astfold_comprehension()
640 switch (node_->kind) { in astfold_stmt()
[all …]
|
| /dports/lang/python37/Python-3.7.12/Python/ |
| H A D | ast_opt.c | 497 switch (node_->kind) { in astfold_mod()
519 switch (node_->kind) { in astfold_expr()
526 CALL(fold_binop, expr_ty, node_); in astfold_expr()
530 CALL(fold_unaryop, expr_ty, node_); in astfold_expr()
577 CALL(fold_compare, expr_ty, node_); in astfold_expr()
597 CALL(fold_subscr, expr_ty, node_); in astfold_expr()
607 CALL(fold_tuple, expr_ty, node_); in astfold_expr()
623 switch (node_->kind) { in astfold_slice()
655 CALL(fold_iter, expr_ty, node_->iter); in astfold_comprehension()
681 switch (node_->kind) { in astfold_stmt()
[all …]
|
| /dports/lang/python39/Python-3.9.9/Python/ |
| H A D | ast_opt.c | 451 switch (node_->kind) { in astfold_mod()
470 switch (node_->kind) { in astfold_expr()
477 CALL(fold_binop, expr_ty, node_); in astfold_expr()
481 CALL(fold_unaryop, expr_ty, node_); in astfold_expr()
528 CALL(fold_compare, expr_ty, node_); in astfold_expr()
548 CALL(fold_subscr, expr_ty, node_); in astfold_expr()
563 CALL(fold_tuple, expr_ty, node_); in astfold_expr()
566 if (node_->v.Name.ctx == Load && in astfold_expr()
591 CALL(fold_iter, expr_ty, node_->iter); in astfold_comprehension()
620 switch (node_->kind) { in astfold_stmt()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/components/performance_manager/graph/ |
| H A D | properties_unittest.cc | 80 node_.AddObserver(&observer_); in SetUp()
85 DummyNode node_; member in performance_manager::__anon8e539b560111::GraphPropertiesTest
91 EXPECT_EQ(false, node_.observed_always()); in TEST_F()
93 EXPECT_CALL(observer_, NotifyAlwaysConst(&node_)); in TEST_F()
94 node_.SetObservedAlways(false); in TEST_F()
96 EXPECT_EQ(false, node_.observed_always()); in TEST_F()
98 EXPECT_CALL(observer_, NotifyAlwaysConst(&node_)); in TEST_F()
99 node_.SetObservedAlways(true); in TEST_F()
101 EXPECT_EQ(true, node_.observed_always()); in TEST_F()
104 node_.SetObservedAlways(true); in TEST_F()
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/components/performance_manager/graph/ |
| H A D | properties_unittest.cc | 80 node_.AddObserver(&observer_); in SetUp()
85 DummyNode node_; member in performance_manager::__anond1f484510111::GraphPropertiesTest
91 EXPECT_EQ(false, node_.observed_always()); in TEST_F()
93 EXPECT_CALL(observer_, NotifyAlwaysConst(&node_)); in TEST_F()
94 node_.SetObservedAlways(false); in TEST_F()
96 EXPECT_EQ(false, node_.observed_always()); in TEST_F()
98 EXPECT_CALL(observer_, NotifyAlwaysConst(&node_)); in TEST_F()
99 node_.SetObservedAlways(true); in TEST_F()
101 EXPECT_EQ(true, node_.observed_always()); in TEST_F()
104 node_.SetObservedAlways(true); in TEST_F()
[all …]
|
| /dports/lang/python311/Python-3.11.0a3/Python/ |
| H A D | ast_opt.c | 699 switch (node_->kind) { in astfold_mod()
726 switch (node_->kind) { in astfold_expr()
733 CALL(fold_binop, expr_ty, node_); in astfold_expr()
737 CALL(fold_unaryop, expr_ty, node_); in astfold_expr()
804 CALL(fold_subscr, expr_ty, node_); in astfold_expr()
819 CALL(fold_tuple, expr_ty, node_); in astfold_expr()
822 if (node_->v.Name.ctx == Load && in astfold_expr()
855 CALL(fold_iter, expr_ty, node_->iter); in astfold_comprehension()
889 switch (node_->kind) { in astfold_stmt()
1005 switch (node_->kind) { in astfold_excepthandler()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/trilinos/packages/teuchos/core/src/ |
| H A D | Teuchos_RCPNode.hpp | 808 : node_ (node_ref.node_), strength_ (node_ref.strength_) in RCPNodeHandle()
815 : node_ (node_ref.node_), strength_ (node_ref.strength_) in RCPNodeHandle()
823 std::swap (node_ref.node_, node_); in swap()
836 node_ = 0; in operator =()
850 node_ = node_ref.node_; in operator =()
865 node_ = node_ref.node_; in operator =()
890 if (node_) { in create_weak()
897 if (node_) { in create_strong()
914 if (node_) { in is_valid_ptr()
922 return node_ == node2.node_; in same_node()
[all …]
|
| /dports/devel/glibmm/glibmm-2.64.2/glib/glibmm/ |
| H A D | containers.h | 70 GList* node_; variable
85 if (!node_)
88 node_ = (GList*)g_list_next(node_);
101 if (!node_)
104 node_ = (GList*)g_list_previous(node_);
140 SList_Iterator(const Self& src) : node_(src.node_) {} in SList_Iterator()
147 node_ = g_slist_next(node_);
183 GList* node_; variable
196 if (node_ && node_->data)
222 node_ = (GList*)g_list_next(node_);
[all …]
|
| /dports/math/symengine/symengine-0.8.1/symengine/utilities/teuchos/ |
| H A D | Teuchos_RCPNode.hpp | 751 : node_(node_ref.node_), strength_(node_ref.strength_) in RCPNodeHandle()
758 std::swap(node_ref.node_, node_); in swap()
770 node_ = node_ref.node_; in operator =()
810 if (node_) in is_valid_ptr()
817 return node_ == node2.node_; in same_node()
822 if (node_) in strong_count()
829 if (node_) in weak_count()
836 if (node_) in total_count()
837 return node_->strong_count() + node_->weak_count(); in total_count()
843 if (node_) in count()
[all …]
|
| /dports/textproc/scim/scim-1.4.9/src/ |
| H A D | scim_connection.cpp | 60 : node_(0) in Connection()
65 : node_(node) in Connection()
70 : node_(src.node_) in Connection()
81 if (src.node_ == node_) in operator =()
84 node_ = src.node_; in operator =()
85 src.node_.reset (); in operator =()
92 if (!node_.null ()) in block()
93 node_->block(); in block()
99 if (!node_.null ()) in unblock()
100 node_->unblock(); in unblock()
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/editing/iterators/ |
| H A D | simplified_backwards_text_iterator.cc | 71 node_(nullptr), in SimplifiedBackwardsTextIteratorAlgorithm()
117 node_ = end_node; in Init()
146 while (node_ && !have_passed_start_node_) { in Advance()
169 node_ = Strategy::LastChild(*node_); in Advance()
175 Strategy::Parent(*node_) && in Advance()
176 (!Strategy::LastChild(*node_) || in Advance()
187 while (!Strategy::PreviousSibling(*node_)) { in Advance()
204 node_ = nullptr; in Advance()
209 offset_ = node_ ? MaxOffsetIncludingCollapsedSpaces(node_) : 0; in Advance()
309 text_state_.EmitChar16AsNode(',', *node_); in HandleReplacedElement()
[all …]
|
| H A D | text_iterator.cc | 231 if (!node_) in TextIteratorAlgorithm()
294 if (node_) in Advance()
295 DCHECK(!node_->GetDocument().NeedsLayoutTreeUpdate()) << node_; in Advance()
302 while (node_ && (node_ != past_end_node_ || shadow_depth_)) { in Advance()
313 node_ = nullptr; in Advance()
328 if (!locked && (IsA<ShadowRoot>(node_) || HasDisplayContents(*node_))) { in Advance()
423 node_ = parent_node; in Advance()
472 node_ = next; in Advance()
473 if (node_) in Advance()
501 if (node_ != end_container_) in HandleTextNode()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/editing/iterators/ |
| H A D | simplified_backwards_text_iterator.cc | 66 node_(nullptr), in SimplifiedBackwardsTextIteratorAlgorithm()
112 node_ = end_node; in Init()
141 while (node_ && !have_passed_start_node_) { in Advance()
164 node_ = Strategy::LastChild(*node_); in Advance()
170 Strategy::Parent(*node_) && in Advance()
171 (!Strategy::LastChild(*node_) || in Advance()
182 while (!Strategy::PreviousSibling(*node_)) { in Advance()
199 node_ = nullptr; in Advance()
204 offset_ = node_ ? MaxOffsetIncludingCollapsedSpaces(node_) : 0; in Advance()
304 text_state_.EmitChar16AsNode(',', *node_); in HandleReplacedElement()
[all …]
|
| H A D | text_iterator.cc | 231 if (!node_) in TextIteratorAlgorithm()
294 if (node_) in Advance()
295 DCHECK(!node_->GetDocument().NeedsLayoutTreeUpdate()) << node_; in Advance()
302 while (node_ && (node_ != past_end_node_ || shadow_depth_)) { in Advance()
313 node_ = nullptr; in Advance()
328 if (!locked && (IsA<ShadowRoot>(node_) || HasDisplayContents(*node_))) { in Advance()
423 node_ = parent_node; in Advance()
472 node_ = next; in Advance()
473 if (node_) in Advance()
501 if (node_ != end_container_) in HandleTextNode()
[all …]
|