mirror of
https://git.huckle.dev/Huckles-Minecraft-Archive/jpexs-decompiler.git
synced 2026-06-22 05:25:33 +00:00
spelling: occurrence
Signed-off-by: Josh Soref <2119212+jsoref@users.noreply.github.com>
This commit is contained in:
committed by
Jindra Petřík
parent
e137fdbca1
commit
3677bceeb6
@@ -5261,7 +5261,7 @@ public final class SWF implements SWFContainerItem, Timelined, Openable {
|
||||
|
||||
/**
|
||||
* Sorts character ids. Order of character ids will match the first
|
||||
* occurence of the characters.
|
||||
* occurrence of the characters.
|
||||
*/
|
||||
public void sortCharacterIds() {
|
||||
int maxId = Math.max(tags.size(), getNextCharacterId());
|
||||
|
||||
@@ -1491,7 +1491,7 @@ public class XFLConverter {
|
||||
|
||||
for (CharacterTag symbol : characters) {
|
||||
if ((symbol instanceof ShapeTag) && nonLibraryShapes.contains(symbol)) {
|
||||
continue; //shapes with 1 ocurrence and single layer are not added to library
|
||||
continue; //shapes with 1 occurrence and single layer are not added to library
|
||||
}
|
||||
|
||||
if ((symbol instanceof ShapeTag) || (symbol instanceof DefineSpriteTag) || (symbol instanceof ButtonTag)) {
|
||||
|
||||
@@ -177,7 +177,7 @@ public class Graph {
|
||||
* input edges are already visited (not counting back edges), then all its
|
||||
* output edges are processed.
|
||||
* <p>
|
||||
* This time is useful when sorting nodes according their occurence in
|
||||
* This time is useful when sorting nodes according their occurrence in
|
||||
* getMostCommonPart method - used for switch detection
|
||||
*
|
||||
* @param loops Already calculated loops to get backedges from.
|
||||
|
||||
Reference in New Issue
Block a user