Package org.wicketstuff.pageserializer.common.analyze

Examples of org.wicketstuff.pageserializer.common.analyze.ImmutableTree

116
117
118
119
120
121
122
    {
      List<ISerializedObjectTree> list=new ArrayList<ISerializedObjectTree>();
      for (IndentedLines il : children) {
        list.add(il.asObjectTree());
      }
      return new ImmutableTree(null, line.type, line.label, line.size, list);
    }
View Full Code Here
140
141
142
143
144
145
146
      List<ISerializedObjectTree> items = new ArrayList<ISerializedObjectTree>();
      for (Builder b : children)
      {
        items.add(b.buildTree());
      }
      return new ImmutableTree(id, type, label, size, items);
    }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
public class SimilarNodeTreeTransformatorTest
{ 
  @Test
  public void dontChangeAnything()
  {
    ImmutableTree source = new ImmutableTree(new ObjectId(1), Root.class, "root", 10,
      noChildren());

    ISerializedObjectTree result = SimilarNodeTreeTransformator.transformTree(source);

    ImmutableTree expected = new ImmutableTree(new ObjectId(1), Root.class, "root", 10,
      noChildren());

    Trees.assertEqualsTree(expected, result);
  }
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
  }

  @Test
  public void compressSubNodes()
  {
    ImmutableTree source = new ImmutableTree(new ObjectId(1), Root.class, "root", 10,
      sameChildren5Times());

    ISerializedObjectTree result = SimilarNodeTreeTransformator.transformTree(source);

    List<ISerializedObjectTree> oneSubNode = new ArrayList<>();
    List<ISerializedObjectTree> threeSubNodes = new ArrayList<>();
    threeSubNodes.add(new ImmutableTree(null, A.class, "a", 15, noChildren()));
    threeSubNodes.add(new ImmutableTree(null, B.class, "b", 20, noChildren()));
    threeSubNodes.add(new ImmutableTree(null, C.class, "c", 25, noChildren()));
    oneSubNode.add(new ImmutableTree(null, Has3.class, "has3-0|has3-1|has3-2|has3-3|has3-4",
      50, threeSubNodes));
    ImmutableTree expected = new ImmutableTree(new ObjectId(1), Root.class, "root", 10,
      oneSubNode);

    Trees.assertEqualsTree(expected, result);
  }
View Full Code Here
108
109
110
111
112
113
114
115
116
117
  private List<? extends ISerializedObjectTree> sameChildren5Times()
  {
    List<ISerializedObjectTree> ret = new ArrayList<>();
    for (int i = 0; i < 5; i++)
    {
      ret.add(new ImmutableTree(new ObjectId(10 + i), Has3.class, "has3-" + i, 10,
        differentChildren(i)));
    }
    return ret;
  }
View Full Code Here
117
118
119
120
121
122
123
124
125
126
  }

  private List<? extends ISerializedObjectTree> differentChildren(int idx)
  {
    List<ISerializedObjectTree> ret = new ArrayList<>();
    ret.add(new ImmutableTree(new ObjectId(100 + idx + 1), A.class, "a", 3, noChildren()));
    ret.add(new ImmutableTree(new ObjectId(100 + idx + 2), B.class, "b", 4, noChildren()));
    ret.add(new ImmutableTree(new ObjectId(100 + idx + 3), C.class, "c", 5, noChildren()));
    return ret;
  }
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
          }
        }

        if (changed)
        {
          return new ImmutableTree(source.id(),source.type(), source.label(), source.size(),
            filteredList);
        }
      }
      return source;
    }
    else
    {
      return new ImmutableTree(source.id(),source.type(), source.label(), source.size() +
        source.childSize(), new ArrayList<ISerializedObjectTree>());
    }
  }
View Full Code Here
136
137
138
139
140
141
142
143
144
145
      }
    }

    if (changed)
    {
      return new ImmutableTree(source.id(),source.type(), source.label(), source.size() + localSize,
        filteredList);
    }
    return source;
  }
View Full Code Here
88
89
90
91
92
93
94
    int size = 0;
    for (ISerializedObjectTree t : list) {
      size = size + t.size();
    }

    return new ImmutableTree(null, type, label, size, compressedChildren(list));
  }
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
      if (typeMap.hasLessEntries(transformed.size()))
      {
//        LOG.error("Compress {}",tree.type());
       
        List<ISerializedObjectTree> result = typeMap.compressedResult();
        ret = new ImmutableTree(ret.id(), ret.type(), ret.label(), ret.size(), result);
//        new TreeSizeReport().process(tree);
//        new TreeSizeReport().process(ret);
      } else {
        if (!sameEntries(tree.children(), transformed)) {
          ret = new ImmutableTree(ret.id(), ret.type(), ret.label(), ret.size(), transformed);
        }
      }
    }
    return ret;
  }
View Full Code Here
TOP

Related Classes of org.wicketstuff.pageserializer.common.analyze.ImmutableTree

  • org.wicketstuff.pageserializer.common.analyze.report.SimilarNodeTreeTransformator
  • org.wicketstuff.pageserializer.common.analyze.report.SimilarNodeTreeTransformatorTest
  • org.wicketstuff.pageserializer.common.analyze.report.TreeReader$IndentedLines
  • org.wicketstuff.pageserializer.common.analyze.report.Trees$Builder
  • org.wicketstuff.pageserializer.common.analyze.report.TreeTransformations
  • org.wicketstuff.pageserializer.common.analyze.report.TreeTypeMap
    • 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.