Home
last modified time | relevance | path

Searched full:cut (Results 1 – 25 of 4553) sorted by relevance

12345678910>>...183

/aosp_15_r20/external/guava/android/guava/src/com/google/common/collect/
H A DTreeRangeSet.java46 @VisibleForTesting final NavigableMap<Cut<C>, Range<C>> rangesByLowerBound;
50 return new TreeRangeSet<>(new TreeMap<Cut<C>, Range<C>>()); in create()
75 private TreeRangeSet(NavigableMap<Cut<C>, Range<C>> rangesByLowerCut) { in TreeRangeSet()
124 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(Cut.belowValue(value)); in rangeContaining()
136 Entry<Cut<C>, Range<C>> ceilingEntry = rangesByLowerBound.ceilingEntry(range.lowerBound); in intersects()
142 Entry<Cut<C>, Range<C>> priorEntry = rangesByLowerBound.lowerEntry(range.lowerBound); in intersects()
151 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); in encloses()
158 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); in rangeEnclosing()
166 Entry<Cut<C>, Range<C>> firstEntry = rangesByLowerBound.firstEntry(); in span()
167 Entry<Cut<C>, Range<C>> lastEntry = rangesByLowerBound.lastEntry(); in span()
[all …]
H A DCut.java29 * always be represented by a pair of {@code Cut} instances.
36 abstract class Cut<C extends Comparable> implements Comparable<Cut<C>>, Serializable { class
39 Cut(C endpoint) { in Cut() method in Cut
49 abstract Cut<C> withLowerBoundType(BoundType boundType, DiscreteDomain<C> domain); in withLowerBoundType()
51 abstract Cut<C> withUpperBoundType(BoundType boundType, DiscreteDomain<C> domain); in withUpperBoundType()
64 * The canonical form is a BelowValue cut whenever possible, otherwise ABOVE_ALL, or
67 Cut<C> canonical(DiscreteDomain<C> domain) { in canonical()
73 public int compareTo(Cut<C> that) { in compareTo()
95 if (obj instanceof Cut) { in equals()
96 // It might not really be a Cut<C>, but we'll catch a CCE if it's not in equals()
[all …]
H A DRange.java131 static <C extends Comparable<?>> Range<C> create(Cut<C> lowerBound, Cut<C> upperBound) { in create()
145 return create(Cut.aboveValue(lower), Cut.belowValue(upper)); in open()
157 return create(Cut.belowValue(lower), Cut.aboveValue(upper)); in closed()
169 return create(Cut.belowValue(lower), Cut.belowValue(upper)); in closedOpen()
181 return create(Cut.aboveValue(lower), Cut.aboveValue(upper)); in openClosed()
197 Cut<C> lowerBound = in range()
198 (lowerType == BoundType.OPEN) ? Cut.aboveValue(lower) : Cut.belowValue(lower); in range()
199 Cut<C> upperBound = in range()
200 (upperType == BoundType.OPEN) ? Cut.belowValue(upper) : Cut.aboveValue(upper); in range()
210 return create(Cut.<C>belowAll(), Cut.belowValue(endpoint)); in lessThan()
[all …]
/aosp_15_r20/external/guava/guava/src/com/google/common/collect/
H A DTreeRangeSet.java46 @VisibleForTesting final NavigableMap<Cut<C>, Range<C>> rangesByLowerBound;
50 return new TreeRangeSet<>(new TreeMap<Cut<C>, Range<C>>()); in create()
75 private TreeRangeSet(NavigableMap<Cut<C>, Range<C>> rangesByLowerCut) { in TreeRangeSet()
124 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(Cut.belowValue(value)); in rangeContaining()
136 Entry<Cut<C>, Range<C>> ceilingEntry = rangesByLowerBound.ceilingEntry(range.lowerBound); in intersects()
142 Entry<Cut<C>, Range<C>> priorEntry = rangesByLowerBound.lowerEntry(range.lowerBound); in intersects()
151 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); in encloses()
158 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); in rangeEnclosing()
166 Entry<Cut<C>, Range<C>> firstEntry = rangesByLowerBound.firstEntry(); in span()
167 Entry<Cut<C>, Range<C>> lastEntry = rangesByLowerBound.lastEntry(); in span()
[all …]
H A DCut.java29 * always be represented by a pair of {@code Cut} instances.
36 abstract class Cut<C extends Comparable> implements Comparable<Cut<C>>, Serializable { class
39 Cut(C endpoint) { in Cut() method in Cut
49 abstract Cut<C> withLowerBoundType(BoundType boundType, DiscreteDomain<C> domain); in withLowerBoundType()
51 abstract Cut<C> withUpperBoundType(BoundType boundType, DiscreteDomain<C> domain); in withUpperBoundType()
64 * The canonical form is a BelowValue cut whenever possible, otherwise ABOVE_ALL, or
67 Cut<C> canonical(DiscreteDomain<C> domain) { in canonical()
73 public int compareTo(Cut<C> that) { in compareTo()
95 if (obj instanceof Cut) { in equals()
96 // It might not really be a Cut<C>, but we'll catch a CCE if it's not in equals()
[all …]
H A DTreeRangeMap.java58 private final NavigableMap<Cut<K>, RangeMapEntry<K, V>> entriesByLowerBound;
73 RangeMapEntry(Cut<K> lowerBound, Cut<K> upperBound, V value) { in RangeMapEntry()
96 Cut<K> getLowerBound() { in getLowerBound()
100 Cut<K> getUpperBound() { in getUpperBound()
115 Entry<Cut<K>, RangeMapEntry<K, V>> mapEntry = in getEntry()
116 entriesByLowerBound.floorEntry(Cut.belowValue(key)); in getEntry()
148 Entry<Cut<K>, RangeMapEntry<K, V>> lowerEntry = in coalescedRange()
152 Entry<Cut<K>, RangeMapEntry<K, V>> higherEntry = in coalescedRange()
161 Range<K> range, V value, @CheckForNull Entry<Cut<K>, RangeMapEntry<K, V>> entry) { in coalesce()
184 Entry<Cut<K>, RangeMapEntry<K, V>> firstEntry = entriesByLowerBound.firstEntry(); in span()
[all …]
H A DRange.java131 static <C extends Comparable<?>> Range<C> create(Cut<C> lowerBound, Cut<C> upperBound) { in create()
145 return create(Cut.aboveValue(lower), Cut.belowValue(upper)); in open()
157 return create(Cut.belowValue(lower), Cut.aboveValue(upper)); in closed()
169 return create(Cut.belowValue(lower), Cut.belowValue(upper)); in closedOpen()
181 return create(Cut.aboveValue(lower), Cut.aboveValue(upper)); in openClosed()
197 Cut<C> lowerBound = in range()
198 (lowerType == BoundType.OPEN) ? Cut.aboveValue(lower) : Cut.belowValue(lower); in range()
199 Cut<C> upperBound = in range()
200 (upperType == BoundType.OPEN) ? Cut.belowValue(upper) : Cut.aboveValue(upper); in range()
210 return create(Cut.<C>belowAll(), Cut.belowValue(endpoint)); in lessThan()
[all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/geometry/partitioning/
H A DBSPTree.java35 * sub-regions at each side of a cut hyperplane. The root tree
70 /** Cut sub-hyperplane. */
71 private SubHyperplane<S> cut; field in BSPTree
73 /** Tree at the plus side of the cut hyperplane. */
76 /** Tree at the minus side of the cut hyperplane. */
88 cut = null; in BSPTree()
99 cut = null; in BSPTree()
113 * @param cut cut sub-hyperplane for the tree
119 public BSPTree(final SubHyperplane<S> cut, final BSPTree<S> plus, final BSPTree<S> minus, in BSPTree() argument
121 this.cut = cut; in BSPTree()
[all …]
H A DCharacterization.java25 /** Cut sub-hyperplanes characterization with respect to inside/outside cells.
32 /** Part of the cut sub-hyperplane that touch outside cells. */
35 /** Part of the cut sub-hyperplane that touch inside cells. */
48 * twice for each cut sub-hyperplane in the tree, once on the plus
68 * each cut sub-hyperplane in the tree, once on the plus node and
110 /** Add a part of the cut sub-hyperplane known to touch an outside cell.
111 * @param sub part of the cut sub-hyperplane known to touch an outside cell
124 /** Add a part of the cut sub-hyperplane known to touch an inside cell.
125 * @param sub part of the cut sub-hyperplane known to touch an inside cell
138 /** Check if the cut sub-hyperplane touches outside cells.
[all …]
/aosp_15_r20/external/python/cpython3/Objects/stringlib/
Dstringlib_find_two_way_notes.txt27 * "Very carefully" cut the needle in two.
47 cut: <<<<>>>>
53 cut: <<<<>>>>
55 Why are we allowed to do this? Because we cut the needle very
56 carefully, in such a way that if the cut is ...abcd + EFGH... then
66 cut, then the following alignments do not work, so we can skip them:
166 This is because no matter how you cut it, you'll get
167 s[cut-3:cut] == s[cut:cut+3]. So what do we do? We still cut the
179 since ?AA == bAA. We already knew that a cut to make length-3
184 that no matter the period of the original needle, you can cut it in
[all …]
Dfastsearch.h243 >>> needle = (left := needle[:cut]) + (right := needle[cut:]) in STRINGLIB()
244 where the "local period" of the cut is maximal. in STRINGLIB()
246 The local period of the cut is the minimal length of a string w in STRINGLIB()
253 Crochemore and Perrin (1991) show that this cut can be computed in STRINGLIB()
260 >>> cut, period = factorize(x) in STRINGLIB()
261 >>> x[:cut], (right := x[cut:]) in STRINGLIB()
274 Py_ssize_t cut1, period1, cut2, period2, cut, period; in STRINGLIB() local
278 // Take the later cut. in STRINGLIB()
281 cut = cut1; in STRINGLIB()
285 cut = cut2; in STRINGLIB()
[all …]
/aosp_15_r20/external/python/cpython3/Tools/peg_generator/pegen/
Dgrammar_parser.py15 Cut,
338 cut = False
346 (cut := True)
352 if cut: return None
353 cut = False
359 (cut := True)
365 if cut: return None
387 cut = False
393 (cut := True)
399 if cut: return None
[all …]
/aosp_15_r20/external/trusty/arm-trusted-firmware/drivers/renesas/rcar/qos/
Dqos_init.c70 ERROR("LSI Cut ID(PRR=0x%x) QoS " \
127 case PRR_PRODUCT_21: /* M3 Cut 13 */ in rcar_qos_init()
130 case PRR_PRODUCT_30: /* M3 Cut 30 */ in rcar_qos_init()
195 /* H3 Cut 10 */ in rcar_qos_init()
202 /* H3 Cut 11 */ in rcar_qos_init()
209 /* H3 Cut 20 */ in rcar_qos_init()
216 /* H3 Cut 30 or later */ in rcar_qos_init()
224 /* H3N Cut 30 or later */ in rcar_qos_init()
232 /* M3 Cut 10 */ in rcar_qos_init()
239 /* M3 Cut 11 */ in rcar_qos_init()
[all …]
/aosp_15_r20/external/arm-trusted-firmware/drivers/renesas/rcar/qos/
H A Dqos_init.c70 ERROR("LSI Cut ID(PRR=0x%x) QoS " \
127 case PRR_PRODUCT_21: /* M3 Cut 13 */ in rcar_qos_init()
130 case PRR_PRODUCT_30: /* M3 Cut 30 */ in rcar_qos_init()
195 /* H3 Cut 10 */ in rcar_qos_init()
202 /* H3 Cut 11 */ in rcar_qos_init()
209 /* H3 Cut 20 */ in rcar_qos_init()
216 /* H3 Cut 30 or later */ in rcar_qos_init()
224 /* H3N Cut 30 or later */ in rcar_qos_init()
232 /* M3 Cut 10 */ in rcar_qos_init()
239 /* M3 Cut 11 */ in rcar_qos_init()
[all …]
/aosp_15_r20/external/rust/android-crates-io/crates/regex-syntax/src/hir/literal/
Dmod.rs17 /// said to be either *complete* or *cut*. A complete literal means that
48 cut: bool, field
194 /// If any literal would be cut out completely by trimming, then None is
207 lit.cut(); in trim_suffix()
244 // just drop it. But make sure that cut literals are in unambiguous_prefixes()
246 candidate.cut = candidate.cut || lit2.cut; in unambiguous_prefixes()
247 lit2.cut = candidate.cut; in unambiguous_prefixes()
252 candidate.cut(); in unambiguous_prefixes()
255 lit3.cut(); in unambiguous_prefixes()
260 lit2.cut(); in unambiguous_prefixes()
[all …]
/aosp_15_r20/external/ksoap2/kobjects/org/ksoap2/kobjects/mime/
H A DDecoder.java83 int cut = header.indexOf('"', pos); in getHeaderElements() local
84 if (cut == -1) in getHeaderElements()
87 result.put(key, header.substring(pos, cut)); in getHeaderElements()
88 pos = cut + 2; in getHeaderElements()
96 int cut = header.indexOf(';', pos); in getHeaderElements() local
97 if (cut == -1) { in getHeaderElements()
101 result.put(key, header.substring(pos, cut)); in getHeaderElements()
102 pos = cut + 1; in getHeaderElements()
105 int cut = header.indexOf('=', pos); in getHeaderElements() local
107 if (cut == -1) in getHeaderElements()
[all …]
/aosp_15_r20/external/AFLplusplus/test/
H A Dtest-qemu-mode.sh31 echo CUT------------------------------------------------------------------CUT
33 echo CUT------------------------------------------------------------------CUT
52 echo CUT------------------------------------------------------------------CUT
54 echo CUT------------------------------------------------------------------CUT
73 echo CUT------------------------------------------------------------------CUT
75 echo CUT------------------------------------------------------------------CUT
96 echo CUT------------------------------------------------------------------CUT
98 echo CUT------------------------------------------------------------------CUT
146 echo CUT------------------------------------------------------------------CUT
148 echo CUT------------------------------------------------------------------CUT
/aosp_15_r20/external/ltp/testcases/kernel/security/integrity/ima/tests/
H A Dima_setup.sh29 digest="$(${algorithm}sum $file 2>/dev/null | cut -f1 -d ' ')"
35 digest="$(openssl $algorithm $file 2>/dev/null | cut -f2 -d ' ')"
48 digest="$(rdigest --$arg $file 2>/dev/null | cut -f1 -d ' ')"
133 dir="$(grep ^$type /proc/mounts | cut -d ' ' -f2 | head -1)"
201 local template="$(tail -1 $ASCII_MEASUREMENTS | cut -d' ' -f 3)"
237 digest=$(echo "$line" | cut -d' ' -f $DIGEST_INDEX)
244 algorithm=$(echo "$digest" | cut -d $delimiter -f 1)
245 digest=$(echo "$digest" | cut -d $delimiter -f 2)
278 algorithm=$(echo "$tmp" | cut -d'|' -f1)
279 digest=$(echo "$tmp" | cut -d'|' -f2)
[all …]
/aosp_15_r20/external/arm-trusted-firmware/drivers/renesas/rzg/qos/
H A Dqos_init.c54 ERROR("LSI Cut ID(PRR=0x%x) QoS " \
83 case PRR_PRODUCT_21: /* G2M Cut 13 */ in rzg_qos_init()
86 case PRR_PRODUCT_30: /* G2M Cut 30 */ in rzg_qos_init()
138 /* G2M Cut 10 */ in rzg_qos_init()
145 /* G2M Cut 11 */ in rzg_qos_init()
152 /* G2M Cut 13 */ in rzg_qos_init()
159 /* G2M Cut 30 or later */ in rzg_qos_init()
167 /* G2H Cut 30 or later */ in rzg_qos_init()
173 /* G2N Cut 10 or later */ in rzg_qos_init()
179 /* G2E Cut 10 or later */ in rzg_qos_init()
[all …]
/aosp_15_r20/external/trusty/arm-trusted-firmware/drivers/renesas/rzg/qos/
Dqos_init.c54 ERROR("LSI Cut ID(PRR=0x%x) QoS " \
83 case PRR_PRODUCT_21: /* G2M Cut 13 */ in rzg_qos_init()
86 case PRR_PRODUCT_30: /* G2M Cut 30 */ in rzg_qos_init()
138 /* G2M Cut 10 */ in rzg_qos_init()
145 /* G2M Cut 11 */ in rzg_qos_init()
152 /* G2M Cut 13 */ in rzg_qos_init()
159 /* G2M Cut 30 or later */ in rzg_qos_init()
167 /* G2H Cut 30 or later */ in rzg_qos_init()
173 /* G2N Cut 10 or later */ in rzg_qos_init()
179 /* G2E Cut 10 or later */ in rzg_qos_init()
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/python3/lib/python3.11/site-packages/pip/_vendor/rich/
Dsegment.py111 def _split_cells(cls, segment: "Segment", cut: int) -> Tuple["Segment", "Segment"]:
117 if cut >= cell_length:
122 pos = int((cut / cell_length) * (len(text) - 1))
126 if cell_pos == cut:
136 if cell_pos == cut:
141 if cell_pos > cut:
149 def split_cells(self, cut: int) -> Tuple["Segment", "Segment"]:
152 If the cut point falls in the middle of a 2-cell wide character then it is replaced
162 if cut >= len(text):
165 Segment(text[:cut], style, control),
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/python3/lib/python3.11/site-packages/pip/_vendor/rich/
Dsegment.py111 def _split_cells(cls, segment: "Segment", cut: int) -> Tuple["Segment", "Segment"]:
117 if cut >= cell_length:
122 pos = int((cut / cell_length) * (len(text) - 1))
126 if cell_pos == cut:
136 if cell_pos == cut:
141 if cell_pos > cut:
149 def split_cells(self, cut: int) -> Tuple["Segment", "Segment"]:
152 If the cut point falls in the middle of a 2-cell wide character then it is replaced
162 if cut >= len(text):
165 Segment(text[:cut], style, control),
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/python3/lib/python3.11/site-packages/pip/_vendor/rich/
Dsegment.py111 def _split_cells(cls, segment: "Segment", cut: int) -> Tuple["Segment", "Segment"]:
117 if cut >= cell_length:
122 pos = int((cut / cell_length) * (len(text) - 1))
126 if cell_pos == cut:
136 if cell_pos == cut:
141 if cell_pos > cut:
149 def split_cells(self, cut: int) -> Tuple["Segment", "Segment"]:
152 If the cut point falls in the middle of a 2-cell wide character then it is replaced
162 if cut >= len(text):
165 Segment(text[:cut], style, control),
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/python3/lib/python3.11/site-packages/pip/_vendor/rich/
Dsegment.py111 def _split_cells(cls, segment: "Segment", cut: int) -> Tuple["Segment", "Segment"]:
117 if cut >= cell_length:
122 pos = int((cut / cell_length) * (len(text) - 1))
126 if cell_pos == cut:
136 if cell_pos == cut:
141 if cell_pos > cut:
149 def split_cells(self, cut: int) -> Tuple["Segment", "Segment"]:
152 If the cut point falls in the middle of a 2-cell wide character then it is replaced
162 if cut >= len(text):
165 Segment(text[:cut], style, control),
[all …]
/aosp_15_r20/external/linux-kselftest/tools/testing/selftests/ftrace/test.d/
H A Dfunctions21 cmd=`echo $line | cut -f2- -d: | cut -f1 -d"["`
22 file=`echo $line | cut -f1 -d:`
27 cmd=`echo $line | cut -f2- -d: | cut -f1 -d"["`
28 file=`echo $line | cut -f1 -d:`
43 echo 0 > `echo $line | cut -f1 -d:`
53 tr=`echo $t | cut -d: -f2`
60 name=`echo $t | cut -d: -f1 | cut -d' ' -f1`
62 tr=`echo $t | cut -d: -f2-4`
63 limit=`echo $t | cut -d: -f5`
65 tr=`echo $t | cut -d: -f2`
[all …]

12345678910>>...183