HomeSort by relevance Sort by last modified time
    Searched refs:ToArray (Results 1 - 25 of 68) sorted by null

1 2 3

  /external/llvm/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/
edit_distance.h 29 /// \param ToArray the second sequence to compare.
43 unsigned ComputeEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray,
59 typename ArrayRef<T>::size_type n = ToArray.size();
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
  /external/pdfium/core/fpdfdoc/
cpdf_dest.cpp 42 CPDF_Array* pArray = ToArray(m_pObj.Get());
57 CPDF_Array* pArray = ToArray(m_pObj.Get());
72 CPDF_Array* pArray = ToArray(m_pObj.Get());
99 CPDF_Array* pArray = ToArray(m_pObj.Get());
137 CPDF_Array* pArray = ToArray(m_pObj.Get());
147 CPDF_Array* pArray = ToArray(m_pObj.Get());
  /external/pdfium/fxjs/
fxjs_v8_embeddertest.cpp 89 EXPECT_TRUE(engine()->ToArray(empty).IsEmpty());
103 EXPECT_TRUE(engine()->ToArray(nullz).IsEmpty());
117 EXPECT_TRUE(engine()->ToArray(undef).IsEmpty());
131 EXPECT_TRUE(engine()->ToArray(boolz).IsEmpty());
145 EXPECT_TRUE(engine()->ToArray(num).IsEmpty());
159 EXPECT_TRUE(engine()->ToArray(str).IsEmpty());
173 EXPECT_TRUE(engine()->ToArray(date).IsEmpty());
200 EXPECT_TRUE(engine()->ToArray(array)->IsArray());
227 EXPECT_TRUE(engine()->ToArray(object).IsEmpty());
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.JavaExtensions/
StringTokenizer.cs 52 _tokens = EnumerableExtensions.ToArray(EnumerableExtensions.SelectMany(_tokens, delegate(string token, int i)
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
ExceptionExtensions.cs 58 frames = new StackTrace( true ).GetFrames().Skip( 1 ).ToArray();
SetExtensions.cs 83 public static T[] toArray<T>( this HashSet<T> set )
85 return set.ToArray();
StringTokenizer.cs 73 } ).ToArray();
  /external/pdfium/core/fpdfapi/parser/
cpdf_array.h 118 inline CPDF_Array* ToArray(CPDF_Object* obj) {
122 inline const CPDF_Array* ToArray(const CPDF_Object* obj) {
126 inline std::unique_ptr<CPDF_Array> ToArray(std::unique_ptr<CPDF_Object> obj) {
127 CPDF_Array* pArray = ToArray(obj.get());
  /test/vts-testcase/fuzz/iface_fuzzer/include/
ProtoFuzzerUtils.h 99 size_t ToArray(uint8_t *, size_t, ExecSpec *);
  /external/brotli/csharp/org/brotli/dec/
DecodeTest.cs 49 return output.ToArray();
69 return output.ToArray();

Completed in 1338 milliseconds

1 2 3