Package java.util

Examples of java.util.Hashtable.elements()


    openJJTreeComment(io, null);
    io.println();

    Hashtable thrown_set = new Hashtable();
    findThrown(ns, thrown_set, expansion_unit);
    Enumeration thrown_names = thrown_set.elements();
    insertCatchBlocks(ns, io, thrown_names, indent);

    io.println(indent + "} {");
    if (ns.usesCloseNodeVar()) {
      io.println(indent + "  if (" + ns.closedVar + ") {");
View Full Code Here


    openJJTreeComment(io, null);
    io.println();

    Hashtable thrown_set = new Hashtable();
    findThrown(ns, thrown_set, expansion_unit);
    Enumeration thrown_names = thrown_set.elements();
    insertCatchBlocks(ns, io, thrown_names, indent);

    io.println(indent + "} finally {");
    if (ns.usesCloseNodeVar()) {
      io.println(indent + "  if (" + ns.closedVar + ") {");
View Full Code Here

        }
       
        Hashtable h = Gateway.get(connection.getProperties()).readTableValue(sqp.getTable(),sqp.getIncludeAllList(),sqp.getSelectList(),sqp.getEitherOrAllList(),sqp.isDistinct(),sqp);
    if (h == null) return true;
    Vector r = new EZArrayList(h.elements());
   
    Enumeration en = h.keys();
    String rid = null;
    Vector ul = null;
    NameValue nv = null;
View Full Code Here

        nvp.put("count(*)",h.get("jiql_row_count"));
      r = new EZArrayList();
      r.add(nvp);
    }
    else
    r = new EZArrayList(h.elements());
    //union. (r);

    sqp.setResults(r);
    jiqlDBMgr.get(sqp.getProperties()).getCommand("SortResult").execute(sqp);

View Full Code Here

        this.tagFiles = new TagFileInfo[tagFileVector.size()];
        tagFileVector.copyInto(this.tagFiles);

        this.functions = new FunctionInfo[functionTable.size()];
        int i = 0;
        Enumeration enumeration = functionTable.elements();
        while (enumeration.hasMoreElements()) {
            this.functions[i++] = (FunctionInfo) enumeration.nextElement();
        }
    }
View Full Code Here

            // Need to hold sync while linear searching the hash table.
            synchronized (trans_hashtable)
            {
                int i = 0;

                for (Enumeration e = trans_hashtable.elements();
                     e.hasMoreElements(); i++)
                {
                    Xact xact =
                        ((TransactionTableEntry) e.nextElement()).getXact();
View Full Code Here

                }

            } else {
                Slide slide = (Slide) slides.get(slides.size() - 1);

                for (Enumeration enumeration = containerTextBox.elements(); enumeration
                        .hasMoreElements();) {
                    final TextBox textBox = (TextBox) enumeration.nextElement();
                    slide.addContent(textBox.getContent());
                }
View Full Code Here

      Vector lens = new Vector();
      int version = 0;

      synchronized (cookie_list)
      {
         Enumeration list = cookie_list.elements();
         Vector remove_list = null;

         while (list.hasMoreElements())
         {
            Cookie cookie = (Cookie)list.nextElement();
View Full Code Here

         {
            Hashtable cntxt = (Hashtable)cntxt_list.nextElement();
            synchronized (cntxt)
            {
               cookies = Util.resizeArray(cookies, idx + cntxt.size());
               Enumeration cookie_list = cntxt.elements();
               while (cookie_list.hasMoreElements())
                  cookies[idx++] = (Cookie)cookie_list.nextElement();
            }
         }
View Full Code Here

      synchronized (cookie_list)
      {
         Cookie[] cookies = new Cookie[cookie_list.size()];
         int idx = 0;

         Enumeration en = cookie_list.elements();
         while (en.hasMoreElements())
            cookies[idx++] = (Cookie)en.nextElement();

         return cookies;
      }
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.