Package com.google.gwt.core.ext.soyc

Examples of com.google.gwt.core.ext.soyc.Range

329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
   * process.
   */
  private void popAndRecord(Stack<RangeInfo> dependencyScope, int fragment)
      throws IOException {
    RangeInfo rangeInfo = dependencyScope.pop();
    Range toStore = rangeInfo.range;

    /*
     * Make a new Range for the gap between the popped Range and whatever we
     * last stored.
     */
    if (lastEnd < toStore.getStart()) {
      Range newRange = new Range(lastEnd, toStore.getStart());
      assert !dependencyScope.isEmpty();

      SourceInfo gapInfo = dependencyScope.peek().info;
      recordStory(gapInfo, fragment, newRange.length(), newRange);

      lastEnd += newRange.length();
    }

    /*
     * Store as much of the current Range as we haven't previously stored. The
     * Max.max() is there to take care of the tail end of Ranges that have had a
     * sub-range previously stored.
     */
    if (lastEnd < toStore.getEnd()) {
      Range newRange = new Range(Math.max(lastEnd, toStore.getStart()),
          toStore.getEnd());
      recordStory(rangeInfo.info, fragment, newRange.length(), newRange);
      lastEnd += newRange.length();
    }
  }
View Full Code Here
49
50
51
52
53
54
55
56
57
    boolean addEntry = node instanceof HasSourceInfo;
    int start = addEntry ? out.getPosition() : 0;
    T toReturn = super.doAccept(node);
    if (addEntry) {
      SourceInfo info = ((HasSourceInfo) node).getSourceInfo();
      sourceInfoMap.put(new Range(start, out.getPosition()), info);
    }
    return toReturn;
  }
