Package com.badlogic.gdx.utils

Examples of com.badlogic.gdx.utils.Array

318
319
320
321
322
323
324
325
326
327
328
329
  }

  /** Returns all regions with the specified name, ordered by smallest to largest {@link AtlasRegion#index index}. This method
   * uses string comparison to find the regions, so the result should be cached rather than calling this method multiple times. */
  public Array<AtlasRegion> findRegions (String name) {
    Array<AtlasRegion> matched = new Array();
    for (int i = 0, n = regions.size; i < n; i++) {
      AtlasRegion region = regions.get(i);
      if (region.name.equals(name)) matched.add(new AtlasRegion(region));
    }
    return matched;
  }
View Full Code Here
330
331
332
333
334
335
336
337
338
339
  /** Returns all regions in the atlas as sprites. This method creates a new sprite for each region, so the result should be
   * stored rather than calling this method multiple times.
   * @see #createSprite(String) */
  public Array<Sprite> createSprites () {
    Array sprites = new Array(regions.size);
    for (int i = 0, n = regions.size; i < n; i++)
      sprites.add(newSprite(regions.get(i)));
    return sprites;
  }
View Full Code Here
365
366
367
368
369
370
371
372
373
374
375
376
  /** Returns all regions with the specified name as sprites, ordered by smallest to largest {@link AtlasRegion#index index}. This
   * method uses string comparison to find the regions and constructs new sprites, so the result should be cached rather than
   * calling this method multiple times.
   * @see #createSprite(String) */
  public Array<Sprite> createSprites (String name) {
    Array<Sprite> matched = new Array();
    for (int i = 0, n = regions.size; i < n; i++) {
      AtlasRegion region = regions.get(i);
      if (region.name.equals(name)) matched.add(newSprite(region));
    }
    return matched;
  }
View Full Code Here
36
37
38
39
40
41
42
  private final Array<ParticleEmitter> emitters;
  private BoundingBox bounds;
  private boolean ownsTexture;

  public ParticleEffect () {
    emitters = new Array(8);
  }
View Full Code Here
40
41
42
43
44
45
46
47
48
  public ParticleEffect () {
    emitters = new Array(8);
  }

  public ParticleEffect (ParticleEffect effect) {
    emitters = new Array(true, effect.emitters.size);
    for (int i = 0, n = effect.emitters.size; i < n; i++)
      emitters.add(new ParticleEmitter(effect.emitters.get(i)));
  }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
55
    cellWidth += settings.paddingX;
    cellHeight += settings.paddingY;

    inputRects.reverse();

    Array<Page> pages = new Array();
    while (inputRects.size > 0) {
      Page result = packPage(inputRects, cellWidth, cellHeight);
      pages.add(result);
    }
    return pages;
  }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
    return pages;
  }

  private Page packPage (Array<Rect> inputRects, int cellWidth, int cellHeight) {
    Page page = new Page();
    page.outputRects = new Array();

    int maxWidth = settings.maxWidth, maxHeight = settings.maxHeight;
    if (settings.edgePadding) {
      maxWidth -= settings.paddingX;
      maxHeight -= settings.paddingY;
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
80
          }
        });
      }
    }

    Array<Page> pages = new Array();
    while (inputRects.size > 0) {
      Page result = packPage(inputRects);
      pages.add(result);
      inputRects = result.remainingRects;
    }
    return pages;
  }
View Full Code Here
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
      maxRects.init(width, height);
      Page result;
      if (!settings.fast) {
        result = maxRects.pack(inputRects, methods[i]);
      } else {
        Array<Rect> remaining = new Array();
        for (int ii = 0, nn = inputRects.size; ii < nn; ii++) {
          Rect rect = inputRects.get(ii);
          if (maxRects.insert(rect, methods[i]) == null) {
            while (ii < nn)
              remaining.add(inputRects.get(ii++));
          }
        }
        result = maxRects.getResult();
        result.remainingRects = remaining;
      }
View Full Code Here
283
284
285
286
287
288
289
290
291
292
293
      return bestNode;
    }

    /** For each rectangle, packs each one then chooses the best and packs that. Slow! */
    public Page pack (Array<Rect> rects, FreeRectChoiceHeuristic method) {
      rects = new Array(rects);
      while (rects.size > 0) {
        int bestRectIndex = -1;
        Rect bestNode = new Rect();
        bestNode.score1 = Integer.MAX_VALUE;
        bestNode.score2 = Integer.MAX_VALUE;
View Full Code Here
TOP

Related Classes of com.badlogic.gdx.utils.Array

  • com.badlogic.gdx.assets.AssetManager
  • com.badlogic.gdx.assets.loaders.ParticleEffectLoader
  • com.badlogic.gdx.assets.loaders.SkinLoader
  • com.badlogic.gdx.backends.jglfw.JglfwApplicationConfiguration
  • com.badlogic.gdx.backends.jglfw.JglfwGraphics
  • com.badlogic.gdx.graphics.g2d.ParticleEffect
  • com.badlogic.gdx.graphics.g2d.TextureAtlas
  • com.badlogic.gdx.scenes.scene2d.ui.Table
  • com.badlogic.gdx.scenes.scene2d.ui.Table$TableDebug
  • com.badlogic.gdx.scenes.scene2d.ui.tablelayout.LibgdxToolkit
    • 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.