| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/geometry/algorithms/detail/overlay/ |
| H A D | follow_linear_linear.hpp | 57 static inline bool is_entering(Turn const& turn, in is_entering() argument
60 if ( turn.method != method_touch && turn.method != method_touch_interior ) in is_entering()
79 if ( turn.method != method_equal && turn.method != method_collinear ) in is_staying_inside()
89 static inline bool is_leaving(Turn const& turn, in is_leaving() argument
98 if ( turn.method != method_touch in is_leaving()
99 && turn.method != method_touch_interior in is_leaving()
100 && turn.method != method_equal in is_leaving()
101 && turn.method != method_collinear ) in is_leaving()
131 if ( turn.method == method_none ) in is_isolated_point()
137 if ( turn.method == method_crosses ) in is_isolated_point()
[all …]
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/map_model/src/objects/ |
| H A D | zone.rs | 66 for turn in map.get_turns_for(l, req.constraints) { in pathfind()
67 if !self.borders.contains(&turn.id.parent) { in pathfind()
68 graph.add_edge(turn.id.src, turn.id.dst, turn.id); in pathfind()
79 |(_, _, turn)| { in pathfind()
80 driving_cost(map.get_l(turn.src), map.get_t(*turn), req.constraints, map) in pathfind()
112 for turn in map.get_turns_for(l.id, PathConstraints::Pedestrian) { in pathfind_walking()
113 if self.members.contains(&map.get_l(turn.id.dst).parent) { in pathfind_walking()
115 WalkingNode::SidewalkEndpoint(l.id, l.dst_i == turn.id.parent), in pathfind_walking()
117 turn.id.dst, in pathfind_walking()
118 map.get_l(turn.id.dst).dst_i == turn.id.parent, in pathfind_walking()
[all …]
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/features/guidance/ |
| H A D | roundabout-turn.feature | 28 | a,d | ab,cd,cd | depart,roundabout turn left exit-3,arrive |
29 | a,f | ab,ef,ef | depart,roundabout turn straight exit-2,arrive |
30 | a,h | ab,gh,gh | depart,roundabout turn right exit-1,arrive |
31 | d,f | cd,ef,ef | depart,roundabout turn left exit-3,arrive |
32 | d,h | cd,gh,gh | depart,roundabout turn straight exit-2,arrive |
33 | d,a | cd,ab,ab | depart,roundabout turn right exit-1,arrive |
34 | f,h | ef,gh,gh | depart,roundabout turn left exit-3,arrive |
35 | f,a | ef,ab,ab | depart,roundabout turn straight exit-2,arrive |
36 | f,d | ef,cd,cd | depart,roundabout turn right exit-1,arrive |
37 | h,a | gh,ab,ab | depart,roundabout turn left exit-3,arrive |
[all …]
|
| H A D | perception.feature | 32 | ed | turn | primary | yes |
37 …| e,a | depart,turn slight right,arrive | turn,road,road | true:333;true:0 false:150 false:1…
62 | ed | turn | primary | yes |
67 …| e,a | depart,turn right,arrive | turn,road,road | true:270;true:0 false:90 false:180;true:…
94 | de | turn | primary | no |
100 | e,a | depart,turn slight right,arrive | turn,road,road |
101 | e,g | depart,turn slight right,turn left,arrive | turn,road,left,left |
102 | f,g | depart,turn left,arrive | road,left,left |
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/libwebrtc/webrtc/modules/audio_processing/test/conversational_speech/ |
| H A D | multiend_call.cc | 38 for (const Turn& turn : timing_) { in FindSpeakerNames() local
39 speaker_names_.emplace(turn.speaker_name); in FindSpeakerNames()
46 for (const Turn& turn : timing_) { in CreateAudioTrackReaders() local
47 auto it = audiotrack_readers_.find(turn.audiotrack_file_name); in CreateAudioTrackReaders()
53 audiotracks_path_, turn.audiotrack_file_name); in CreateAudioTrackReaders()
73 turn.audiotrack_file_name, std::move(wavreader)); in CreateAudioTrackReaders()
112 const Turn& turn = timing_[turn_index]; in CheckTiming() local
113 auto it = audiotrack_readers_.find(turn.audiotrack_file_name); in CheckTiming()
119 turn.offset, it->second->SampleRate()); in CheckTiming()
143 turn.speaker_name, turn.audiotrack_file_name, in CheckTiming()
[all …]
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/libwebrtc/webrtc/modules/audio_processing/test/conversational_speech/ |
| H A D | multiend_call.cc | 38 for (const Turn& turn : timing_) { in FindSpeakerNames() local
39 speaker_names_.emplace(turn.speaker_name); in FindSpeakerNames()
46 for (const Turn& turn : timing_) { in CreateAudioTrackReaders() local
47 auto it = audiotrack_readers_.find(turn.audiotrack_file_name); in CreateAudioTrackReaders()
53 audiotracks_path_, turn.audiotrack_file_name); in CreateAudioTrackReaders()
73 turn.audiotrack_file_name, std::move(wavreader)); in CreateAudioTrackReaders()
112 const Turn& turn = timing_[turn_index]; in CheckTiming() local
113 auto it = audiotrack_readers_.find(turn.audiotrack_file_name); in CheckTiming()
119 turn.offset, it->second->SampleRate()); in CheckTiming()
143 turn.speaker_name, turn.audiotrack_file_name, in CheckTiming()
[all …]
|
| /dports/lang/spidermonkey78/firefox-78.9.0/media/webrtc/trunk/webrtc/modules/audio_processing/test/conversational_speech/ |
| H A D | multiend_call.cc | 38 for (const Turn& turn : timing_) { in FindSpeakerNames() local
39 speaker_names_.emplace(turn.speaker_name); in FindSpeakerNames()
46 for (const Turn& turn : timing_) { in CreateAudioTrackReaders() local
47 auto it = audiotrack_readers_.find(turn.audiotrack_file_name); in CreateAudioTrackReaders()
53 audiotracks_path_, turn.audiotrack_file_name); in CreateAudioTrackReaders()
73 turn.audiotrack_file_name, std::move(wavreader)); in CreateAudioTrackReaders()
112 const Turn& turn = timing_[turn_index]; in CheckTiming() local
113 auto it = audiotrack_readers_.find(turn.audiotrack_file_name); in CheckTiming()
119 turn.offset, it->second->SampleRate()); in CheckTiming()
143 turn.speaker_name, turn.audiotrack_file_name, in CheckTiming()
[all …]
|
| /dports/astro/josm/josm-18303/data/validator/ |
| H A D | highway.mapcss | 169 way[turn ][turn !~ /^(none|((sharp_|slight_|merge_…
170 way[turn:forward ][turn:forward !~ /^(none|((sharp_|slight_|merge_…
171 way[turn:backward ][turn:backward !~ /^(none|((sharp_|slight_|merge_…
172 way[turn:both_ways ][turn:both_ways !~ /^(none|((sharp_|slight_|merge_…
182 assertMatch: "way turn=straight"; /* through would be correct */
183 assertMatch: "way turn=slight_reverse"; /* wrong value */
184 assertMatch: "way turn=through|right"; /* :lanes missing in key */
185 assertNoMatch: "way turn=through;right";
186 assertMatch: "way turn:lanes:forward=straight|right"; /* through would be correct */
187 assertMatch: "way turn:lanes:forward=slight_reverse|right"; /* wrong value */
[all …]
|
| /dports/games/freeciv/freeciv-2.6.6/doc/ |
| H A D | README.scorelog | 21 turn <turn> <number> <descr>
22 adds information about the <turn> turn
26 addplayer <turn> <player-id> <name>
27 adds a player starting at the given turn (inclusive)
31 delplayer <turn> <player-id>
33 active till the given turn (inclusive)
36 data <turn> <tag-id> <player-id> <value>
38 player for the given turn.
|
| /dports/games/freeciv-nox11/freeciv-2.6.6/doc/ |
| H A D | README.scorelog | 21 turn <turn> <number> <descr>
22 adds information about the <turn> turn
26 addplayer <turn> <player-id> <name>
27 adds a player starting at the given turn (inclusive)
31 delplayer <turn> <player-id>
33 active till the given turn (inclusive)
36 data <turn> <tag-id> <player-id> <value>
38 player for the given turn.
|
| /dports/math/z3/z3-z3-4.8.13/src/util/ |
| H A D | max_cliques.h | 114 bool turn = false; in cliques() local
115 m_reachable[turn] = vars; in cliques()
116 while (!m_reachable[turn].empty()) { in cliques()
117 unsigned p = *m_reachable[turn].begin(); in cliques()
118 m_reachable[turn].remove(p); in cliques()
121 if (m_reachable[turn].empty()) { in cliques()
124 m_reachable[!turn].reset(); in cliques()
125 get_reachable(p, m_reachable[turn], m_reachable[!turn]); in cliques()
126 turn = !turn; in cliques()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/util/ |
| H A D | max_cliques.h | 116 bool turn = false; in cliques() local
117 m_reachable[turn] = vars; in cliques()
118 while (!m_reachable[turn].empty()) { in cliques()
119 unsigned p = *m_reachable[turn].begin(); in cliques()
120 m_reachable[turn].remove(p); in cliques()
123 if (m_reachable[turn].empty()) { in cliques()
126 m_reachable[!turn].reset(); in cliques()
127 get_reachable(p, m_reachable[turn], m_reachable[!turn]); in cliques()
128 turn = !turn; in cliques()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/geometry/algorithms/detail/buffer/ |
| H A D | turn_in_original_visitor.hpp | 73 static inline bool apply(Turn const& turn) in apply()
75 return turn.is_turn_traversable; in apply()
87 inline bool apply(Box const& box, Turn const& turn) const in apply()
89 if (! turn.is_turn_traversable || turn.within_original) in apply()
96 turn.point, box, m_strategy); in apply()
238 inline bool apply(Turn const& turn, Original const& original) in apply() argument
246 if (! turn.is_turn_traversable || turn.within_original) in apply()
252 if (geometry::disjoint(turn.point, original.m_box, m_strategy)) in apply()
258 int const code = point_in_original(turn.point, original, in apply()
259 m_strategy.relate(turn.point, original.m_ring)); in apply()
[all …]
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/features/car/ |
| H A D | traffic_turn_penalties.feature | 2 Feature: Traffic - turn penalties
52 Scenario: Weighting not based on turn penalty file
72 Scenario: Weighting based on turn penalty file
73 Given the turn penalty file
82 # ifg right turn
83 # imn left turn
84 # hdc left turn
85 # lkh right turn
86 # hkl left turn
87 # ade left turn
[all …]
|
| /dports/science/py-pymol/pymol-open-source-2.4.0/examples/devel/ |
| H A D | scenes_to_movie01.pml | 13 turn x,180
24 turn x,45
25 turn y,45
39 turn y,-30
41 turn y,60
48 turn y,-30
50 turn y,60
57 turn y,-30
59 turn y,60
|
| /dports/shells/bicon/bicon-0.5/bicon/ |
| H A D | bicon_read.c | 44 int turn, par_len, offset, del_num, utf8mode; variable
64 turn = 1 - turn; in bicon_read()
67 read (fd, input[turn] + offset, sizeof (input[turn]) - 1 - offset); in bicon_read()
71 input_end = input[turn] + count; in bicon_read()
76 input_cursor = input[turn]; in bicon_read()
128 && par_len < sizeof input[turn] - 1) in bicon_read()
131 memmove (input[1 - turn], input_cursor, offset = par_len); in bicon_read()
241 turn = offset = del_num = 0; in bicon_read_init()
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/features/testbot/ |
| H A D | traffic_turn_penalties.feature | 2 Feature: Traffic - turn penalties applied to turn onto which a phantom node snaps
33 …# Since testbot doesn't have turn penalties, a penalty from file of 0 should produce a neutral eff…
35 …Scenario: Weighting based on turn penalty file, with an extreme negative value -- clamps and does …
36 Given the turn penalty file
41 And the contract extra arguments "--turn-penalty-file {penalties_file}"
42 And the customize extra arguments "--turn-penalty-file {penalties_file}"
53 Scenario: Weighting based on turn penalty file with weights
54 Given the turn penalty file
59 And the contract extra arguments "--turn-penalty-file {penalties_file}"
60 And the customize extra arguments "--turn-penalty-file {penalties_file}"
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/profiles/ |
| H A D | foot.lua | 244 function process_turn (profile, turn)
245 turn.duration = 0.
247 if turn.direction_modifier == direction_modifier.u_turn then
248 turn.duration = turn.duration + profile.properties.u_turn_penalty
251 if turn.has_traffic_light then
252 turn.duration = profile.properties.traffic_light_penalty
256 if not turn.source_restricted and turn.target_restricted then
257 turn.weight = turn.weight + 3000
|
| /dports/devel/boost-docs/boost_1_72_0/boost/geometry/algorithms/detail/buffer/ |
| H A D | turn_in_original_visitor.hpp | 56 static inline bool apply(Turn const& turn) in apply()
58 return turn.location == location_ok; in apply()
66 static inline bool apply(Box const& box, Turn const& turn) in apply()
68 if (turn.location != location_ok || turn.within_original) in apply()
75 turn.robust_point, box, DisjointPointBoxStrategy()); in apply()
215 inline bool apply(Turn const& turn, Original const& original, bool first = true) in apply() argument
219 if (turn.location != location_ok || turn.within_original) in apply()
225 if (geometry::disjoint(turn.robust_point, original.m_box)) in apply()
231 … int const code = point_in_original(turn.robust_point, original, m_point_in_geometry_strategy); in apply()
238 Turn& mutable_turn = m_mutable_turns[turn.turn_index]; in apply()
|
| /dports/lang/gravity/gravity-0.8.5/test/fuzzy/2017-04-05/ |
| H A D | id_000107_sig_11_src_003538_op_havoc_rep_4.gravity | 8 fun return""0\(x)0\(y)l\(z)nt z+turn""0\(x)0\(y),\(z)nt z+v@#
12 fun retur)nt z+turn""0\(x)�(y),\(z)nt z+v)#
13 elwe )0\ y),\(z)nt fun return""0\(x)0\(y),\(z)nt z+turn""0\(x)0\(y),\(z)nt z+v)#
15 el""0\(x)0\(y),\(z)nt z+turn""0\(x)�(y),\(z)nt z+v)#
21 fun return""0\(x)0\=y)l\n return""0\(x)0\(y),\(z)nt z+turn""0\(x)0\(y),\(z)nt z+v)#
23 el""0\(x)0\(y),\(z)nt z+turn""0\(x)�(y),\(z)nt z+v)#
27 fun return""0\(x)0\(y)l\(z)nt z+turn""0\(x)0\(y),\(z)nt z+v)#
28 el""0\(x)0\(y),\(z)nt z+turn""0\(x)0\(y),\(z)nt z+v)#
29 el""0\(x)0\(y),\(z)nt z+turturn""0\(x)0\(y),\(z)nt z+turn""0\(x)0\(y),\(z)nt z+v)#
31 fun@ Stri(y)l\(z)nt z+turn""0\(x)0\(y),\(z)nt z+v)#
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/geometry/algorithms/detail/buffer/ |
| H A D | turn_in_original_visitor.hpp | 49 static inline bool apply(Turn const& turn) in apply()
51 return turn.location == location_ok; in apply()
58 static inline bool apply(Box const& box, Turn const& turn) in apply()
60 if (turn.location != location_ok || turn.within_original) in apply()
67 turn.robust_point, box); in apply()
208 inline void apply(Turn const& turn, Original const& original, bool first = true) in apply() argument
212 if (turn.location != location_ok || turn.within_original) in apply()
218 if (geometry::disjoint(turn.robust_point, original.m_box)) in apply()
224 int const code = point_in_original(turn.robust_point, original); in apply()
231 Turn& mutable_turn = m_mutable_turns[turn.turn_index]; in apply()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/geometry/algorithms/detail/buffer/ |
| H A D | turn_in_original_visitor.hpp | 49 static inline bool apply(Turn const& turn) in apply()
51 return turn.location == location_ok; in apply()
58 static inline bool apply(Box const& box, Turn const& turn) in apply()
60 if (turn.location != location_ok || turn.within_original) in apply()
67 turn.robust_point, box); in apply()
208 inline void apply(Turn const& turn, Original const& original, bool first = true) in apply() argument
212 if (turn.location != location_ok || turn.within_original) in apply()
218 if (geometry::disjoint(turn.robust_point, original.m_box)) in apply()
224 int const code = point_in_original(turn.robust_point, original); in apply()
231 Turn& mutable_turn = m_mutable_turns[turn.turn_index]; in apply()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/geometry/algorithms/detail/buffer/ |
| H A D | turn_in_original_visitor.hpp | 49 static inline bool apply(Turn const& turn) in apply()
51 return turn.location == location_ok; in apply()
58 static inline bool apply(Box const& box, Turn const& turn) in apply()
60 if (turn.location != location_ok || turn.within_original) in apply()
67 turn.robust_point, box); in apply()
208 inline void apply(Turn const& turn, Original const& original, bool first = true) in apply() argument
212 if (turn.location != location_ok || turn.within_original) in apply()
218 if (geometry::disjoint(turn.robust_point, original.m_box)) in apply()
224 int const code = point_in_original(turn.robust_point, original); in apply()
231 Turn& mutable_turn = m_mutable_turns[turn.turn_index]; in apply()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/geometry/algorithms/detail/buffer/ |
| H A D | turn_in_original_visitor.hpp | 56 static inline bool apply(Turn const& turn) in apply()
58 return turn.location == location_ok; in apply()
66 static inline bool apply(Box const& box, Turn const& turn) in apply()
68 if (turn.location != location_ok || turn.within_original) in apply()
75 turn.robust_point, box, DisjointPointBoxStrategy()); in apply()
219 inline bool apply(Turn const& turn, Original const& original, bool first = true) in apply() argument
223 if (turn.location != location_ok || turn.within_original) in apply()
229 if (geometry::disjoint(turn.robust_point, original.m_box)) in apply()
235 int const code = point_in_original(turn.robust_point, original); in apply()
242 Turn& mutable_turn = m_mutable_turns[turn.turn_index]; in apply()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/geometry/algorithms/detail/buffer/ |
| H A D | turn_in_original_visitor.hpp | 49 static inline bool apply(Turn const& turn) in apply()
51 return turn.location == location_ok; in apply()
58 static inline bool apply(Box const& box, Turn const& turn) in apply()
60 if (turn.location != location_ok || turn.within_original) in apply()
67 turn.robust_point, box); in apply()
208 inline void apply(Turn const& turn, Original const& original, bool first = true) in apply() argument
212 if (turn.location != location_ok || turn.within_original) in apply()
218 if (geometry::disjoint(turn.robust_point, original.m_box)) in apply()
224 int const code = point_in_original(turn.robust_point, original); in apply()
231 Turn& mutable_turn = m_mutable_turns[turn.turn_index]; in apply()
|