public String toString(){ StringBuilder sb = new StringBuilder(); TIntObjectHashMap<TLinkedHashSet<String>> sets = new TIntObjectHashMap<TLinkedHashSet<String>>(); for(int i=0;i<alpahbet.size();i++){ int head = getHead(i); TLinkedHashSet<String> s = sets.get(head); if(s==null){ s = new TLinkedHashSet(); sets.put(head, s); } s.add(alpahbet.lookupString(i)); } TIntObjectIterator<TLinkedHashSet<String>> it = sets.iterator(); while(it.hasNext()){ it.advance(); if(it.value().size()<2) continue; sb.append(wordProb.get(it.key())); sb.append(" "); TObjectHashIterator<String> itt = it.value().iterator(); while(itt.hasNext()){ String ss = itt.next(); sb.append(ss); sb.append(" "); } sb.append("\n"); } return sb.toString(); }
/** * Expands the set to accommodate new values. * * @param newCapacity an <code>int</code> value */ @Override protected void rehash(int newCapacity) { TIntLinkedList oldOrder = new TIntLinkedList(order); int oldSize = size(); Object oldSet[] = _set; order.clear(); _set = new Object[newCapacity]; Arrays.fill(_set, FREE); for (TIntIterator iterator = oldOrder.iterator(); iterator.hasNext();) { int i = iterator.next(); E o = (E) oldSet[i]; if (o == FREE || o == REMOVED) { throw new IllegalStateException("Iterating over empty location while rehashing"); } if (o != FREE && o != REMOVED) { int index = insertKey(o); if (index < 0) { // everyone pays for this because some people can't RTFM throwObjectContractViolation(_set[(-index - 1)], o, size(), oldSize, oldSet); } if (!order.add(index)) throw new IllegalStateException("Order not changed after insert"); } } }
/** * Inserts a value into the set. * * @param obj an <code>Object</code> value * @return true if the set was modified by the add operation */ @Override public boolean add(E obj) { int index = insertKey(obj); if (index < 0) { return false; // already present in set, nothing to add } if (!order.add(index)) throw new IllegalStateException("Order not changed after insert"); postInsertHook(consumeFreeSlot); return true; // yes, we added something }
@Override public String toString() { final StringBuilder buf = new StringBuilder("{"); boolean first = true; for (Iterator<E> it = iterator(); it.hasNext();) { if (first) { first = false; } else { buf.append(", "); } buf.append(it.next()); } buf.append("}"); return buf.toString(); }
/** * Removes the last entry returned by the iterator. * Invoking this method more than once for a single entry * will leave the underlying data structure in a confused * state. */ @Override public void remove() { // Remove for iterator first localIterator.remove(); // the removal within removeAt() will not change the collection // but the localIterator will remain valid try { _hash.tempDisableAutoCompaction(); TLinkedHashSet.this.removeAt(lastIndex); } finally { _hash.reenableAutoCompaction(false); } } }; //To change body of overridden methods use File | Settings | File Templates.
/** * Adds a new {@code IModelChangeListener}. * * @param listener * The added listener. * @see IModelProvider#addModelChangeListener(IModelChangeListener) */ public synchronized void addModelChangeListener(IModelChangeListener listener) { if (listener != null) { if (listeners == null) { listeners = new TLinkedHashSet<>(); } if (!listeners.contains(listener)) { listeners.add(listener); } } }
protected ItemToolCore addToolClass(String string) { toolClasses.add(string); return this; }
@Override public String toString() { final StringBuilder buf = new StringBuilder("{"); boolean first = true; for (Iterator<E> it = iterator(); it.hasNext();) { if (first) { first = false; } else { buf.append(", "); } buf.append(it.next()); } buf.append("}"); return buf.toString(); }
/** * Removes the last entry returned by the iterator. * Invoking this method more than once for a single entry * will leave the underlying data structure in a confused * state. */ @Override public void remove() { // Remove for iterator first localIterator.remove(); // the removal within removeAt() will not change the collection // but the localIterator will remain valid try { _hash.tempDisableAutoCompaction(); TLinkedHashSet.this.removeAt(lastIndex); } finally { _hash.reenableAutoCompaction(false); } } }; //To change body of overridden methods use File | Settings | File Templates.
/** * {@inheritDoc} */ @Override public Collection<String> getServiceContractClassNames() { Set<String> serviceContractClassNames = new TLinkedHashSet<>(1); if (serviceContracts != null) { for (Class<?> serviceContract : serviceContracts) { serviceContractClassNames.add(serviceContract.getName()); } } else { if (serviceDelegateClassNames != null) { serviceContractClassNames.addAll(serviceDelegateClassNames.keySet()); } if (serviceDelegateBeanNames != null) { serviceContractClassNames.addAll(serviceDelegateBeanNames.keySet()); } } return serviceContractClassNames; }
/** * Expands the set to accommodate new values. * * @param newCapacity an <code>int</code> value */ @Override protected void rehash(int newCapacity) { TIntLinkedList oldOrder = new TIntLinkedList(order); int oldSize = size(); Object oldSet[] = _set; order.clear(); _set = new Object[newCapacity]; Arrays.fill(_set, FREE); for (TIntIterator iterator = oldOrder.iterator(); iterator.hasNext();) { int i = iterator.next(); E o = (E) oldSet[i]; if (o == FREE || o == REMOVED) { throw new IllegalStateException("Iterating over empty location while rehashing"); } if (o != FREE && o != REMOVED) { int index = insertKey(o); if (index < 0) { // everyone pays for this because some people can't RTFM throwObjectContractViolation(_set[(-index - 1)], o, size(), oldSize, oldSet); } if (!order.add(index)) throw new IllegalStateException("Order not changed after insert"); } } }
/** * Inserts a value into the set. * * @param obj an <code>Object</code> value * @return true if the set was modified by the add operation */ @Override public boolean add(E obj) { int index = insertKey(obj); if (index < 0) { return false; // already present in set, nothing to add } if (!order.add(index)) throw new IllegalStateException("Order not changed after insert"); postInsertHook(consumeFreeSlot); return true; // yes, we added something }
@Override public String toString() { final StringBuilder buf = new StringBuilder("{"); boolean first = true; for (Iterator<E> it = iterator(); it.hasNext();) { if (first) { first = false; } else { buf.append(", "); } buf.append(it.next()); } buf.append("}"); return buf.toString(); }
/** * Removes the last entry returned by the iterator. * Invoking this method more than once for a single entry * will leave the underlying data structure in a confused * state. */ @Override public void remove() { // Remove for iterator first localIterator.remove(); // the removal within removeAt() will not change the collection // but the localIterator will remain valid try { _hash.tempDisableAutoCompaction(); TLinkedHashSet.this.removeAt(lastIndex); } finally { _hash.reenableAutoCompaction(false); } } }; //To change body of overridden methods use File | Settings | File Templates.
synchronized (renderedPropertiesLock) { if (renderedProperties == null) { Set<String> renderedPropertiesSet = new TLinkedHashSet<>(1); List<IComponentDescriptor<?>> ancestorDescs = getAncestorDescriptors(); if (ancestorDescs != null) {
/** * Expands the set to accommodate new values. * * @param newCapacity an <code>int</code> value */ @Override @SuppressWarnings("unchecked") protected void rehash(int newCapacity) { TIntLinkedList oldOrder = new TIntLinkedList(order); int oldSize = size(); Object oldSet[] = _set; order.clear(); _set = new Object[newCapacity]; Arrays.fill(_set, FREE); for (TIntIterator iterator = oldOrder.iterator(); iterator.hasNext();) { int i = iterator.next(); E o = (E) oldSet[i]; if (o == FREE || o == REMOVED) { throw new IllegalStateException("Iterating over empty location while rehashing"); } if (o != FREE && o != REMOVED) { int index = insertKey(o); if (index < 0) { // everyone pays for this because some people can't RTFM throwObjectContractViolation(_set[(-index - 1)], o, size(), oldSize, oldSet); } if (!order.add(index)) throw new IllegalStateException("Order not changed after insert"); } } }
/** * Inserts a value into the set. * * @param obj an <code>Object</code> value * @return true if the set was modified by the add operation */ @Override public boolean add(E obj) { int index = insertKey(obj); if (index < 0) { return false; // already present in set, nothing to add } if (!order.add(index)) throw new IllegalStateException("Order not changed after insert"); postInsertHook(consumeFreeSlot); return true; // yes, we added something }
/** * {@inheritDoc} */ @Override public List<String> getQueryableProperties() { if (queryableProperties == null) { synchronized (queryablePropertiesLock) { if (queryableProperties == null) { Set<String> queryablePropertiesSet = new TLinkedHashSet<>(1); List<IComponentDescriptor<?>> ancestorDescs = getAncestorDescriptors(); if (ancestorDescs != null) { for (IComponentDescriptor<?> ancestorDescriptor : ancestorDescs) { queryablePropertiesSet.addAll(ancestorDescriptor.getQueryableProperties()); } } for (String renderedProperty : getRenderedProperties()) { IPropertyDescriptor declaredPropertyDescriptor = getDeclaredPropertyDescriptor(renderedProperty); if (declaredPropertyDescriptor != null && declaredPropertyDescriptor.isQueryable()) { queryablePropertiesSet.add(renderedProperty); } } queryableProperties = new ArrayList<>(queryablePropertiesSet); } } } return explodeComponentReferences(this, queryableProperties); }
Collection<Object> newPropertyElementsToAdd = new TLinkedHashSet<>(1); Collection<Object> propertyElementsToKeep = new THashSet<>(1);