Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 6 additions & 8 deletions pom.xml
Original file line number Diff line number Diff line change
Expand Up @@ -3,13 +3,13 @@
<modelVersion>4.0.0</modelVersion>
<groupId>org.twak.campskeleton</groupId>
<artifactId>campskeleton</artifactId>
<version>0.0.1-SNAPSHOT</version>
<version>0.0.2-SNAPSHOT</version>

<packaging>jar</packaging>

<properties>
<maven.compiler.target>1.8</maven.compiler.target>
<maven.compiler.source>1.8</maven.compiler.source>
<maven.compiler.target>11</maven.compiler.target>
<maven.compiler.source>11</maven.compiler.source>
</properties>

<build>
Expand Down Expand Up @@ -122,12 +122,10 @@
<artifactId>vecmath</artifactId>
<version>1.5.2</version>
</dependency>

<!-- https://mvnrepository.com/artifact/gov.nist.math/jama -->
<dependency>
<groupId>gov.nist.math</groupId>
<artifactId>jama</artifactId>
<version>1.0.3</version>
<groupId>org.tinspin</groupId>
<artifactId>tinspin-indexes</artifactId>
<version>2.1.3</version>
</dependency>

</dependencies>
Expand Down
12 changes: 7 additions & 5 deletions src/org/twak/camp/CoSitedCollision.java
Original file line number Diff line number Diff line change
Expand Up @@ -2,8 +2,10 @@
package org.twak.camp;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
Expand All @@ -27,7 +29,7 @@
*/
public class CoSitedCollision
{
public Set<EdgeCollision> edges = new LinkedHashSet();
public Collection<EdgeCollision> edges = new ArrayList<>(10);
public Point3d loc;

public boolean debugHoriz = false;
Expand All @@ -45,7 +47,7 @@ public CoSitedCollision( Point3d loc, EdgeCollision ec, HeightCollision parent )

public void add(EdgeCollision ec)
{
edges.add( ec );
edges.add(ec);
}

/**
Expand All @@ -54,10 +56,10 @@ public void add(EdgeCollision ec)
*/
public boolean findChains ( Skeleton skel )
{
chains = new ArrayList();
chains = new ArrayList<>();

// remove duplicate edges
Set<Edge> allEdges = new LinkedHashSet();
Set<Edge> allEdges = new HashSet<>();
for (EdgeCollision ec : edges)
{
allEdges.add( ec.a );
Expand Down Expand Up @@ -124,7 +126,7 @@ public boolean findChains ( Skeleton skel )
}

/**
* If another collision has been evaluated at teh same height, this method
* If another collision has been evaluated at the same height, this method
* checks for any changes in the Corners involved in a skeleton. This is a problem
* when several collisions at the same height occur against one smash edge.
*
Expand Down
Loading