| /third_party/boost/libs/graph/example/ |
| D | quick_tour.expected | 6 adjacent vertices: 1 2 3 4
10 adjacent vertices:
14 adjacent vertices: 0 4
18 adjacent vertices: 0 1 4
22 adjacent vertices: 0 1
|
| D | vertex_basics.expected | 5 adjacent vertices: 1 2 3 4
10 adjacent vertices:
15 adjacent vertices: 0 4
20 adjacent vertices: 0 1 4
25 adjacent vertices: 0 1
|
| /third_party/boost/libs/program_options/src/ |
| D | cmdline.cpp | 515 string name, adjacent; in parse_long_option() local
521 adjacent = tok.substr(p+1); in parse_long_option()
522 if (adjacent.empty()) in parse_long_option()
535 if (!adjacent.empty()) in parse_long_option()
536 opt.value.push_back(adjacent); in parse_long_option()
554 string adjacent = tok.substr(2); in parse_short_option() local
580 d->semantic()->max_tokens() == 0 && !adjacent.empty()) { in parse_short_option()
586 if (adjacent.empty()) in parse_short_option()
592 name = string("-") + adjacent[0]; in parse_short_option()
593 adjacent.erase(adjacent.begin()); in parse_short_option()
[all …]
|
| /third_party/node/deps/npm/node_modules/color-convert/ |
| D | route.js | 43 var adjacent = adjacents[i];
44 var node = graph[adjacent];
49 queue.unshift(adjacent);
|
| /third_party/boost/libs/range/doc/reference/algorithm/ |
| D | inplace_merge.qbk | 62 * `[begin(rng), middle)` is in ascending order. That is for each pair of adjacent elements `[x,y]`,…
63 * `[middle, end(rng))` is in ascending order. That is for each pair of adjacent elements `[x,y]`, `…
68 * `[begin(rng), middle)` is in ascending order. That is for each pair of adjacent elements `[x,y]`,…
69 * `[middle, end(rng))` is in ascending order. That is for each pair of adjacent elements `[x,y]`, `…
|
| D | merge.qbk | 68 * The elements of `rng1` are in ascending order. That is, for each adjacent element pair `[x,y]` of…
69 * The elements of `rng2` are in ascending order. That is, for each adjacent element pair `[x,y]` of…
76 * The elements of `rng1` are in ascending order. That is, for each adjacent element pair `[x,y]`, o…
77 * The elements of `rng2` are in ascending order. That is, for each adjacent element pair `[x,y]`, o…
|
| D | sort.qbk | 28 …redicate, ascending order is defined by `operator<()` such that for all adjacent elements `[x,y]`,…
30 …ith a predicate, ascending order is defined by `pred` such that for all adjacent elements `[x,y]`,…
|
| D | adjacent_find.qbk | 56 `adjacent_find` finds the first adjacent elements `[x,y]` in `rng` where `x == y`
60 `adjacent_find` finds the first adjacent elements `[x,y]` in `rng` where `pred(x,y)` is `true`.
|
| D | stable_sort.qbk | 28 …predicate ascending order is defined by `operator<()` such that for all adjacent elements `[x,y]`,…
30 …th a predicate, ascending order is designed by `pred` such that for all adjacent elements `[x,y]`,…
|
| /third_party/typescript_eslint/packages/eslint-plugin/docs/rules/ |
| D | adjacent-overload-signatures.md | 1 # Require that member overloads be consecutive (`adjacent-overload-signatures`)
89 - TSLint: [adjacent-overload-signatures](https://palantir.github.io/tslint/rules/adjacent-overload-…
|
| /third_party/boost/libs/range/doc/reference/algorithm_ext/ |
| D | is_sorted.qbk | 22 each adjacent elements `[x,y]` the expression `x < y` is `true`.
24 adjacent elements `[x,y]` the expression `pred(x,y)` is `true`.
|
| /third_party/boost/boost/gil/ |
| D | image_view_factory.hpp | 342 static constexpr bool adjacent = member
347 using type = typename __nth_channel_view_basic<View,adjacent>::type;
350 return __nth_channel_view_basic<View,adjacent>::make(src,n); in make()
476 static constexpr bool adjacent = member
481 using type = typename __kth_channel_view_basic<K,View,adjacent>::type;
484 return __kth_channel_view_basic<K,View,adjacent>::make(src); in make()
|
| /third_party/flutter/flutter/packages/flutter_localizations/lib/src/l10n/ |
| D | cupertino_en.arb | 49 …"description": "The label adjacent to an hour integer number in a countdown timer. The reference a…
56 …"description": "The label adjacent to a minute integer number in a countdown timer. The reference …
63 …"description": "The label adjacent to a second integer number in a countdown timer. The reference …
|
| /third_party/boost/libs/graph/doc/ |
| D | minimum_degree_ordering.w | 51 make the vertices adjacent to $v$ into a clique\footnote{A clique is a
53 adjacent to every other vertex in the subgraph}.
61 the the vertices adjacent to $y$ with degree equal to $degree(y) - 1$
154 add vertices adjacent to node to the clique
155 put all numbered adjacent vertices into the temporary neighbors stack
|
| D | strong_components.w | 68 finished visiting all of the vertices adjacent to some vertex $u$. We
69 then scan each of the adjacent vertices again, checking the root of
86 \item If $d[a] > d[u]$ then the adjacent vertices are in different
|
| D | transitive_closure.w | 37 vertices adjacent to $v$ in the transitive closure $G^+$ is the same as
273 all of its adjacent vertices together with the adjacent vertices
413 \noindent To extend the chain we pick an adjacent vertex that is not
414 already in a chain. Also, the adjacent vertex chosen will be the one
457 set for each vertex is the union of the successor sets of the adjacent
458 vertex plus the adjacent vertices themselves.
507 all the vertices in another SCC when the two SCCs are adjacent in the
520 // Add edges between all the vertices in two adjacent SCCs
|
| /third_party/css-what/ |
| D | readme.md | 50 | `adjacent` | - | `+` | `{ type: 'adjacen…
|
| /third_party/lz4/examples/ |
| D | streaming_api_basics.md | 24 Streaming API does same thing but (de)compresses multiple adjacent contiguous memory blocks.
86 Usually, "Dependent memory" is previous adjacent contiguous memory up to 64KiBytes.
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 152 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
176 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) { in insertFrom()
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i))) { in insertFrom()
663 if (value(i) == y && Traits::adjacent(b, start(i))) { in insertFrom()
1620 Traits::adjacent(Node.stop(i-1), Start); in canCoalesceLeft()
1625 return Node.value(i-1) == Value && Traits::adjacent(Node.stop(i-1), Start); in canCoalesceLeft()
1629 return Node.value(i) == Value && Traits::adjacent(Node.stop(i), Start); in canCoalesceLeft()
1649 return Node.value(i) == Value && Traits::adjacent(Stop, Node.start(i)); in canCoalesceRight()
1654 return Node.value(i) == Value && Traits::adjacent(Stop, Node.start(i)); in canCoalesceRight()
[all …]
|
| /third_party/skia/third_party/externals/angle2/doc/ |
| D | DebugOverlayInVulkanBackend.md | 65 "coords": [10, "VulkanLastValidationMessage.top.adjacent"],
79 "VulkanSecondaryCommandBufferPoolWaste.top.adjacent"],
88 in the same direction. If `adjacent`, the item expands in the opposite
|
| /third_party/flutter/engine/flutter/lib/web_ui/tool/ |
| D | unicode_sync_script.dart | 36 /// Checks if the [other] tuple is adjacent to this tuple.
38 /// Two tuples are considered adjacent if:
45 /// Merges the ranges of the 2 [PropertyTuples] if they are adjacent.
|
| /third_party/boost/libs/range/doc/reference/adaptors/ |
| D | uniqued.qbk | 15 * [*Postcondition:] For all adjacent elements `[x,y]` in the returned range, `x==y` is false.
|
| D | adjacent_filtered.qbk | 15 * [*Postcondition:] For all adjacent elements `[x,y]` in the returned range, `bi_pred(x,y)` is `tru…
|
| /third_party/skia/third_party/externals/opengl-registry/extensions/NV/ |
| D | NV_geometry_program4.txt | 74 Instead, they represent neighboring vertices that are adjacent to the two
183 the vertices connected by dashed lines are the adjacent vertices that
189 a corresponding "adjacent" vertex that can be accessed by a geometry
190 program (Section 2.15). If geometry programs are disabled, the "adjacent"
197 vertices are considered adjacent to the 4i + 2nd and 4i + 3rd vertices,
206 line segment has a pair of adjacent vertices that can be accessed by
208 "adjacent" vertices are ignored.
214 vertices are considered adjacent to the i + 2nd and i + 3rd vertices,
241 lines are the adjacent vertices that may be used in a geometry program.
246 each triangle edge has an adjacent vertex that can be accessed by geometry
[all …]
|
| /third_party/openGLES/extensions/NV/ |
| D | NV_geometry_program4.txt | 74 Instead, they represent neighboring vertices that are adjacent to the two
183 the vertices connected by dashed lines are the adjacent vertices that
189 a corresponding "adjacent" vertex that can be accessed by a geometry
190 program (Section 2.15). If geometry programs are disabled, the "adjacent"
197 vertices are considered adjacent to the 4i + 2nd and 4i + 3rd vertices,
206 line segment has a pair of adjacent vertices that can be accessed by
208 "adjacent" vertices are ignored.
214 vertices are considered adjacent to the i + 2nd and i + 3rd vertices,
241 lines are the adjacent vertices that may be used in a geometry program.
246 each triangle edge has an adjacent vertex that can be accessed by geometry
[all …]
|