Examples of pop()

Examples of org.apache.commons.digester.Digester.pop()

60
61
62
63
64
65
66
67
68
69
70
     * ȡ��validator���б�
     */
    public synchronized Map loadValidatorClasses() {
        Digester digester = loadValidatorPlugins();

        return (Map) digester.pop();
    }

    /**
     * ������ȡdescriptor��digester��
     */
 
View Full Code Here

Examples of org.apache.commons.digester3.Digester.pop()

491
492
493
494
495
496
497
498
499
500
501
        String testStackName = "org.apache.commons.digester3.tests.testNamedStackPushPeekPop";
        Digester digester = new Digester();
        assertTrue( "Stack starts empty:", digester.isEmpty( testStackName ) );
        digester.push( testStackName, archimedesAveragePi );
        assertEquals( "Peeked value:", archimedesAveragePi, digester.peek( testStackName ) );
        assertEquals( "Popped value:", archimedesAveragePi, digester.pop( testStackName ) );
        assertTrue( "Stack ends empty:", digester.isEmpty( testStackName ) );

        digester.push( testStackName, "1" );
        digester.push( testStackName, "2" );
        digester.push( testStackName, "3" );
View Full Code Here

Examples of org.apache.derby.iapi.services.compiler.MethodBuilder.pop()

73
74
75
76
77
78
79
80
81
82
83
        // Compile the query, if one is specified.
        if (xmlQuery == null) {
            // No query. The SqlXmlUtil instance is still on the stack. Pop it
            // to restore the initial state of the stack.
            constructor.pop();
        } else {
            // Compile the query. This will consume the SqlXmlUtil instance
            // and leave the stack in its initial state.
            constructor.push(xmlQuery);
            constructor.push(xmlOpName);
View Full Code Here

Examples of org.apache.directory.server.core.invocation.InvocationStack.pop()

1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
   
    private void pop()
    {
        // TODO - need to remove Context caller and PartitionNexusProxy from Invocations
        InvocationStack stack = InvocationStack.getInstance();
        stack.pop();
    }


    private void push( OperationContext opContext )
    {
View Full Code Here

Examples of org.apache.hivemind.schema.SchemaProcessor.pop()

219
220
221
222
223
224
225
226
227
228
229
    {
        SchemaProcessor sp = new SchemaProcessorImpl(null, null);

        // The sp is pushed onto the stack itself

        sp.pop();

        try
        {
            sp.pop();
            unreachable();
View Full Code Here

Examples of org.apache.ldap.server.invocation.InvocationStack.pop()

163
164
165
166
167
168
169
170
171
172
173
        {
            return this.configuration.getInterceptorChain().getMatchedName( dn, normalized );
        }
        finally
        {
            stack.pop();
        }
    }


    public Name getSuffix( Name dn, boolean normalized) throws NamingException
View Full Code Here

Examples of org.apache.lucene.facet.TopOrdAndFloatQueue.pop()

138
139
140
141
142
143
144
145
146
147
148
      // Our sum'd dim count is accurate, so we keep it
    }

    LabelAndValue[] labelValues = new LabelAndValue[q.size()];
    for(int i=labelValues.length-1;i>=0;i--) {
      TopOrdAndFloatQueue.OrdAndValue ordAndValue = q.pop();
      FacetLabel child = taxoReader.getPath(ordAndValue.ord);
      labelValues[i] = new LabelAndValue(child.components[cp.length], ordAndValue.value);
    }

    return new FacetResult(dim, path, sumValues, labelValues, childCount);
View Full Code Here

Examples of org.apache.lucene.facet.TopOrdAndIntQueue.pop()

133
134
135
136
137
138
139
140
141
142
143
    BytesRef scratch = new BytesRef();

    LabelAndValue[] labelValues = new LabelAndValue[q.size()];
    for(int i=labelValues.length-1;i>=0;i--) {
      TopOrdAndIntQueue.OrdAndValue ordAndValue = q.pop();
      dv.lookupOrd(ordAndValue.ord, scratch);
      String[] parts = FacetsConfig.stringToPath(scratch.utf8ToString());
      labelValues[i] = new LabelAndValue(parts[1], ordAndValue.value);
    }
View Full Code Here

Examples of org.apache.lucene.search.spell.SuggestWordQueue.pop()

424
425
426
427
428
429
430
431
432
433
434
      Token token = new Token(original, suggestion.getStartOffset(), suggestion.getEndOffset());

      // get top 'count' suggestions out of 'sugQueue.size()' candidates
      SuggestWord[] suggestions = new SuggestWord[Math.min(count, sugQueue.size())];
      // skip the first sugQueue.size() - count elements
      for (int k=0; k < sugQueue.size() - count; k++) sugQueue.pop();
      // now collect the top 'count' responses
      for (int k = Math.min(count, sugQueue.size()) - 1; k >= 0; k--)  {
        suggestions[k] = sugQueue.pop();
      }
View Full Code Here

Examples of org.apache.lucene.util.PriorityQueue.pop()

813
814
815
816
817
818
819
820
821
822
823
        PriorityQueue pq = retrieveTerms(docNum);
        Object cur;
        // have to be careful, retrieveTerms returns all words but that's probably not useful to our caller...
        int lim = maxQueryTerms;
        // we just want to return the top words
        while (((cur = pq.pop()) != null) && lim-- > 0) {
            Object[] ar = (Object[]) cur;
            al.add(ar[0]); // the 1st entry is the interesting word
        }
        String[] res = new String[al.size()];
        return (String[]) al.toArray(res);
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.