View Full Code Here
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
   * process.
   */
  private void popAndRecord(Stack<RangeInfo> dependencyScope, int fragment)
      throws IOException {
    RangeInfo rangeInfo = dependencyScope.pop();
    Range toStore = rangeInfo.range;

    /*
     * Make a new Range for the gap between the popped Range and whatever we
     * last stored.
     */
    if (lastEnd < toStore.getStart()) {
      Range newRange = new Range(lastEnd, toStore.getStart());
      assert !dependencyScope.isEmpty();

      SourceInfo gapInfo = dependencyScope.peek().info;
      recordStory(gapInfo, fragment, newRange.length(), newRange);

      lastEnd += newRange.length();
    }

    /*
     * Store as much of the current Range as we haven't previously stored. The
     * Max.max() is there to take care of the tail end of Ranges that have had a
     * sub-range previously stored.
     */
    if (lastEnd < toStore.getEnd()) {
      Range newRange = new Range(Math.max(lastEnd, toStore.getStart()),
          toStore.getEnd());
      recordStory(rangeInfo.info, fragment, newRange.length(), newRange);
      lastEnd += newRange.length();
    }
  }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
    lastTypeEndPosition = typeEndPosition;

    List<Range> extractedRanges = Lists.newArrayList();

    while (!ranges.isEmpty()) {
      Range range = ranges.getFirst();
      if (range.getStart() < typeStartPosition || range.getStart() >= typeEndPosition) {
        break;
      }
      if (range.getEnd() <= typeStartPosition || range.getEnd() > typeEndPosition) {
        break;
      }

      ranges.removeFirst();

      // Normalize range position relative to the beginning of the type that contains it.
      Range typeOffsetNormalizedRange =
          range.createNormalizedCopy(typeStartPosition, typeStartLineNumber);
      extractedRanges.add(typeOffsetNormalizedRange);
    }

    int typeBytes = typeEndPosition - typeStartPosition;
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
  private void skipTo(int rangeEndPosition) {
    assert lastTypeEndPosition <= rangeEndPosition : "You can only skip forward.";

    while (!ranges.isEmpty()) {
      Range range = ranges.getFirst();

      if (range.getStart() >= rangeEndPosition) {
        break;
      }
      if (range.getEnd() > rangeEndPosition) {
        break;
      }

      ranges.removeFirst();
    }
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
  private final List<Range> ranges = Lists.newArrayList();
  private int lines;

  public void append(JsSourceMap jsSourceMap) {
    for (Range normalizedRange : jsSourceMap.getRanges()) {
      Range offsetRange = normalizedRange.createOffsetCopy(bytes, lines);
      ranges.add(offsetRange);
    }
    bytes += jsSourceMap.getBytes();
    lines += jsSourceMap.getLines();
  }
View Full Code Here
148
149
150
151
152
153
154
155
156
157
158
      JsSourceMapBuilder jsSourceMapBuilder, String statement) {
    String typeName =
        statement.replace(" />", "").replace("<", "").replace(">", "").replace("\n", "");

    statementRangesBuilder.addStartPosition(sb.length());
    List<Range> ranges = Lists.newArrayList(new Range(0, statement.length(), lines, 0, lines + 1,
        statement.length(), SourceOrigin.create(0, statement.length(), 0, typeName)));
    jsSourceMapBuilder.append(new JsSourceMap(ranges, statement.length(), 1));
    sb.append(statement);
    statementRangesBuilder.addEndPosition(sb.length());
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
      return toReturn;
    }
    parentStack.remove(parentStack.size() - 1);

    SourceInfo info = ((JsNode) node).getSourceInfo();
    Range range = new Range(beforePosition, out.getPosition(), beforeLine, beforeColumn,
        out.getLine(), out.getColumn(), info);

    if (out.getPosition() <= beforePosition || beforeLine < 0 || out.getLine() < 0) {
      // Skip bogus entries.
      // JavaClassHierarchySetupUtil:prototypesByTypeId is pruned here. Maybe others too?
View Full Code Here
160
161
162
163
164
165
166
167
168
169
170
171
172
  @Override
  protected void billChildToHere() {
    if (previousRange != null && previousRange.getEnd() < out.getPosition()) {
      // Expand overlapping range.
      Range expandedRange =
          previousRange.withNewEnd(out.getPosition(), out.getLine(), out.getColumn());
      Range removedRange = ranges.removeLast();
      assert removedRange == previousRange;
      ranges.add(expandedRange);
      previousRange = expandedRange;
    }
  }
View Full Code Here
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
   * the right length, possibly sub-dividing the super-enclosing Range in the
   * process.
   */
  private void popAndRecord(Stack<RangeInfo> dependencyScope, int fragment) throws IOException {
    RangeInfo rangeInfo = dependencyScope.pop();
    Range toStore = rangeInfo.range;

    /*
     * Make a new Range for the gap between the popped Range and whatever we
     * last stored.
     */
    if (lastEnd < toStore.getStart()) {
      Range newRange = new Range(lastEnd, toStore.getStart());
      assert !dependencyScope.isEmpty();

      SourceInfo gapInfo = dependencyScope.peek().info;
      recordStory(gapInfo, fragment, newRange.length(), newRange);

      lastEnd += newRange.length();
    }

    /*
     * Store as much of the current Range as we haven't previously stored. The
     * Max.max() is there to take care of the tail end of Ranges that have had a
     * sub-range previously stored.
     */
    if (lastEnd < toStore.getEnd()) {
      Range newRange = new Range(Math.max(lastEnd, toStore.getStart()), toStore.getEnd());
      recordStory(rangeInfo.info, fragment, newRange.length(), newRange);
      lastEnd += newRange.length();
    }
  }
View Full Code Here
TOP

Related Classes of com.google.gwt.core.ext.soyc.Range

  • com.google.gwt.core.ext.linker.impl.JsSourceMapBuilder
  • com.google.gwt.core.ext.linker.impl.JsSourceMapExtractor
  • com.google.gwt.core.ext.soyc.impl.StoryRecorder
  • com.google.gwt.dev.jjs.impl.JsFunctionClusterer
  • com.google.gwt.dev.jjs.impl.JsTypeLinkerTest
  • com.google.gwt.dev.js.JsReportGenerationVisitor
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.