| /prebuilts/go/linux-x86/src/compress/zlib/ |
| writer_test.go | 2 // Use of this source code is governed by a BSD-style
223 t.Errorf("result too large (got %d, want <= %d bytes). Is the dictionary being used?", len(output), expectedMaxSize)
|
| /prebuilts/go/linux-x86/src/go/types/ |
| conversions.go | 2 // Use of this source code is governed by a BSD-style
12 // The result is in x.
28 // If codepoint < 0 the absolute value is too large (or unknown) for
29 // conversion. This is the same as converting any other out-of-range
67 // "x is assignable to T"
100 // "x is an integer or a slice of bytes or runes and T is a string type"
105 // "x is a string and T is a slice of bytes or runes"
129 // TODO(gri): Is this (typ.Underlying() instead of just typ) correct
[all...] |
| /prebuilts/go/linux-x86/src/runtime/ |
| os2_nacl.go | 2 // Use of this source code is governed by a BSD-style
24 // _ENOMEM is defined in mem_bsd.go for nacl.
33 _EISDIR = 21 /* Is a directory */
75 _ENONET = 64 /* Machine is not on the network */
77 _EREMOTE = 66 /* The object is remote */
109 _ENETDOWN = 100 /* Network interface is not configured */
110 _ENETUNREACH = 101 /* Network is unreachable */
115 _EISCONN = 106 /* Socket is already connected */
116 _ENOTCONN = 107 /* Socket is not connected */
121 _EHOSTDOWN = 112 /* Host is down *
[all...] |
| /prebuilts/go/linux-x86/src/runtime/race/testdata/ |
| waitgroup_test.go | 2 // Use of this source code is governed by a BSD-style
81 // Incorrect usage: Add is too late.
217 // TODO: this is actually a panic-synchronization test, not a
219 // Is it possible to get a race by synchronization via panic?
|
| /prebuilts/go/linux-x86/src/sort/ |
| search.go | 2 // Use of this source code is governed by a BSD-style
10 // in [0, n) at which f(i) is true, assuming that on the range [0, n),
11 // f(i) == true implies f(i+1) == true. That is, Search requires that
12 // f is false for some (possibly empty) prefix of the input range [0, n)
14 // the first true index. If there is no such index, Search returns n.
15 // (Note that the "not found" return value is not -1 as in, for instance,
19 // A common use of Search is to find the index i for a value x in
22 // to be searched for, and how the data structure is indexed and
28 // wants to find whether 23 is in the slice, it must test data[i] == 23
40 // // x is present at data[i
[all...] |
| /prebuilts/go/linux-x86/src/strings/ |
| example_test.go | 2 // Use of this source code is governed by a BSD-style
95 return unicode.Is(unicode.Han, c)
219 fmt.Println(r.Replace("This is <b>HTML</b>!"))
220 // Output: This is <b>HTML</b>!
|
| /prebuilts/go/linux-x86/src/unicode/ |
| example_test.go | 2 // Use of this source code is governed by a BSD-style
12 // Functions starting with "Is" can be used to inspect which table of range a
66 // is control rune
67 // is not printable rune
69 // is digit rune
70 // is graphic rune
71 // is number rune
72 // is printable rune
74 // is graphic rune
75 // is letter run
[all...] |
| letter.go | 2 // Use of this source code is governed by a BSD-style
38 // Range32 represents of a range of Unicode code points and is used when one or
52 // means the character is in the corresponding case. There is a special
67 // BUG(r): There is no mechanism for full case folding, that is, for
80 // If the Delta field of a CaseRange is UpperLower, it means
87 // linearMax is the maximum size table for linear search for non-Latin1 rune.
91 // is16 reports whether r is in the sorted slice of 16-bit ranges.
124 // is32 reports whether r is in the sorted slice of 32-bit ranges
[all...] |
| /toolchain/binutils/binutils-2.25/gas/ |
| configure.com | 8 $! This file is free software; you can redistribute it and/or modify
13 $! This program is distributed in the hope that it will be useful,
93 language is requested. */
104 /* Is the prototype for getopt in <unistd.h> in the expected format? */
|
| /external/v8/src/arm64/ |
| assembler-arm64-inl.h | 2 // Use of this source code is governed by a BSD-style license that can be
107 inline bool CPURegister::Is(const CPURegister& other) const {
256 // Default initializer is for int types
357 return reg_.Is(NoReg);
525 return (addrmode_ == Offset) && regoffset_.Is(NoReg);
530 return (addrmode_ == Offset) && !regoffset_.Is(NoReg);
589 // Call sequence on ARM64 is:
601 // The call, generated by MacroAssembler::Call, is one of two possible
614 // The return address is immediately after the blr instruction in both cases,
652 // Intuitively, we would think it is necessary to always flush th
[all...] |
| /external/v8/src/compiler/ |
| redundancy-elimination.cc | 2 // Use of this source code is governed by a BSD-style license that can be
211 // Only use the bounds checked type if it is better.
213 ->Is(NodeProperties::GetType(left))) {
276 // we would only revisit effect uses if there is change).
|
| /external/v8/src/crankshaft/arm64/ |
| lithium-gap-resolver-arm64.cc | 2 // Use of this source code is governed by a BSD-style license that can be
18 DCHECK(ScratchRegister().Is(root));
46 root_index_ = i; // Any cycle is found when we reach this move again.
70 // moves to perform, ignoring any move that is redundant (the source is
71 // the same as the destination, the destination is ignored and
93 // destination is saved in a stack allocated local. Multiple moves can
94 // be pending because this function is recursive.
107 // If there is a blocking, pending move it must be moves_[root_index_]
127 // This move is no longer blocked
[all...] |
| /external/v8/src/ |
| dateparser.h | 2 // Use of this source code is governed by a BSD-style license that can be
27 // If parsing fails, return false (content of output array is not defined).
69 // is longer.
106 bool Is(uint32_t c) const { return ch_ == c; }
255 // and 'len' is the word length.
351 // If set, ensures that data is always parsed in year-month-date order.
356 // to continue with in the legacy date string parser. If parsing is
|
| /prebuilts/devtools/tools/lib/ |
| hamcrest-core-1.3.jar | |
| /prebuilts/go/darwin-x86/src/unicode/ |
| letter.go | 2 // Use of this source code is governed by a BSD-style
38 // Range32 represents of a range of Unicode code points and is used when one or
52 // means the character is in the corresponding case. There is a special
67 // BUG(r): There is no mechanism for full case folding, that is, for
80 // If the Delta field of a CaseRange is UpperLower, it means
87 // linearMax is the maximum size table for linear search for non-Latin1 rune.
91 // is16 reports whether r is in the sorted slice of 16-bit ranges.
124 // is32 reports whether r is in the sorted slice of 32-bit ranges
[all...] |
| /prebuilts/misc/common/robolectric/lib/ |
| hamcrest-core-1.3.jar | |
| /prebuilts/tools/common/m2/repository/org/hamcrest/hamcrest-core/1.3/ |
| hamcrest-core-1.3.jar | |
| /external/vixl/src/aarch64/ |
| operands-aarch64.h | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS CONTRIBUTORS "AS IS" AND
49 // The kInvalid value is used to detect uninitialized static instances,
136 // This assert is hit when the register has not been properly initialized.
173 bool Is(const CPURegister& other) const {
435 // No*Reg is used to indicate an unused argument, or an error case. Note that
436 // these all compare equal (using the Is() method). The Register and VRegister
593 // the type and size of the register is inferred from this list.
737 // where <immediate> is int64_t.
738 // This is allowed to be an implicit constructor because Operand i
[all...] |
| /external/v8/src/compiler/s390/ |
| instruction-selector-s390.cc | 2 // Use of this source code is governed by a BSD-style license that can be
361 // // zero-extension is a no-op.
474 // to achieve that is to declare the output register as same-as-first.
543 // left is always register
609 // to achieve that is to declare the output register as same-as-first.
780 // Architecture supports unaligned access, therefore VisitLoad is used instead
783 // Architecture supports unaligned access, therefore VisitStore is used instead
[all...] |
| /external/v8/src/compiler/ia32/ |
| instruction-selector-ia32.cc | 2 // Use of this source code is governed by a BSD-style license that can be
365 // Architecture supports unaligned access, therefore VisitLoad is used instead
368 // Architecture supports unaligned access, therefore VisitStore is used instead
612 if (m.right().Is(-1)) {
729 // The high word of the result is not used, so we emit the standard 32 bit
754 // The high word of the result is not used, so we emit the standard 32 bit
781 // The high word of the result is not used, so we emit the standard 32 bit
[all...] |
| /external/v8/src/compiler/x87/ |
| instruction-selector-x87.cc | 2 // Use of this source code is governed by a BSD-style license that can be
326 // Architecture supports unaligned access, therefore VisitLoad is used instead
329 // Architecture supports unaligned access, therefore VisitStore is used instead
525 if (m.right().Is(-1)) {
642 // The high word of the result is not used, so we emit the standard 32 bit
667 // The high word of the result is not used, so we emit the standard 32 bit
694 // The high word of the result is not used, so we emit the standard 32 bit
801 if (m.left().Is(0)) {
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | 5 // This file is distributed under the University of Illinois Open Source
13 // Matches(...) which is a predicate on an AST node. The Matches method's
23 // everywhere a Matcher<Derived> is required.
132 /// Returns NULL if there was no node bound to \c ID or if there is a node but
183 /// The tree builder is used during the matching process to insert the bound
310 /// It is constructed from a \c Matcher<T> object and redirects most calls to
312 /// It checks whether the \c DynTypedNode is convertible into the type of the
314 /// return false if it is not convertible.
347 /// It only checks that the node is of the right kind.
367 /// It is faster, but the caller must ensure the node is valid for th
[all...] |
| /external/hamcrest/hamcrest-library/src/main/java/org/hamcrest/ |
| Matchers.java | 184 * <pre>assertThat(cheese, is(equalTo(smelly)))</pre>
188 public static <T> org.hamcrest.Matcher<T> is(org.hamcrest.Matcher<T> matcher) { method in class:Matchers
189 return org.hamcrest.core.Is.<T>is(matcher);
193 * A shortcut to the frequently used <code>is(equalTo(x))</code>.
195 * <pre>assertThat(cheese, is(smelly))</pre>
197 * <pre>assertThat(cheese, is(equalTo(smelly)))</pre>
199 public static <T> org.hamcrest.Matcher<T> is(T value) { method in class:Matchers
200 return org.hamcrest.core.Is.<T>is(value)
216 public static void is(java.lang.Class<?> type) { method in class:Matchers
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | 5 // This file is distributed under the University of Illinois Open Source
13 // Matches(...) which is a predicate on an AST node. The Matches method's
23 // everywhere a Matcher<Derived> is required.
132 /// Returns NULL if there was no node bound to \c ID or if there is a node but
183 /// The tree builder is used during the matching process to insert the bound
310 /// It is constructed from a \c Matcher<T> object and redirects most calls to
312 /// It checks whether the \c DynTypedNode is convertible into the type of the
314 /// return false if it is not convertible.
347 /// It only checks that the node is of the right kind.
367 /// It is faster, but the caller must ensure the node is valid for th
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | 5 // This file is distributed under the University of Illinois Open Source
13 // Matches(...) which is a predicate on an AST node. The Matches method's
23 // everywhere a Matcher<Derived> is required.
132 /// Returns NULL if there was no node bound to \c ID or if there is a node but
183 /// The tree builder is used during the matching process to insert the bound
310 /// It is constructed from a \c Matcher<T> object and redirects most calls to
312 /// It checks whether the \c DynTypedNode is convertible into the type of the
314 /// return false if it is not convertible.
347 /// It only checks that the node is of the right kind.
367 /// It is faster, but the caller must ensure the node is valid for th
[all...] |
