projects
/
anneal.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (from parent 1:
3b84875
)
checkpoint
author
adam
<adam@megacz.com>
Wed, 5 Dec 2007 05:38:06 +0000
(21:38 -0800)
committer
adam
<adam@megacz.com>
Wed, 5 Dec 2007 05:38:06 +0000
(21:38 -0800)
darcs-hash:
20071205053806
-5007d-
59030fce6bc700543e2b6b5b1b14617721e9edec
.gz
src/edu/berkeley/qfat/Mesh.java
patch
|
blob
|
history
diff --git
a/src/edu/berkeley/qfat/Mesh.java
b/src/edu/berkeley/qfat/Mesh.java
index
1579551
..
ee7e660
100644
(file)
--- a/
src/edu/berkeley/qfat/Mesh.java
+++ b/
src/edu/berkeley/qfat/Mesh.java
@@
-77,15
+77,6
@@
public class Mesh implements Iterable<Mesh.T> {
done.add(p);
p.rescore();
}
done.add(p);
p.rescore();
}
- /*
- for(T t : this)
- for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() })
- p.kdremove();
- pointset.clear();
- for(T t : this)
- for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() })
- p.kdinsert();
- */
return (float)(dist/num);
}
return (float)(dist/num);
}
@@
-140,21
+131,6
@@
public class Mesh implements Iterable<Mesh.T> {
if (pointset.get(p) != null) throw new Error();
pointset.add(this);
}
if (pointset.get(p) != null) throw new Error();
pointset.add(this);
}
- public void reinsert() {
- pointset.remove(this);
- pointset.add(this);
- }
- public void kdremove() {
- if (!inserted) return;
- inserted = false;
- pointset.remove(this);
- }
- public void kdinsert() {
- if (inserted) return;
- inserted = true;
- pointset.add(this);
- }
-
public float score() { return oldscore; }
public void unscore() {
if (watch == null) return;
public float score() { return oldscore; }
public void unscore() {
if (watch == null) return;
@@
-634,10
+610,6
@@
public class Mesh implements Iterable<Mesh.T> {
break;
}
this.color = color;
break;
}
this.color = color;
-
- v1().kdinsert();
- v2().kdinsert();
- v3().kdinsert();
}
public E e1() { return e1; }
public E e2() { return e1.next; }
}
public E e1() { return e1; }
public E e2() { return e1.next; }