public Object sample(int n) {
if ((n < 0) || (n >= size)) {
throw new IllegalArgumentException(
"Can't get element " + n + " from set " + this + " of size " + size);
}
if (n < individuals.size()) {
return individuals.get(n);
}
int indexSoFar = individuals.size();
for (Iterator iter = popAppSatisfiers.entrySet().iterator(); iter.hasNext(); ) {
Map.Entry entry = (Map.Entry) iter.next();
NumberVar popApp = (NumberVar) entry.getKey();
ObjectSet satisfiers = (ObjectSet) entry.getValue();
Set exceptions = (Set) popAppExceptions.get(popApp);
int numInSet = satisfiers.size() - exceptions.size();
if (n < indexSoFar + numInSet) {
return sampleFromPOPApp(satisfiers, exceptions, n - indexSoFar);
}
indexSoFar += numInSet;
}
return null; // shouldn't get here
}
private void restoreMembers(Data data) {
Query q = newQuery(Data.class);
ObjectSet objectSet = q.execute();
Data rdata = (Data) objectSet.next();
data.i_map = rdata.i_map;
data.i_helper = rdata.i_helper;
}
private Item storedItem(String id) {
Query query = newQuery(Item.class);
query.descend("_id").constrain(id);
ObjectSet<Item> result = query.execute();
Assert.isTrue(result.hasNext());
return result.next();
}
public void _test() throws Exception {
Query query = newQuery();
query.constrain(new TestEvaluation());
query.constrain(Item.class);
query.descend("name").orderDescending();
ObjectSet set = query.execute();
Assert.areEqual(3, set.size());
}
// assumes o is in satisfiers \ exceptions
private int getIndexInPOPApp(ObjectSet satisfiers, Set exceptions, Object o) {
SortedSet exceptionIndices = new TreeSet();
for (Iterator iter = exceptions.iterator(); iter.hasNext(); ) {
Object exception = iter.next();
exceptionIndices.add(new Integer(satisfiers.indexOf(exception)));
}
int origIndex = satisfiers.indexOf(o);
int numExceptionsBefore = exceptionIndices.headSet(new Integer(origIndex)).size();
return (origIndex - numExceptionsBefore);
}
public void testQuery() {
ExtObjectContainer oc = fixture().db();
initGenericObjects();
ReflectClass rc = getReflectClass(oc, PERSON_CLASSNAME);
Assert.isNotNull(rc);
// now query to make sure there are none left
Query q = oc.query();
q.constrain(rc);
q.descend("surname").constrain("John");
ObjectSet results = q.execute();
Assert.isTrue(results.size() == 1);
}
public void testUpdate() {
ExtObjectContainer oc = fixture().db();
initGenericObjects();
// Db4oUtil.dump(oc);
ReflectClass rc = getReflectClass(oc, PERSON_CLASSNAME);
Assert.isNotNull(rc);
Query q = oc.query();
q.constrain(rc);
ObjectSet results = q.execute();
// Db4oUtil.dumpResults(oc, results);
Assert.isTrue(results.size() == 1);
}
/**
* Update local information from the scene. It's important that this method is synchronized
* because we get ConcurrentModificationException's during rendering otherwise.
*
* <p>This method is called from sceneChanged().
*/
protected synchronized void updateCharges(Scene theScene) {
// Clear cached infos.
cachedBounds = null;
cachedWire = null;
charges.clear();
setPositive = null;
setNegative = null;
// Get all selection sets.
Object layersObj = theScene.getMetadata("selectionsPlugin.selectionSets");
if (layersObj == null) return;
if (!(layersObj instanceof ArrayList)) return;
ArrayList<ObjectSet> layers = (ArrayList<ObjectSet>) layersObj;
// Try to find those which are of interest for us.
for (ObjectSet set : layers) {
if (set.getName().equals(setNamePositive)) {
setPositive = set;
} else if (set.getName().equals(setNameNegative)) {
setNegative = set;
}
}
// Create charges.
if (setPositive != null) {
for (ObjectInfo oi : setPositive.getObjects(theScene)) {
if (oi.getObject() instanceof Sphere) {
Sphere s = (Sphere) oi.getObject();
double q = s.getRadii().x;
Vec3 pos = oi.getCoords().getOrigin();
charges.add(new SphereCharge(pos, q));
}
}
}
if (setNegative != null) {
for (ObjectInfo oi : setNegative.getObjects(theScene)) {
if (oi.getObject() instanceof Sphere) {
Sphere s = (Sphere) oi.getObject();
double q = -s.getRadii().x;
Vec3 pos = oi.getCoords().getOrigin();
charges.add(new SphereCharge(pos, q));
}
}
}
}
public void test() {
final ItemDates item1 = new ItemDates(new Date(0), new Date());
final ItemDates item2 =
new ItemDates(new Date(10000), new Date(System.currentTimeMillis() - 10000));
a().provider().storeNew(item1);
a().provider().storeNew(item2);
a().provider().commit();
replicateAll(a().provider(), b().provider());
final ObjectSet found = b().provider().getStoredObjects(ItemDates.class);
Iterator4Assert.sameContent(
new Object[] {item2, item1}, ReplicationTestPlatform.adapt(found.iterator()));
}
public void testCreate() throws Exception {
initGenericObjects();
// fixture().reopen();
ExtObjectContainer oc = fixture().db();
// now check to see if person was saved
ReflectClass rc = getReflectClass(oc, PERSON_CLASSNAME);
Assert.isNotNull(rc);
Query q = oc.query();
q.constrain(rc);
ObjectSet results = q.execute();
Assert.isTrue(results.size() == 1);
// Db4oUtil.dumpResults(fixture().db(), results);
}
/**
* Adds the given POP application satisfier set as a subset of this set, with the given
* exceptions. The exceptions set must be a subset of the given satisfier set. If the given POP
* application was already a subset of this set, then the new exceptions set is the intersection
* of the given exceptions set with the old one. Otherwise, the exceptions set is the given one
* minus any individual elements of this set that satisfy the given POP application.
*/
public void addSatisfiers(NumberVar popApp, ObjectSet satisfiers, Set newExceptions) {
if (popAppSatisfiers.containsKey(popApp)) {
// already in set; assume satisfiers the same
Set curExceptions = (Set) popAppExceptions.get(popApp);
int oldNumExceptions = curExceptions.size();
curExceptions.retainAll(newExceptions);
size += (oldNumExceptions - curExceptions.size());
} else {
popAppSatisfiers.put(popApp, satisfiers);
Set oldIndivs = (Set) popAppIndivs.remove(popApp);
for (Iterator iter = oldIndivs.iterator(); iter.hasNext(); ) {
individuals.remove(iter.next());
}
Set curExceptions = new HashSet(newExceptions);
curExceptions.removeAll(oldIndivs);
popAppExceptions.put(popApp, curExceptions);
size +=
(satisfiers.size()
- oldIndivs.size() // because they were already
// here
- curExceptions.size()); // because they weren't added
}
}
protected Boolean containsInternal(Object o) {
if (individuals.contains(o)) {
return Boolean.TRUE;
}
for (Iterator iter = popAppSatisfiers.entrySet().iterator(); iter.hasNext(); ) {
Map.Entry entry = (Map.Entry) iter.next();
NumberVar popApp = (NumberVar) entry.getKey();
ObjectSet satisfiers = (ObjectSet) entry.getValue();
if (satisfiers.contains(o)) {
Set exceptions = (Set) popAppExceptions.get(popApp);
return Boolean.valueOf(!exceptions.contains(o));
}
}
return Boolean.FALSE;
}
public void specific(ObjectContainer con, int step) {
super.specific(con, step);
TEntry entry = new TEntry().lastElement();
Stack stack = new Stack();
if (step > 0) {
stack.addElement(entry.key);
ObjectSet set = con.queryByExample(stack);
if (set.size() != step) {
Regression.addError("Stack member query not found");
} else {
Stack res = (Stack) set.next();
if (!(stack.pop().equals(new TEntry().lastElement().key))) {
Regression.addError("Stack order changed.");
}
}
}
}
private Object sampleFromPOPApp(ObjectSet satisfiers, Set exceptions, int n) {
SortedSet exceptionIndices = new TreeSet();
for (Iterator iter = exceptions.iterator(); iter.hasNext(); ) {
Object exception = iter.next();
exceptionIndices.add(new Integer(satisfiers.indexOf(exception)));
}
for (Iterator iter = exceptionIndices.iterator(); iter.hasNext(); ) {
Integer exceptionIndex = (Integer) iter.next();
if (exceptionIndex.intValue() <= n) {
++n; // skip over this removed index
} else {
break;
}
}
return satisfiers.sample(n);
}
public int indexOf(Object o) {
int indivIndex = individuals.indexOf(o);
if (indivIndex != -1) {
return indivIndex;
}
int indexSoFar = individuals.size();
for (Iterator iter = popAppSatisfiers.entrySet().iterator(); iter.hasNext(); ) {
Map.Entry entry = (Map.Entry) iter.next();
NumberVar popApp = (NumberVar) entry.getKey();
ObjectSet satisfiers = (ObjectSet) entry.getValue();
Set exceptions = (Set) popAppExceptions.get(popApp);
if (satisfiers.contains(o) && !exceptions.contains(o)) {
return (indexSoFar + getIndexInPOPApp(satisfiers, exceptions, o));
}
int numInSet = satisfiers.size() - exceptions.size();
indexSoFar += numInSet;
}
return -1;
}
/** @deprecated using deprecated api */
private void runElementTest(Data data, boolean onOriginal) throws Exception {
Map otherMap = new HashMap();
AtomData atom = null;
tDefaultValues(data);
int itCount = 0;
Iterator i = data.i_map.keySet().iterator();
while (i.hasNext()) {
String str = (String) i.next();
itCount++;
atom = (AtomData) data.i_map.get(str);
Assert.areEqual(str, atom.name);
otherMap.put(str, atom);
}
Assert.areEqual(DEFAULT.length, itCount);
Assert.areEqual(DEFAULT.length, data.i_map.size());
Assert.isFalse(data.i_map.isEmpty());
db().deactivate(data.i_map, Integer.MAX_VALUE);
data.i_map.get("great");
Assert.areEqual("great", ((AtomData) data.i_map.get("great")).name);
db().deactivate(data.i_map, Integer.MAX_VALUE);
if (onOriginal) {
Query q = newQuery();
Data template = new Data();
template.i_map = db().collections().newHashMap(1);
template.i_map.put("cool", new AtomData("cool"));
q.constrain(template);
ObjectSet qResult = q.execute();
Assert.areEqual(1, qResult.size());
Assert.areEqual(data, qResult.next());
}
Assert.isTrue(data.i_map.keySet().containsAll(otherMap.keySet()));
Object[] arr = data.i_map.keySet().toArray();
tDefaultArray(arr);
String[] cmp = new String[DEFAULT.length];
System.arraycopy(DEFAULT, 0, cmp, 0, DEFAULT.length);
i = data.i_map.keySet().iterator();
while (i.hasNext()) {
String str = (String) i.next();
boolean found = false;
for (int j = 0; j < cmp.length; j++) {
if (str.equals(cmp[j])) {
cmp[j] = null;
found = true;
}
}
Assert.isTrue(found);
}
for (int j = 0; j < cmp.length; j++) {
Assert.isNull(cmp[j]);
}
db().deactivate(data.i_map, Integer.MAX_VALUE);
Assert.isFalse(data.i_map.isEmpty());
db().deactivate(data.i_map, Integer.MAX_VALUE);
data.i_map.put("yup", new AtomData("yup"));
db().store(data.i_map);
db().store(data.i_map);
db().store(data.i_map);
db().store(data.i_helper);
db().store(data.i_helper);
db().store(data.i_helper);
db().commit();
Assert.areEqual(4, data.i_map.size());
atom = (AtomData) data.i_map.get("yup");
Assert.areEqual("yup", atom.name);
AtomData removed = (AtomData) data.i_map.remove("great");
Assert.areEqual("great", removed.name);
Assert.isNull(data.i_map.remove("great"));
db().deactivate(data.i_map, Integer.MAX_VALUE);
Assert.areEqual(3, data.i_map.size());
Assert.isTrue(data.i_map.keySet().removeAll(otherMap.keySet()));
db().deactivate(data.i_map, Integer.MAX_VALUE);
Assert.isFalse(data.i_map.keySet().removeAll(otherMap.keySet()));
Assert.areEqual(1, data.i_map.size());
i = data.i_map.keySet().iterator();
String str = (String) i.next();
Assert.areEqual("yup", str);
Assert.isFalse(i.hasNext());
data.i_map.clear();
Assert.isTrue(data.i_map.isEmpty());
Assert.areEqual(0, data.i_map.size());
setDefaultValues(data.i_map);
String[] strArr = new String[1];
strArr = (String[]) data.i_map.keySet().toArray(strArr);
tDefaultArray(strArr);
data.i_map.clear();
data.i_map.put("zero", "zero");
for (int j = 0; j < COUNT; j++) {
data.i_map.put(MORE + j, new AtomData(MORE + j));
}
Assert.areEqual(COUNT + 1, data.i_map.size());
lookupLast(data);
db().deactivate(data.i_map, Integer.MAX_VALUE);
lookupLast(data);
lookupLast(data);
reopen();
restoreMembers(data);
lookupLast(data);
atom = new AtomData("double");
data.i_map.put("double", atom);
int previousSize = data.i_map.size();
db().deactivate(data.i_map, Integer.MAX_VALUE);
AtomData doubleAtom = (AtomData) data.i_map.put("double", new AtomData("double"));
Assert.areSame(atom, doubleAtom);
Assert.areEqual(previousSize, data.i_map.size());
data.i_map.put("double", doubleAtom);
db().commit();
data.i_map.put("rollBack", "rollBack");
data.i_map.put("double", new AtomData("nono"));
db().rollback();
Assert.isNull(data.i_map.get("rollBack"));
Assert.areEqual(previousSize, data.i_map.size());
atom = (AtomData) data.i_map.get("double");
Assert.areSame(atom, doubleAtom);
Assert.isTrue(data.i_map.containsKey("double"));
Assert.isFalse(data.i_map.containsKey("rollBack"));
otherMap.clear();
otherMap.put("other1", doubleAtom);
otherMap.put("other2", doubleAtom);
data.i_map.putAll(otherMap);
db().deactivate(data.i_map, Integer.MAX_VALUE);
Assert.areSame(doubleAtom, data.i_map.get("other1"));
Assert.areSame(doubleAtom, data.i_map.get("other2"));
data.i_map.clear();
Assert.areEqual(0, data.i_map.size());
setDefaultValues(data.i_map);
int j = 0;
i = data.i_map.keySet().iterator();
while (i.hasNext()) {
String key = (String) i.next();
if (key.equals("cool")) {
i.remove();
}
j++;
}
Assert.areEqual(2, data.i_map.size());
Assert.isFalse(data.i_map.containsKey("cool"));
Assert.areEqual(3, j);
data.i_map.put("double", doubleAtom);
((Db4oMap) data.i_map).deleteRemoved(true);
data.i_map.keySet().remove("double");
Assert.isFalse(db().isStored(doubleAtom));
((Db4oMap) data.i_map).deleteRemoved(false);
data.i_map.clear();
Assert.areEqual(0, data.i_map.size());
setDefaultValues(data.i_map);
}
private void assertSingleElementQueryResult(Query query, Object element) {
ObjectSet objectSet = query.execute();
Assert.areEqual(1, objectSet.size());
Item item = (Item) objectSet.next();
Assert.areEqual(element, item.list.get(0));
}
