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

1 2 3

  /external/regex-re2/re2/testing/
exhaustive1_test.cc 16 vector<string> ops = Split(" ",
28 vector<string> ops = Split(" ",
32 ExhaustiveTest(3, 2, Split(" ", "a (a) b"), ops,
37 ExhaustiveTest(4, 3, Split(" ", "a (a)"), ops,
exhaustive2_test.cc 17 ExhaustiveTest(2, 2, Split(" ", "(?:) a"),
19 5, Split("", "ab"), "", "");
36 ExhaustiveTest(2, 2, Split(" ", "(?:^) (?:$) . a \\n (?:\\A) (?:\\z)"),
64 // ExhaustiveTest(1, 1, Split(" ", "\\n . a [^a]"),
exhaustive3_test.cc 14 vector<string> atoms = Split(" ",
22 vector<string> atoms = Split(" ",
67 vector<string> atoms = Split(" ",
80 vector<string> atoms = Split(" ",
random_test.cc 60 RandomTest(5, 5, Split(" ", "a (b) ."), RegexpGenerator::EgrepOps(),
68 RandomTest(10, 10, Split(" ", "a (b) ."), RegexpGenerator::EgrepOps(),
78 vector<string> ops = Split(" ",
86 vector<string> atoms = Split(" ",
regexp_generator.h 66 vector<string> Split(const StringPiece& sep, const StringPiece& s);
exhaustive_tester.cc 179 Split("", alphabet),
182 Split("", stralphabet),
possible_match_test.cc 232 PossibleMatchTester t(natom, noperator, Split(" ", "a b [0-9]"),
  /external/llvm/lib/TableGen/
StringMatcher.cpp 57 std::pair<StringRef, StringRef> Split = Code.split('\n');
58 OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n";
60 Code = Split.second;
62 Split = Code.split('\n');
63 OS << Indent << Split.first << "\n";
64 Code = Split.second;
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/JavaExtensions/
ExceptionExtensions.cs 44 foreach ( string line in trace.Split( '\n', '\r' ) )
  /external/llvm/include/llvm/ADT/
DeltaAlgorithm.h 55 /// Split - Partition a set of changes \p S into one or two subsets.
56 void Split(const changeset_ty &S, changesetlist_ty &Res);
  /external/llvm/lib/Support/
DeltaAlgorithm.cpp 28 void DeltaAlgorithm::Split(const changeset_ty &S, changesetlist_ty &Res) {
62 Split(*it, SplitSets);
78 Split(*it, Sets);
111 Split(Changes, Sets);
Regex.cpp 114 std::pair<StringRef, StringRef> Split = Repl.split('\\');
117 Res += Split.first;
120 if (Split.second.empty()) {
121 if (Repl.size() != Split.first.size() &&
128 Repl = Split.second;
  /external/jsilver/src/com/google/clearsilver/jsilver/data/
DefaultHdfParser.java 54 Split split; local
55 if ((split = split(line, "=")) != null) {
57 output.setValue(createFullPath(context, split.left), split.right);
58 } else if ((split = split(line, "<<")) != null) {
63 output.setValue(createFullPath(context, split.left), readToToken(lineReader, split.right))
120 private Split split(String line, String delimiter) { method in class:DefaultHdfParser
    [all...]
  /external/llvm/lib/IR/
DataLayout.cpp 179 /// Checked version of split, to ensure mandatory subparts.
180 static std::pair<StringRef, StringRef> split(StringRef Str, char Separator) { function
182 std::pair<StringRef, StringRef> Split = Str.split(Separator);
183 assert((!Split.second.empty() || Split.first == Str) &&
185 return Split;
206 // Split at '-'.
207 std::pair<StringRef, StringRef> Split = split(Desc, '-')
    [all...]
  /external/clang/lib/Rewrite/Core/
DeltaTree.cpp 57 SourceDelta Split;
104 /// split the node, populate InsertRes with info about the split, and return
136 Values[0] = IR.Split;
137 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta;
177 /// split the node, populate InsertRes with info about the split, and return
213 // Otherwise, if this is leaf is full, split the node at its median, insert
218 if (InsertRes->Split.FileLoc > FileIndex)
230 // Okay, this split the subtree, producing a new value and two children t
    [all...]
  /external/llvm/include/llvm/Target/
TargetCallingConv.h 41 static const uint64_t Split = 1ULL << 10;
81 bool isSplit() const { return Flags & Split; }
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.JavaExtensions/
ExceptionExtensions.cs 76 foreach (string line in trace.Split('\n', '\r')) {
StringTokenizer.cs 48 _tokens = str.Split( separator.ToCharArray(), StringSplitOptions.None );
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
ExceptionExtensions.cs 85 foreach ( string line in trace.Split( '\n', '\r' ) )
StringTokenizer.cs 49 _tokens = str.Split( separator.ToCharArray(), StringSplitOptions.None );
  /external/llvm/lib/Transforms/IPO/
LoopExtractor.cpp 226 // 'invoke', then we want to split the landing pad.
227 bool Split = false;
233 Split = true;
238 if (!Split) continue;
  /external/harfbuzz/src/
harfbuzz-indic.cpp 484 Split,
556 Pre, None, None, Split,
557 Split, Below, None, None,
679 Split, None, None, Split,
680 Split, None, None, None,
720 Pre, None, Split, Split,
721 Split, Halant, None, None,
761 Split, None, Post, Above
1091 const unsigned short *split = split_matras; local
    [all...]
  /external/harfbuzz_ng/src/hb-old/
harfbuzz-indic.cpp 484 Split,
556 Pre, None, None, Split,
557 Split, Below, None, None,
679 Split, None, None, Split,
680 Split, None, None, None,
720 Pre, None, Split, Split,
721 Split, Halant, None, None,
761 Split, None, Post, Above
1091 const unsigned short *split = split_matras; local
    [all...]
  /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/String/
15.5.4.8-3.js 24 ECMA Section: 15.5.4.8 String.prototype.split( separator )
33 As a special case, if the separator is the empty string, the string is split
40 When the split method is called with one argument separator, the following steps are taken:
72 Note that the split function is intentionally generic; it does not require that its this value be a String
82 var TITLE = "String.prototype.split";
99 "var s = new String(); s.split().length",
101 eval("var s = new String(); s.split().length") );
104 "var s = new String(); s.split()[0]",
106 eval("var s = new String(); s.split()[0]") );
111 "var s = new String(); s.split('').length"
    [all...]
  /external/llvm/tools/macho-dump/
macho-dump.cpp 378 std::pair<StringRef,StringRef> Split = Data.split('\0');
380 outs().write_escaped(Split.first);
382 Data = Split.second;

Completed in 1178 milliseconds

1 2 3