private Map promptForOverwrite(List plugins, List locales) {
Map overwrites = new HashMap();
if (overwriteWithoutAsking) return overwrites;
for (Iterator iter = plugins.iterator(); iter.hasNext(); ) {
IPluginModelBase plugin = (IPluginModelBase) iter.next();
for (Iterator it = locales.iterator(); it.hasNext(); ) {
Locale locale = (Locale) it.next();
IProject project = getNLProject(plugin, locale);
if (project.exists() && !overwrites.containsKey(project.getName())) {
boolean overwrite =
MessageDialog.openConfirm(
PDEPlugin.getActiveWorkbenchShell(),
PDEUIMessages.InternationalizeWizard_NLSFragmentGenerator_overwriteTitle,
NLS.bind(
PDEUIMessages.InternationalizeWizard_NLSFragmentGenerator_overwriteMessage,
pluginName(plugin, locale)));
overwrites.put(project.getName(), overwrite ? OVERWRITE : null);
}
}
}
return overwrites;
}
/** @param config */
public DecorateHandler(TagConfig config) {
super(config);
this.template = this.getRequiredAttribute("template");
this.handlers = new HashMap();
Iterator itr = this.findNextByType(DefineHandler.class);
DefineHandler d = null;
while (itr.hasNext()) {
d = (DefineHandler) itr.next();
this.handlers.put(d.getName(), d);
if (log.isLoggable(Level.FINE)) {
log.fine(tag + " found Define[" + d.getName() + "]");
}
}
List paramC = new ArrayList();
itr = this.findNextByType(ParamHandler.class);
while (itr.hasNext()) {
paramC.add(itr.next());
}
if (paramC.size() > 0) {
this.params = new ParamHandler[paramC.size()];
for (int i = 0; i < this.params.length; i++) {
this.params[i] = (ParamHandler) paramC.get(i);
}
} else {
this.params = null;
}
}
public Set /*<PCNode>*/ matchClass(Pattern simple_name_pattern) {
Set this_class = matchSpecific(simple_name_pattern);
Set this_class_names = new HashSet();
Iterator tsi = this_class.iterator();
while (tsi.hasNext()) {
PCNode pc = (PCNode) tsi.next();
this_class_names.add(pc.name);
}
Iterator pi = parents.iterator();
while (pi.hasNext()) {
PCNode parent = (PCNode) pi.next();
// System.out.println("Parent: "+parent);
Set parent_class = parent.matchClass(simple_name_pattern);
Iterator osi = parent_class.iterator();
while (osi.hasNext()) {
PCNode pc = (PCNode) osi.next();
if (!this_class_names.contains(pc.name)) {
this_class.add(pc);
}
}
}
if (abc.main.Debug.v().namePatternProcessing)
System.out.println(this + ".matchClass " + simple_name_pattern.pattern() + ": " + this_class);
return this_class;
}
@SuppressWarnings({"ConstantConditions"})
public Element getState() {
if (myBundledDisabledDictionariesPaths.isEmpty()
&& myDictionaryFoldersPaths.isEmpty()
&& myDisabledDictionariesPaths.isEmpty()) {
return null;
}
final Element element = new Element(SPELLCHECKER_MANAGER_SETTINGS_TAG);
// bundled
element.setAttribute(
BUNDLED_DICTIONARIES_ATTR_NAME, String.valueOf(myBundledDisabledDictionariesPaths.size()));
Iterator<String> iterator = myBundledDisabledDictionariesPaths.iterator();
int i = 0;
while (iterator.hasNext()) {
element.setAttribute(BUNDLED_DICTIONARY_ATTR_NAME + i, iterator.next());
i++;
}
// user
element.setAttribute(FOLDERS_ATTR_NAME, String.valueOf(myDictionaryFoldersPaths.size()));
for (int j = 0; j < myDictionaryFoldersPaths.size(); j++) {
element.setAttribute(FOLDER_ATTR_NAME + j, myDictionaryFoldersPaths.get(j));
}
element.setAttribute(
DICTIONARIES_ATTR_NAME, String.valueOf(myDisabledDictionariesPaths.size()));
iterator = myDisabledDictionariesPaths.iterator();
i = 0;
while (iterator.hasNext()) {
element.setAttribute(DICTIONARY_ATTR_NAME + i, iterator.next());
i++;
}
return element;
}
@Test
public void optimizeRand() throws IOException {
Optimizer optimizer = new Optimizer();
long start;
List<Vol> optimize;
for (int i = 0; i < 1; i++) {
List<Vol> list = randList(100000);
start = System.currentTimeMillis();
// optimize = optimizer.optimize3(null, list);
// System.out.println(optimizer.formatString(optimize));
// System.out.println(System.currentTimeMillis() - start);
// System.out.println(Vol.toString(optimize));
start = System.currentTimeMillis();
List<Vol> optimize2 = optimizer.optimize4(list);
long duration = System.currentTimeMillis() - start;
System.out.println(optimizer.formatString(optimize2));
System.out.println(duration);
// System.out.println(Vol.toString(optimize2));
//
// assertThat(Optimizer.price(optimize)).isLessThanOrEqualTo(Optimizer.price(optimize2));
Iterator<Vol> iterator = optimize2.iterator();
Vol vol = iterator.next();
while (iterator.hasNext()) {
Vol next = iterator.next();
assertThat(vol.isNext(next)).isTrue();
vol = next;
}
}
}
public void deleteTaxByTenantIdx(long TenantId) {
CFAccTaxByTenantIdxKey key =
((ICFAccSchema) schema.getBackingStore()).getFactoryTax().newTenantIdxKey();
key.setRequiredTenantId(TenantId);
if (indexByTenantIdx == null) {
indexByTenantIdx = new HashMap<CFAccTaxByTenantIdxKey, Map<CFAccTaxPKey, ICFAccTaxObj>>();
}
if (indexByTenantIdx.containsKey(key)) {
Map<CFAccTaxPKey, ICFAccTaxObj> dict = indexByTenantIdx.get(key);
((ICFAccSchema) schema.getBackingStore())
.getTableTax()
.deleteTaxByTenantIdx(schema.getAuthorization(), TenantId);
Iterator<ICFAccTaxObj> iter = dict.values().iterator();
ICFAccTaxObj obj;
List<ICFAccTaxObj> toForget = new LinkedList<ICFAccTaxObj>();
while (iter.hasNext()) {
obj = iter.next();
toForget.add(obj);
}
iter = toForget.iterator();
while (iter.hasNext()) {
obj = iter.next();
obj.forget(true);
}
indexByTenantIdx.remove(key);
} else {
((ICFAccSchema) schema.getBackingStore())
.getTableTax()
.deleteTaxByTenantIdx(schema.getAuthorization(), TenantId);
}
}
public static void main(String[] args) throws FileNotFoundException {
String s;
ArrayList<String> AL = new ArrayList<String>();
AL.add("one");
AL.add("two");
AL.add("three");
AL.add("four");
AL.add("five");
AL.add("six");
System.out.println("ArrayList (iterator) " + AL);
Iterator<String> it = AL.iterator();
while (it.hasNext()) {
s = it.next();
System.out.println("AL: " + s);
}
System.out.println();
myList ml = new myList();
ml.add(20);
ml.add(50);
ml.add(12);
ml.add(13);
ml.add(53);
ml.add(33);
ml.add(23);
System.out.println(ml);
Iterator<Integer> mlit = ml.iterator();
while (mlit.hasNext()) {
System.out.println(mlit.next());
}
}
/**
* Partition the members of an iterator into two lists, according to whether they are named or
* anonymous classes
*
* @param i An iterator to partition
* @param named A list of named classes
* @param anon A list of anonymous classes
*/
protected static void partitionByNamed(
Iterator<? extends OntClass> i, List<OntClass> named, List<OntClass> anon) {
while (i.hasNext()) {
OntClass c = i.next();
boolean ignore = false;
// duplicate check: we ignore this class if we've already got it
if (named.contains(c)) {
ignore = true;
}
// subsumption check: c must have only anon classes or Thing
// as super-classes to still qualify as a root class
Resource thing = c.getProfile().THING();
for (Iterator<OntClass> j = c.listSuperClasses(); !ignore && j.hasNext(); ) {
OntClass sup = j.next();
if (!((thing != null && sup.equals(thing)) || sup.isAnon() || sup.equals(c))) {
ignore = true;
}
}
if (!ignore) {
// place the class in the appropriate partition
(c.isAnon() ? anon : named).add(c);
}
}
}
public static boolean isAcyclic(Digraph digraph) {
int order = digraph.order();
if (order == 0) return true;
Set spanned = new HashSet(order);
DepthFirstStampSearch dfs = new DepthFirstStampSearch(digraph, digraph.vertexIterator().next());
for (Iterator i = digraph.vertexIterator(); i.hasNext(); ) {
Object dfsRoot = i.next();
if (spanned.contains(dfsRoot)) continue;
dfs.reset(dfsRoot);
Map dfsOrders = dfs.traverse(new HashMap(digraph.order()));
for (Iterator j = dfsOrders.entrySet().iterator(); j.hasNext(); ) {
Map.Entry entry = (Map.Entry) j.next();
Object origin = entry.getKey();
DepthFirstStampSearch.OrderPair orgOrders =
(DepthFirstStampSearch.OrderPair) entry.getValue();
spanned.add(origin);
for (ArcIterator k = digraph.outgoingIterator(origin); k.hasNext(); ) {
k.next();
Object dst = k.getDestination();
DepthFirstStampSearch.OrderPair dstOrders =
(DepthFirstStampSearch.OrderPair) dfsOrders.get(dst);
if (dstOrders.getPostOrder() > orgOrders.getPostOrder()) return false;
}
}
if (dfsOrders.size() == order) break;
}
return true;
}
public static void main(String[] args) {
Collection<String> collection = new HashSet<String>();
collection.add("one");
collection.add("two");
Iterator<String> iterator = collection.iterator();
while (iterator.hasNext()) {
String s = iterator.next();
System.out.println(s);
}
System.out.println("======================================");
TreeSet<String> set = new TreeSet<String>(collection);
Iterator<String> itor = set.iterator();
while (itor.hasNext()) {
System.out.println(itor.next());
}
Collection<String> colList = new ArrayList<String>();
colList.add("one");
colList.add("two");
colList.add("three");
if (colList.containsAll(collection)) {
System.out.println("true");
}
System.out.println("=================");
String[] strings = colList.toArray(new String[0]);
String[] strings1 = (String[]) colList.toArray();
}
public void filter(Collection list) throws Exception {
resetStorage();
initializeStorage(new Vector());
Iterator i, j;
Metadata data;
MetadataBase newData;
String criteria;
i = list.iterator();
while (i.hasNext()) {
data = (Metadata) i.next();
criteria = defineCriteria(data);
if (null != criteria) {
agent.setCriteria(criteria);
agent.search();
if (0 == agent.getResults().size()) store(data);
else {
j = agent.getResults().iterator();
while (j.hasNext()) {
newData = new MetadataBase();
newData.setOrigin(data.getOrigin());
newData.setName(data.getName());
newData.merge(agent.getName(), (Metadata) j.next());
newData.merge(data);
store(newData);
}
}
}
}
}
public String[] getjavaVMs() {
// get the internal VM name
// App Clients never run on the internal VM
Set res = new HashSet();
if (!(this instanceof AppClientModuleMdl)) {
// res.addAll(findNames("j2eeType=JVM,name=" + MOAgentFactory.getAgent().getJVMId()));
}
// get the external VM names
Iterator vmNames = externalVMs.iterator();
while (vmNames.hasNext()) {
String vmName = (String) vmNames.next();
Set x = findNames("j2eeType=JVM,name=" + vmName);
if (x.size() > 0) {
res.addAll(x);
} else {
// no longer an active VM
externalVMs.remove(vmName);
vmNames = externalVMs.iterator();
}
}
Iterator it = res.iterator();
String[] vms = new String[res.size()];
int i = 0;
while (it.hasNext()) {
vms[i++] = ((ObjectName) it.next()).toString();
}
return vms;
}
public void testSubMapContents2() {
ConcurrentNavigableMap map = map5();
SortedMap sm = map.subMap(two, three);
assertEquals(1, sm.size());
assertEquals(two, sm.firstKey());
assertEquals(two, sm.lastKey());
assertFalse(sm.containsKey(one));
assertTrue(sm.containsKey(two));
assertFalse(sm.containsKey(three));
assertFalse(sm.containsKey(four));
assertFalse(sm.containsKey(five));
Iterator i = sm.keySet().iterator();
Object k;
k = (Integer) (i.next());
assertEquals(two, k);
assertFalse(i.hasNext());
Iterator j = sm.keySet().iterator();
j.next();
j.remove();
assertFalse(map.containsKey(two));
assertEquals(4, map.size());
assertEquals(0, sm.size());
assertTrue(sm.isEmpty());
assertSame(sm.remove(three), null);
assertEquals(4, map.size());
}
public void testDescendingSubMapContents2() {
ConcurrentNavigableMap map = dmap5();
SortedMap sm = map.subMap(m2, m3);
assertEquals(1, sm.size());
assertEquals(m2, sm.firstKey());
assertEquals(m2, sm.lastKey());
assertFalse(sm.containsKey(m1));
assertTrue(sm.containsKey(m2));
assertFalse(sm.containsKey(m3));
assertFalse(sm.containsKey(m4));
assertFalse(sm.containsKey(m5));
Iterator i = sm.keySet().iterator();
Object k;
k = (Integer) (i.next());
assertEquals(m2, k);
assertFalse(i.hasNext());
Iterator j = sm.keySet().iterator();
j.next();
j.remove();
assertFalse(map.containsKey(m2));
assertEquals(4, map.size());
assertEquals(0, sm.size());
assertTrue(sm.isEmpty());
assertSame(sm.remove(m3), null);
assertEquals(4, map.size());
}
public void deleteSecDeviceByUserIdx(UUID SecUserId) {
CFSecuritySecDeviceByUserIdxKey key =
((ICFSecuritySchema) schema.getBackingStore()).getFactorySecDevice().newUserIdxKey();
key.setRequiredSecUserId(SecUserId);
if (indexByUserIdx == null) {
indexByUserIdx =
new HashMap<
CFSecuritySecDeviceByUserIdxKey,
Map<CFSecuritySecDevicePKey, ICFSecuritySecDeviceObj>>();
}
if (indexByUserIdx.containsKey(key)) {
Map<CFSecuritySecDevicePKey, ICFSecuritySecDeviceObj> dict = indexByUserIdx.get(key);
((ICFSecuritySchema) schema.getBackingStore())
.getTableSecDevice()
.deleteSecDeviceByUserIdx(schema.getAuthorization(), SecUserId);
Iterator<ICFSecuritySecDeviceObj> iter = dict.values().iterator();
ICFSecuritySecDeviceObj obj;
List<ICFSecuritySecDeviceObj> toForget = new LinkedList<ICFSecuritySecDeviceObj>();
while (iter.hasNext()) {
obj = iter.next();
toForget.add(obj);
}
iter = toForget.iterator();
while (iter.hasNext()) {
obj = iter.next();
obj.forget(true);
}
indexByUserIdx.remove(key);
} else {
((ICFSecuritySchema) schema.getBackingStore())
.getTableSecDevice()
.deleteSecDeviceByUserIdx(schema.getAuthorization(), SecUserId);
}
}
public void dispose() {
// empty scraper's variable context
this.context.clear();
// free connection with context
this.context.dispose();
// releases script engines
if (this.usedScriptEngines != null) {
Iterator iterator = this.usedScriptEngines.values().iterator();
while (iterator.hasNext()) {
ScriptEngine engine = (ScriptEngine) iterator.next();
if (engine != null) {
engine.dispose();
}
}
}
this.logger.removeAllAppenders();
Iterator iterator = usedScriptEngines.values().iterator();
while (iterator.hasNext()) {
ScriptEngine engine = (ScriptEngine) iterator.next();
engine.dispose();
}
}
public static boolean isTree(Digraph digraph) {
Object root = null;
for (Iterator i = digraph.vertexIterator(); i.hasNext(); ) {
Object vertex = i.next();
int inSize = digraph.incomingSize(vertex);
if (inSize == 0) {
root = vertex;
break;
}
}
// not a tree - no vertex with 0 in-degree
if (root == null) return false;
// try to reach all vertices from the root candidate
BreadthFirstSearch traversal = new BreadthFirstSearch(digraph, root);
while (traversal.isValidTree() && traversal.hasNext()) traversal.next();
// not a tree - one of vertices has been seen more than once by the BFS
if (!traversal.isValidTree()) return false;
// has every vertex been reached?
Set seenVertices = traversal.getSeenVertices();
for (Iterator i = digraph.vertexIterator(); i.hasNext(); )
if (!seenVertices.contains(i.next())) return false;
// all tests are passed - good!
return true;
}
/** @see jaskell.compiler.JaskellVisitor#visit(ConstructorPattern) */
public Object visit(ConstructorPattern a) {
String cname = a.getConstructor().getName();
/* retrieve parameter types of constructor */
ConstructorDefinition ctor = (ConstructorDefinition) a.getConstructor().lookup(cname);
if (ctor == null) throw new TypeError("Undefined constructor pattern " + a);
/* type of data constructed by constructor */
TypeInstantiator ti = new TypeInstantiator(ctor.getDataType());
Type rtype = ti.instance();
Map map = ti.getMap();
TypeSubstitution ts = new TypeSubstitution(map);
Iterator ittypes = ctor.getParameters().iterator();
/* retrieve type of patterns */
Iterator it = a.getSubPatterns();
while (it.hasNext()) {
try {
Pattern p = (Pattern) it.next();
Type actual = TypeFactory.freshBinding();
Type formal = ts.substitute((Type) ittypes.next());
/* unify both types */
p.setType(tu.unify(formal, actual, typeVariablesMap));
} catch (NoSuchElementException nex) {
throw new TypeError("Wrong number of arguments to pattern " + a);
}
}
a.setType(rtype);
return a.getType();
}
private void safeBeginParagraph() {
if (!myParagraphStarted) {
myParagraphStarted = true;
myBufferIsEmpty = true;
beginParagraph(ZLTextParagraph.Kind.TEXT_PARAGRAPH);
if (!myParagraphStored) {
// final ArrayList models = Model.getBookTextModels();
// myParagraphVector.add(new Pair(((ZLTextPlainModel)
// models.get(models.size()-1)/*BookTextModel*/).getParagraphsNumber() - 1, models.size() -
// 1));
myParagraphStored = true;
}
for (Iterator it = myDelayedControls.iterator(); it.hasNext(); ) {
Pair pit = (Pair) it.next();
addControl((Byte) pit.myFirst, (Boolean) pit.mySecond);
}
// if (myForcedEntry != null) {
// addControl(myForcedEntry);
// } else {
addControl(FBTextKind.REGULAR, true);
// }
for (Iterator it = myDelayedHyperlinks.iterator(); it.hasNext(); ) {
addHyperlinkControl(FBTextKind.INTERNAL_HYPERLINK, (String) it.next());
}
myDelayedHyperlinks.clear();
}
}
/**
* Adds new point p with value m to this histogram.
*
* @param p
* @param m
*/
public void update(double p, long m) {
Long mi = bin.get(p);
if (mi != null) {
// we found the same p so increment that counter
bin.put(p, mi + m);
} else {
bin.put(p, m);
// if bin size exceeds maximum bin size then trim down to max size
while (bin.size() > maxBinSize) {
// find points p1, p2 which have smallest difference
Iterator<Double> keys = bin.keySet().iterator();
double p1 = keys.next();
double p2 = keys.next();
double smallestDiff = p2 - p1;
double q1 = p1, q2 = p2;
while (keys.hasNext()) {
p1 = p2;
p2 = keys.next();
double diff = p2 - p1;
if (diff < smallestDiff) {
smallestDiff = diff;
q1 = p1;
q2 = p2;
}
}
// merge those two
long k1 = bin.remove(q1);
long k2 = bin.remove(q2);
bin.put((q1 * k1 + q2 * k2) / (k1 + k2), k1 + k2);
}
}
}
/**
* Creates an NL fragment project along with the locale specific properties files.
*
* @throws CoreException
* @throws IOException
* @throws InvocationTargetException
* @throws InterruptedException
*/
private void internationalizePlugins(List plugins, List locales, Map overwrites)
throws CoreException, IOException, InvocationTargetException, InterruptedException {
Set created = new HashSet();
for (Iterator it = plugins.iterator(); it.hasNext(); ) {
IPluginModelBase plugin = (IPluginModelBase) it.next();
for (Iterator iter = locales.iterator(); iter.hasNext(); ) {
Locale locale = (Locale) iter.next();
IProject project = getNLProject(plugin, locale);
if (created.contains(project)
|| overwriteWithoutAsking
|| !project.exists()
|| OVERWRITE == overwrites.get(project.getName())) {
if (!created.contains(project) && project.exists()) {
project.delete(true, getProgressMonitor());
}
if (!created.contains(project)) {
createNLFragment(plugin, project, locale);
created.add(project);
project.getFolder(RESOURCE_FOLDER_PARENT).create(false, true, getProgressMonitor());
}
project
.getFolder(RESOURCE_FOLDER_PARENT)
.getFolder(locale.toString())
.create(true, true, getProgressMonitor());
createLocaleSpecificPropertiesFile(project, plugin, locale);
}
}
}
}
/**
* Joins the elements of the provided {@code Iterator} into a single String containing the
* provided elements.
*
* <p>No delimiter is added before or after the list. A {@code null} separator is the same as an
* empty String ("").
*
* <p>Copied from Commons Lang, version 3 (r1138702).
*
* @param iterator the {@code Iterator} of values to join together, may be null
* @param separator the separator character to use, null treated as ""
* @return the joined String, {@code null} if null iterator input
*/
public static String join(Iterator<?> iterator, String separator) {
final String empty = "";
// handle null, zero and one elements before building a buffer
if (iterator == null) {
return null;
}
if (!iterator.hasNext()) {
return empty;
}
Object first = iterator.next();
if (!iterator.hasNext()) {
return first == null ? empty : first.toString();
}
// two or more elements
StringBuilder buf = new StringBuilder(256); // Java default is 16, probably too small
if (first != null) {
buf.append(first);
}
while (iterator.hasNext()) {
if (separator != null) {
buf.append(separator);
}
Object obj = iterator.next();
if (obj != null) {
buf.append(obj);
}
}
return buf.toString();
}
void filterServiceEventReceivers(
final ServiceEvent evt, final Collection /*<ServiceListenerEntry>*/ receivers) {
ArrayList srl = fwCtx.services.get(EventHook.class.getName());
if (srl != null) {
HashSet ctxs = new HashSet();
for (Iterator ir = receivers.iterator(); ir.hasNext(); ) {
ctxs.add(((ServiceListenerEntry) ir.next()).getBundleContext());
}
int start_size = ctxs.size();
RemoveOnlyCollection filtered = new RemoveOnlyCollection(ctxs);
for (Iterator i = srl.iterator(); i.hasNext(); ) {
ServiceReferenceImpl sr = ((ServiceRegistrationImpl) i.next()).reference;
EventHook eh = (EventHook) sr.getService(fwCtx.systemBundle);
if (eh != null) {
try {
eh.event(evt, filtered);
} catch (Exception e) {
fwCtx.debug.printStackTrace(
"Failed to call event hook #" + sr.getProperty(Constants.SERVICE_ID), e);
}
}
}
// NYI, refactor this for speed!?
if (start_size != ctxs.size()) {
for (Iterator ir = receivers.iterator(); ir.hasNext(); ) {
if (!ctxs.contains(((ServiceListenerEntry) ir.next()).getBundleContext())) {
ir.remove();
}
}
}
}
}
public void doIt() {
Iterator iter;
Collection ref;
ref = new ArrayList();
Populator.fillIt(ref);
iter = ref.iterator();
while (iter.hasNext()) {
System.out.print(iter.next() + " ");
} // end while loop
System.out.println();
Collections.reverse((List) ref);
iter = ref.iterator();
while (iter.hasNext()) {
System.out.print(iter.next() + " ");
} // end while loop
System.out.println();
Comparator aComparator = Collections.reverseOrder();
Collections.sort((List) ref, aComparator);
iter = ref.iterator();
while (iter.hasNext()) {
System.out.print(iter.next() + " ");
} // end while loop
System.out.println();
} // end doIt()
public void forgetTaxByTenantIdx(long TenantId) {
if (indexByTenantIdx == null) {
return;
}
CFAccTaxByTenantIdxKey key =
((ICFAccSchema) schema.getBackingStore()).getFactoryTax().newTenantIdxKey();
key.setRequiredTenantId(TenantId);
if (indexByTenantIdx.containsKey(key)) {
Map<CFAccTaxPKey, ICFAccTaxObj> mapTenantIdx = indexByTenantIdx.get(key);
if (mapTenantIdx != null) {
List<ICFAccTaxObj> toForget = new LinkedList<ICFAccTaxObj>();
ICFAccTaxObj cur = null;
Iterator<ICFAccTaxObj> iter = mapTenantIdx.values().iterator();
while (iter.hasNext()) {
cur = iter.next();
toForget.add(cur);
}
iter = toForget.iterator();
while (iter.hasNext()) {
cur = iter.next();
cur.forget(true);
}
}
indexByTenantIdx.remove(key);
}
}
/**
* Given an abstract dispatch to an object of type c and a method m, gives a list of possible
* receiver methods.
*/
public List resolveAbstractDispatch(SootClass c, SootMethod m) {
c.checkLevel(SootClass.HIERARCHY);
m.getDeclaringClass().checkLevel(SootClass.HIERARCHY);
checkState();
Iterator<SootClass> classesIt = null;
if (c.isInterface()) {
classesIt = getImplementersOf(c).iterator();
HashSet<SootClass> classes = new HashSet<SootClass>();
while (classesIt.hasNext()) classes.addAll(getSubclassesOfIncluding(classesIt.next()));
classesIt = classes.iterator();
} else classesIt = getSubclassesOfIncluding(c).iterator();
ArraySet s = new ArraySet();
while (classesIt.hasNext()) {
SootClass cl = classesIt.next();
if (Modifier.isAbstract(cl.getModifiers())) continue;
s.add(resolveConcreteDispatch(cl, m));
}
List l = new ArrayList();
l.addAll(s);
return Collections.unmodifiableList(l);
}
/**
* @param grid
* @return an array of vertex coordinates, one vertex per edge end, 3 coords per vertex
*/
public double[] getCoords(float[][] grid) {
double[] ret = new double[edges.size() * 3];
Iterator<Integer> it = edges.iterator();
switch (direction) {
case 0:
for (int i = 0; i < ret.length; i += 3) {
ret[i + 0] = grid[0][it.next().intValue()];
ret[i + 1] = grid[1][c1];
ret[i + 2] = grid[2][c2];
}
break;
case 1:
for (int i = 0; i < ret.length; i += 3) {
ret[i + 0] = grid[0][c1];
ret[i + 1] = grid[1][it.next().intValue()];
ret[i + 2] = grid[2][c2];
}
break;
case 2:
for (int i = 0; i < ret.length; i += 3) {
ret[i + 0] = grid[0][c1];
ret[i + 1] = grid[1][c2];
ret[i + 2] = grid[2][it.next().intValue()];
}
break;
}
return ret;
}
public void forgetSecDeviceByUserIdx(UUID SecUserId) {
if (indexByUserIdx == null) {
return;
}
CFSecuritySecDeviceByUserIdxKey key =
((ICFSecuritySchema) schema.getBackingStore()).getFactorySecDevice().newUserIdxKey();
key.setRequiredSecUserId(SecUserId);
if (indexByUserIdx.containsKey(key)) {
Map<CFSecuritySecDevicePKey, ICFSecuritySecDeviceObj> mapUserIdx = indexByUserIdx.get(key);
if (mapUserIdx != null) {
List<ICFSecuritySecDeviceObj> toForget = new LinkedList<ICFSecuritySecDeviceObj>();
ICFSecuritySecDeviceObj cur = null;
Iterator<ICFSecuritySecDeviceObj> iter = mapUserIdx.values().iterator();
while (iter.hasNext()) {
cur = iter.next();
toForget.add(cur);
}
iter = toForget.iterator();
while (iter.hasNext()) {
cur = iter.next();
cur.forget(true);
}
}
indexByUserIdx.remove(key);
}
}
static void itTest4(Map s, int size, int pos) {
IdentityHashMap seen = new IdentityHashMap(size);
reallyAssert(s.size() == size);
int sum = 0;
timer.start("Iter XEntry ", size);
Iterator it = s.entrySet().iterator();
Object k = null;
Object v = null;
for (int i = 0; i < size - pos; ++i) {
Map.Entry x = (Map.Entry) (it.next());
k = x.getKey();
v = x.getValue();
seen.put(k, k);
if (x != MISSING) ++sum;
}
reallyAssert(s.containsKey(k));
it.remove();
reallyAssert(!s.containsKey(k));
while (it.hasNext()) {
Map.Entry x = (Map.Entry) (it.next());
Object k2 = x.getKey();
seen.put(k2, k2);
if (x != MISSING) ++sum;
}
reallyAssert(s.size() == size - 1);
s.put(k, v);
reallyAssert(seen.size() == size);
timer.finish();
reallyAssert(sum == size);
reallyAssert(s.size() == size);
}
public WebProgram createWebProgram(List asps, JavaProgram jp) throws Exception {
WebProgram wp = new WebProgram(asps, jp);
for (Iterator itr = asps.iterator(); itr.hasNext(); ) {
ASP asp = (ASP) itr.next();
asp.translate();
}
// do the WebForm initialisation code
List javaWebForms = wp.getWebForms();
Library library = jp.getLibrary();
for (Iterator itr = javaWebForms.iterator(); itr.hasNext(); ) {
JavaClass jc = (JavaClass) itr.next();
WebTranslator.addJavaComponentInitialisation(jc, library);
doExposePageLoadMethod(jc);
}
// do event hookups
List hookups = jp.getEventHookupClasses();
for (Iterator itr = hookups.iterator(); itr.hasNext(); ) {
EventSupport es = (EventSupport) itr.next();
// System.out.println(es.getVBSender());
for (Iterator itrr = asps.iterator(); itrr.hasNext(); ) {
ASP asp = (ASP) itrr.next();
DNVariable v = asp.getComponent(es.getVBSender().getName());
if (v != null) {
asp.addActionListenerFor(v, es.getName());
}
}
}
return wp;
}
