X-Git-Url: https://gerrit.simantics.org/r/gitweb?a=blobdiff_plain;f=bundles%2Forg.simantics.db.impl%2Fsrc%2Forg%2Fsimantics%2Fdb%2Fimpl%2Fquery%2FObjectUpdateSet.java;h=659eef137ac4f6b2d56325cb6a47d25b41eaaa2f;hb=a88c02c2d0f4250caf887a130b9f4314c6564722;hp=d2baafad2b808c99aec1488d01cd4b1fdc35534a;hpb=969bd23cab98a79ca9101af33334000879fb60c5;p=simantics%2Fplatform.git diff --git a/bundles/org.simantics.db.impl/src/org/simantics/db/impl/query/ObjectUpdateSet.java b/bundles/org.simantics.db.impl/src/org/simantics/db/impl/query/ObjectUpdateSet.java index d2baafad2..659eef137 100644 --- a/bundles/org.simantics.db.impl/src/org/simantics/db/impl/query/ObjectUpdateSet.java +++ b/bundles/org.simantics.db.impl/src/org/simantics/db/impl/query/ObjectUpdateSet.java @@ -1,52 +1,52 @@ -package org.simantics.db.impl.query; - -import gnu.trove.procedure.TLongProcedure; -import gnu.trove.set.hash.TLongHashSet; - -final public class ObjectUpdateSet { - - private long first = 0; - public TLongHashSet rest = new TLongHashSet(); - - public int size() { - if(first != 0) return 1; - else return rest.size(); - } - - public long getFirst() { - return first; - } - - public void add(long l) { - if(first == 0) { - if(rest.isEmpty()) { - first = l; - } else { - rest.add(l); - } - } else { - if(l == first) return; - rest.add(first); - rest.add(l); - first = 0; - } - } - - public void clear() { - first = 0; - if(!rest.isEmpty()) { - rest = new TLongHashSet(); - //System.err.println("new rest!"); - } - //rest.clear(); - } - - public void forEach(TLongProcedure proc) { - if(first != 0) { - proc.execute(first); - } else { - rest.forEach(proc); - } - } - -} +package org.simantics.db.impl.query; + +import gnu.trove.procedure.TLongProcedure; +import gnu.trove.set.hash.TLongHashSet; + +final public class ObjectUpdateSet { + + private long first = 0; + public TLongHashSet rest = new TLongHashSet(); + + public int size() { + if(first != 0) return 1; + else return rest.size(); + } + + public long getFirst() { + return first; + } + + public void add(long l) { + if(first == 0) { + if(rest.isEmpty()) { + first = l; + } else { + rest.add(l); + } + } else { + if(l == first) return; + rest.add(first); + rest.add(l); + first = 0; + } + } + + public void clear() { + first = 0; + if(!rest.isEmpty()) { + rest = new TLongHashSet(); + //System.err.println("new rest!"); + } + //rest.clear(); + } + + public void forEach(TLongProcedure proc) { + if(first != 0) { + proc.execute(first); + } else { + rest.forEach(proc); + } + } + +}