Examples of java.util.TreeMap$State

java.util.TreeMap
A state object which is passed down the tree for both insert and remove. All uses make use of the done flag to indicate when no further rebalancing of the tree is required. Remove methods use the found flag to indicate when the desired key has been found. value is used both to return the value of a removed node as well as to pass in a value which must match (used for entrySet().remove(entry)), and the matchValue flag is used to request this behavior. @param < V> value type

    *           weak reference.
    */
   public Timeout(String name, boolean useWeakReference) {
      super(name);
      this.useWeakReference = useWeakReference;
      this.map = new TreeMap();
      setDaemon(true);
      start();
      while (!ready) { // We block until our timer thread is ready
         try {
            Thread.sleep(1);

View Full Code Here

            { // loop over all record types in the role of a
              // preceding
              // record containg an existance indicator for a
              // suceeding
              // record type
              TreeMap existanceIndicators = ((TreeMap[]) checkInfos[1])[i];
              // the existance indicators from one specific record
              // type to others
              if (existanceIndicators != null)
              { // some existance indicators depending on fields
                // on
                // this record type
                // Look if all of them point to existing fields.
                Iterator it = existanceIndicators.values()
                    .iterator();
                while (it.hasNext())
                { // loop over all existance indicators for
                  // each
                  // record type

View Full Code Here


    Hashtable keys = (Hashtable) sections.get(section);


    if (keys != null)
    {
      return new TreeMap(keys);
    }
    else
    {
      return null;
    }

View Full Code Here


    Hashtable keys = (Hashtable) sections.get("Variable");


    if (keys != null)
    {
      variablesConf = new TreeMap(keys);
    }
    else
    {
      return null;
    }

View Full Code Here

     */
    protected Map handleGetAllMessages()
    {


        final boolean normalize = this.isNormalizeMessages();
        final Map messages = (normalize) ? (Map)new TreeMap() : (Map)new LinkedHashMap();


        // - only retrieve the messages for the entry use case (i.e. the use case 
        //   where the application begins)
        if (this.isEntryUseCase())
        {

View Full Code Here

     * Populates the property descriptor table by merging the 
     * lists of Property descriptors.
     */ 
    private void processPropertyDescriptors() {
  if (properties == null) {
      properties = new TreeMap();
  }


  List list;


  PropertyDescriptor pd, gpd, spd;

View Full Code Here


        while (i.hasNext()) {
            topNode.add(new DefaultMutableTreeNode((String) i.next()));
        }


        TreeMap plugins = PreferencesDialog.getPluginPanels();
        if (plugins.size() > 0) {
            pluginsNode = new DefaultMutableTreeNode(resources
                    .getString("pluginPreferences"));
            i = plugins.keySet().iterator();
            while (i.hasNext()) {
                pluginsNode.add(new DefaultMutableTreeNode((String) i.next()));
            }
            root.add(pluginsNode);
        }

View Full Code Here

                group = "zzz Contacts";
            } else if (group.equals(resources.getString("transportsGroup"))) {
                group = "zzzz Agents/Transports";
            }


            buddyGroups.put(group, new TreeMap());


            int count = 0;


            // find the index of the newly sorted group
            Iterator i = buddyGroups.keySet().iterator();

View Full Code Here

                    name = "zzz9555 " + name;
                }
            }


            if (buddyGroups.get(group) == null) {
                buddyGroups.put(group, new TreeMap());
            }


            ((TreeMap) buddyGroups.get(group)).put(name, buddy.getUser());


            int count = 0;

View Full Code Here

            name = buddy.getUser();
        }
        String jid = buddy.getUser();


       // synchronized (buddyGroups) {
            TreeMap buddies = ((TreeMap) buddyGroups.get(group));
            Iterator i = buddies.keySet().iterator();
            while (i.hasNext()) {
                String key = (String) i.next();
                if (buddies.get(key).equals(jid)) {
                    ((TreeMap) buddyGroups.get(group)).remove(key);
                    break;
                }
            }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.TreeMap$State

ar.com.fdvs.dj.domain.DynamicJasperDesign

com.alibaba.fastjson.parser.deserializer.DefaultObjectDeserializer

com.antlersoft.opentool.ProjectBBQ$ResultArea

com.canoo.webtest.plugins.pdftest.htmlunit.pdfbox.PdfBoxPDFPage

com.dooapp.gaedo.utils.Utils

com.esotericsoftware.kryo.MapSerializerTest

com.esotericsoftware.kryo.serializers.DefaultSerializers$TreeMapSerializer

com.espertech.esper.epl.join.exec.composite.CompositeAccessStrategyGE

com.espertech.esper.epl.join.exec.composite.CompositeAccessStrategyLE

com.espertech.esper.epl.join.exec.composite.CompositeAccessStrategyLT

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.