Package com.mxgraph.layout.hierarchical.model

Examples of com.mxgraph.layout.hierarchical.model.mxGraphHierarchyRank.toArray()

274
275
276
277
278
279
280
281
282
283
284
    mxGraphAbstractHierarchyCell[][] rank = new mxGraphAbstractHierarchyCell[model.maxRank + 1][];

    for (int i = 0; i <= model.maxRank; i++)
    {
      mxGraphHierarchyRank rankSet = model.ranks.get(new Integer(i));
      rank[i] = rankSet.toArray(new mxGraphAbstractHierarchyCell[rankSet
          .size()]);

      for (int j = 0; j < rank[i].length; j++)
      {
        // Use the weight to store the rank and visited to store whether
View Full Code Here
482
483
484
485
486
487
488
489
490
491
492
   */
  protected void rankMedianPosition(int rankValue,
      mxGraphHierarchyModel model, int nextRankValue)
  {
    mxGraphHierarchyRank rankSet = model.ranks.get(new Integer(rankValue));
    Object[] rank = rankSet.toArray();
    // Form an array of the order in which the cells are to be processed
    // , the order is given by the weighted sum of the in or out edges,
    // depending on whether we're travelling up or down the hierarchy.
    WeightedCellSorter[] weightedValues = new WeightedCellSorter[rank.length];
    Map<mxGraphAbstractHierarchyCell, WeightedCellSorter> cellMap = new Hashtable<mxGraphAbstractHierarchyCell, WeightedCellSorter>(
View Full Code Here
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
   */
  protected boolean repositionValid(mxGraphHierarchyModel model,
      mxGraphAbstractHierarchyCell cell, int rank, double position)
  {
    mxGraphHierarchyRank rankSet = model.ranks.get(new Integer(rank));
    mxGraphAbstractHierarchyCell[] rankArray = rankSet
        .toArray(new mxGraphAbstractHierarchyCell[rankSet.size()]);
    int rankIndex = -1;

    for (int i = 0; i < rankArray.length; i++)
    {
View Full Code Here
340
341
342
343
344
345
346
347
348
349
350
    mxGraphAbstractHierarchyCell[][] rank = new mxGraphAbstractHierarchyCell[model.maxRank + 1][];

    for (int i = 0; i <= model.maxRank; i++)
    {
      mxGraphHierarchyRank rankSet = model.ranks.get(new Integer(i));
      rank[i] = rankSet.toArray(new mxGraphAbstractHierarchyCell[rankSet
          .size()]);

      for (int j = 0; j < rank[i].length; j++)
      {
        // Use the weight to store the rank and visited to store whether
View Full Code Here
548
549
550
551
552
553
554
555
556
557
558
   */
  protected void rankMedianPosition(int rankValue,
      mxGraphHierarchyModel model, int nextRankValue)
  {
    mxGraphHierarchyRank rankSet = model.ranks.get(new Integer(rankValue));
    Object[] rank = rankSet.toArray();
    // Form an array of the order in which the cells are to be processed
    // , the order is given by the weighted sum of the in or out edges,
    // depending on whether we're travelling up or down the hierarchy.
    WeightedCellSorter[] weightedValues = new WeightedCellSorter[rank.length];
    Map<mxGraphAbstractHierarchyCell, WeightedCellSorter> cellMap = new Hashtable<mxGraphAbstractHierarchyCell, WeightedCellSorter>(
View Full Code Here
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
   */
  protected boolean repositionValid(mxGraphHierarchyModel model,
      mxGraphAbstractHierarchyCell cell, int rank, double position)
  {
    mxGraphHierarchyRank rankSet = model.ranks.get(new Integer(rank));
    mxGraphAbstractHierarchyCell[] rankArray = rankSet
        .toArray(new mxGraphAbstractHierarchyCell[rankSet.size()]);
    int rankIndex = -1;

    for (int i = 0; i < rankArray.length; i++)
    {
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
    for (int i = 0; i < nestedBestRanks.length; i++)
    {
      mxGraphHierarchyRank rank = model.ranks.get(new Integer(i));
      nestedBestRanks[i] = new mxGraphAbstractHierarchyCell[rank.size()];
      rank.toArray(nestedBestRanks[i]);
    }

    iterationsWithoutImprovement = 0;
    currentBestCrossings = calculateCrossings(model);
View Full Code Here
274
275
276
277
278
279
280
281
282
283
284
    mxGraphAbstractHierarchyCell[][] rank = new mxGraphAbstractHierarchyCell[model.maxRank + 1][];

    for (int i = 0; i <= model.maxRank; i++)
    {
      mxGraphHierarchyRank rankSet = model.ranks.get(new Integer(i));
      rank[i] = rankSet.toArray(new mxGraphAbstractHierarchyCell[rankSet
          .size()]);

      for (int j = 0; j < rank[i].length; j++)
      {
        // Use the weight to store the rank and visited to store whether
View Full Code Here
482
483
484
485
486
487
488
489
490
491
492
   */
  protected void rankMedianPosition(int rankValue,
      mxGraphHierarchyModel model, int nextRankValue)
  {
    mxGraphHierarchyRank rankSet = model.ranks.get(new Integer(rankValue));
    Object[] rank = rankSet.toArray();
    // Form an array of the order in which the cells are to be processed
    // , the order is given by the weighted sum of the in or out edges,
    // depending on whether we're travelling up or down the hierarchy.
    WeightedCellSorter[] weightedValues = new WeightedCellSorter[rank.length];
    Map<mxGraphAbstractHierarchyCell, WeightedCellSorter> cellMap = new Hashtable<mxGraphAbstractHierarchyCell, WeightedCellSorter>(
View Full Code Here
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
   */
  protected boolean repositionValid(mxGraphHierarchyModel model,
      mxGraphAbstractHierarchyCell cell, int rank, double position)
  {
    mxGraphHierarchyRank rankSet = model.ranks.get(new Integer(rank));
    mxGraphAbstractHierarchyCell[] rankArray = rankSet
        .toArray(new mxGraphAbstractHierarchyCell[rankSet.size()]);
    int rankIndex = -1;

    for (int i = 0; i < rankArray.length; i++)
    {
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.