Home
last modified time | relevance | path

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

12345678910>>...78

/external/python/cpython3/Tools/peg_generator/pegen/
Dgrammar_parser.py12 Cut,
44 cut = False
52 if cut: return None
59 cut = False
67 if cut: return None
68 cut = False
74 if cut: return None
81 cut = False
89 if cut: return None
90 cut = False
[all …]
/external/guava/android/guava/src/com/google/common/collect/
DTreeRangeSet.java47 @VisibleForTesting final NavigableMap<Cut<C>, Range<C>> rangesByLowerBound;
51 return new TreeRangeSet<>(new TreeMap<Cut<C>, Range<C>>()); in create()
76 private TreeRangeSet(NavigableMap<Cut<C>, Range<C>> rangesByLowerCut) { in TreeRangeSet()
125 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(Cut.belowValue(value)); in rangeContaining()
137 Entry<Cut<C>, Range<C>> ceilingEntry = rangesByLowerBound.ceilingEntry(range.lowerBound); in intersects()
143 Entry<Cut<C>, Range<C>> priorEntry = rangesByLowerBound.lowerEntry(range.lowerBound); in intersects()
152 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); in encloses()
159 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); in rangeEnclosing()
167 Entry<Cut<C>, Range<C>> firstEntry = rangesByLowerBound.firstEntry(); in span()
168 Entry<Cut<C>, Range<C>> lastEntry = rangesByLowerBound.lastEntry(); in span()
[all …]
DCut.java30 * 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 …]
DRange.java125 static class LowerBoundFn implements Function<Range, Cut> {
129 public Cut apply(Range range) { in apply()
134 static class UpperBoundFn implements Function<Range, Cut> {
138 public Cut apply(Range range) { in apply()
144 static <C extends Comparable<?>> Function<Range<C>, Cut<C>> lowerBoundFn() { in lowerBoundFn()
149 static <C extends Comparable<?>> Function<Range<C>, Cut<C>> upperBoundFn() { in upperBoundFn()
157 static <C extends Comparable<?>> Range<C> create(Cut<C> lowerBound, Cut<C> upperBound) { in create()
171 return create(Cut.aboveValue(lower), Cut.belowValue(upper)); in open()
183 return create(Cut.belowValue(lower), Cut.aboveValue(upper)); in closed()
195 return create(Cut.belowValue(lower), Cut.belowValue(upper)); in closedOpen()
[all …]
/external/guava/guava/src/com/google/common/collect/
DTreeRangeSet.java47 @VisibleForTesting final NavigableMap<Cut<C>, Range<C>> rangesByLowerBound;
51 return new TreeRangeSet<>(new TreeMap<Cut<C>, Range<C>>()); in create()
76 private TreeRangeSet(NavigableMap<Cut<C>, Range<C>> rangesByLowerCut) { in TreeRangeSet()
125 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(Cut.belowValue(value)); in rangeContaining()
137 Entry<Cut<C>, Range<C>> ceilingEntry = rangesByLowerBound.ceilingEntry(range.lowerBound); in intersects()
143 Entry<Cut<C>, Range<C>> priorEntry = rangesByLowerBound.lowerEntry(range.lowerBound); in intersects()
152 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); in encloses()
159 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); in rangeEnclosing()
167 Entry<Cut<C>, Range<C>> firstEntry = rangesByLowerBound.firstEntry(); in span()
168 Entry<Cut<C>, Range<C>> lastEntry = rangesByLowerBound.lastEntry(); in span()
[all …]
DCut.java30 * 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 …]
DTreeRangeMap.java59 private final NavigableMap<Cut<K>, RangeMapEntry<K, V>> entriesByLowerBound;
74 RangeMapEntry(Cut<K> lowerBound, Cut<K> upperBound, V value) { in RangeMapEntry()
97 Cut<K> getLowerBound() { in getLowerBound()
101 Cut<K> getUpperBound() { in getUpperBound()
116 Entry<Cut<K>, RangeMapEntry<K, V>> mapEntry = in getEntry()
117 entriesByLowerBound.floorEntry(Cut.belowValue(key)); in getEntry()
149 Entry<Cut<K>, RangeMapEntry<K, V>> lowerEntry = in coalescedRange()
153 Entry<Cut<K>, RangeMapEntry<K, V>> higherEntry = in coalescedRange()
162 Range<K> range, V value, @CheckForNull Entry<Cut<K>, RangeMapEntry<K, V>> entry) { in coalesce()
185 Entry<Cut<K>, RangeMapEntry<K, V>> firstEntry = entriesByLowerBound.firstEntry(); in span()
[all …]
DRange.java125 static class LowerBoundFn implements Function<Range, Cut> {
129 public Cut apply(Range range) { in apply()
134 static class UpperBoundFn implements Function<Range, Cut> {
138 public Cut apply(Range range) { in apply()
144 static <C extends Comparable<?>> Function<Range<C>, Cut<C>> lowerBoundFn() { in lowerBoundFn()
149 static <C extends Comparable<?>> Function<Range<C>, Cut<C>> upperBoundFn() { in upperBoundFn()
157 static <C extends Comparable<?>> Range<C> create(Cut<C> lowerBound, Cut<C> upperBound) { in create()
171 return create(Cut.aboveValue(lower), Cut.belowValue(upper)); in open()
183 return create(Cut.belowValue(lower), Cut.aboveValue(upper)); in closed()
195 return create(Cut.belowValue(lower), Cut.belowValue(upper)); in closedOpen()
[all …]
/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.h236 >>> needle = (left := needle[:cut]) + (right := needle[cut:]) in STRINGLIB()
237 where the "local period" of the cut is maximal. in STRINGLIB()
239 The local period of the cut is the minimal length of a string w in STRINGLIB()
246 Crochemore and Perrin (1991) show that this cut can be computed in STRINGLIB()
253 >>> cut, period = factorize(x) in STRINGLIB()
254 >>> x[:cut], (right := x[cut:]) in STRINGLIB()
267 Py_ssize_t cut1, period1, cut2, period2, cut, period; in STRINGLIB() local
271 // Take the later cut. in STRINGLIB()
274 cut = cut1; in STRINGLIB()
278 cut = cut2; in STRINGLIB()
[all …]
/external/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 …]
/external/ksoap2/kobjects/org/ksoap2/kobjects/mime/
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 …]
/external/linux-kselftest/tools/testing/selftests/ftrace/test.d/
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 …]
/external/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 …]
/external/ltp/testcases/kernel/security/integrity/ima/tests/
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 …]
Dima_keys.sh9 TST_NEEDS_CMDS="cmp cut grep sed"
61 sed "s/\./\\\./g" | cut -d'=' -f2; done | sed ':a;N;$!ba;s/\n/|/g')
68 cut -d'=' -f2; done | sed ':a;N;$!ba;s/\n/|/g')
77 digest=$(echo "$line" | cut -d' ' -f4 | cut -d':' -f2)
78 algorithm=$(echo "$line" | cut -d' ' -f4 | cut -d':' -f1)
79 keyring=$(echo "$line" | cut -d' ' -f5)
81 echo "$line" | cut -d' ' -f6 | tst_hexdump -d > $test_file
124 grep $keyring_name $ASCII_MEASUREMENTS | tail -n1 | cut -d' ' -f6 | \
/external/AFLplusplus/test/
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
139 echo CUT------------------------------------------------------------------CUT
141 echo CUT------------------------------------------------------------------CUT
Dtest-unicorn-mode.sh41 echo CUT------------------------------------------------------------------CUT
43 echo CUT------------------------------------------------------------------CUT
69 echo CUT------------------------------------------------------------------CUT
71 echo CUT------------------------------------------------------------------CUT
89 echo CUT------------------------------------------------------------------CUT
91 echo CUT------------------------------------------------------------------CUT
Dtest-frida-mode.sh31 echo CUT------------------------------------------------------------------CUT
33 echo CUT------------------------------------------------------------------CUT
47 echo CUT------------------------------------------------------------------CUT
49 echo CUT------------------------------------------------------------------CUT
88 echo CUT------------------------------------------------------------------CUT
90 echo CUT------------------------------------------------------------------CUT
Dtest-custom-mutators.sh49 echo CUT------------------------------------------------------------------CUT
51 echo CUT------------------------------------------------------------------CUT
68 echo CUT------------------------------------------------------------------CUT
70 echo CUT------------------------------------------------------------------CUT
92 echo CUT------------------------------------------------------------------CUT
94 echo CUT------------------------------------------------------------------CUT
/external/curl/src/
Dtool_msgs.c60 size_t cut = width-1; in voutf() local
62 while(!ISBLANK(ptr[cut]) && cut) { in voutf()
63 cut--; in voutf()
65 if(0 == cut) in voutf()
66 /* not a single cutting position was found, just cut it at the in voutf()
68 cut = width-1; in voutf()
70 (void)fwrite(ptr, cut + 1, 1, stderr); in voutf()
72 ptr += cut + 1; /* skip the space too */ in voutf()
73 len -= cut + 1; in voutf()
/external/selinux/scripts/
DLindent4 V1=`echo $RES | cut -d' ' -f3 | cut -d'.' -f1`
5 V2=`echo $RES | cut -d' ' -f3 | cut -d'.' -f2`
6 V3=`echo $RES | cut -d' ' -f3 | cut -d'.' -f3`
/external/elfutils/tests/
Drun-linkmap-cut.sh25 testfiles linkmap-cut-lib.so linkmap-cut linkmap-cut.core
29 testrun ${abs_top_builddir}/src/stack --core=linkmap-cut.core -e linkmap-cut -m >bt || true
31 grep -q '^#0 0x00007f08bc24d681 libfunc - .////////////////////////////////////linkmap-cut-lib\.so…
32 grep -q '^#1 0x00000000004006b4 main - linkmap-cut$' bt
/external/ltp/testcases/kernel/controllers/
Dtest_controllers.sh42 CPU_CONTROLLER=`grep -w cpu /proc/cgroups | cut -f1`;
43 CPU_CONTROLLER_VALUE=`grep -w cpu /proc/cgroups | cut -f4`;
44 MEM_CONTROLLER=`grep -w memory /proc/cgroups | cut -f1`;
45 MEM_CONTROLLER_VALUE=`grep -w memory /proc/cgroups | cut -f4`;
46 IOTHROTTLE_CONTROLLER=`grep -w blockio /proc/cgroups | cut -f1`;
47 IOTHROTTLE_CONTROLLER_VALUE=`grep -w blockio /proc/cgroups | cut -f4`;
48 FREEZER=`grep -w freezer /proc/cgroups | cut -f1`;
49 FREEZER_VALUE=`grep -w freezer /proc/cgroups | cut -f4`;
50 CPUACCOUNT_CONTROLLER=`grep -w cpuacct /proc/cgroups | cut -f1`
51 CPUACCOUNT_CONTROLLER_VALUE=`grep -w cpuacct /proc/cgroups | cut -f4`
/external/rust/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 …]

12345678910>>...78