Examples of peek()

Examples of com.sun.enterprise.util.collection.ArrayListStack.peek()

786
787
788
789
790
791
792
793
794
795
796
            return true;
        }
        */
        // return ((Integer) stack.peek() == NULL_CTX);
        ArrayListStack stack = (ArrayListStack) threadLocalState[NULL_CTX_SLOT];
        return ((Integer) stack.peek() == NULL_CTX);
        // IASRI 4698847 END
    }

    public static boolean isNullContext(PropagationContext ctx) {
        return (ctx.current.coord == null && ctx.current.term == null);
View Full Code Here

Examples of com.sun.faces.component.CompositeComponentStackManager.peek()

109
110
111
112
113
114
115
116
117
118
119
                    // need to alter the behavior so that the components behave
                    // as the user would expect.
                    /* BEGIN DEVIATION */
                    CompositeComponentStackManager manager =
                          CompositeComponentStackManager.getManager(facesContext);
                    Object o = manager.peek();
                    /* END DEVIATION */
                    if (o == null) {
                        o = UIComponent.getCurrentCompositeComponent(facesContext);
                    }
                    context.setPropertyResolved(o != null);
View Full Code Here

Examples of com.surftools.BeanstalkClient.Client.peek()

670
671
672
673
674
675
676
677
678
679
680
    Client client = new ClientImpl(TEST_HOST, TEST_PORT);

    Object[] tubeNames = pushWatchedTubes(client);
    client.useTube((String) tubeNames[1]);

    Job job = client.peek(-1);
    assertNull(job);
    job = client.peek(0);
    assertNull(job);

    String srcString = "testPeek-";
View Full Code Here

Examples of com.volantis.synergetics.cornerstone.stack.ArrayListStack.peek()

743
744
745
746
747
748
749
750
751
752
753
                stack.push(parent);
                parent = parent.getParent();
            } while (parent != null);

            // Remove the fake parent node if there is one.
            Node top = (Node) stack.peek();
            if (top instanceof Element && ((Element) top).getName() == null) {
                stack.pop();
            }

            StringBuffer path = new StringBuffer();
View Full Code Here

Examples of com.volantis.synergetics.cornerstone.stack.Stack.peek()

123
124
125
126
127
128
129
130
131
132
133
    public DefinitionScope getDefinitionScope(DefinitionType definitionType) {
        DefinitionScope scope = null;
        Stack scopeStack = (Stack) type2ScopeStack.get(definitionType);
        if (scopeStack != null) {
            scope = (DefinitionScope) scopeStack.peek();
        }
        return scope;
    }

    // Javadoc inherited.
View Full Code Here

Examples of dtool.util.JsonReaderExt.peek()

47
48
49
50
51
52
53
54
55
56
57
      jsonParser.setLenient(true);
     
      readData(jsonParser);
     
      jsonParser.consumeExpected(JsonToken.END_DOCUMENT);
      assertTrue(jsonParser.peek() == JsonToken.END_DOCUMENT);
    } catch (IOException e) {
      throw new DubBundleException(e);
    }
  }
 
View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.Queue.peek()

51
52
53
54
55
56
57
58
59
60
61
        queue.add(event); // enqueue

        if (queue.size() == 1) {
            event.run();
            queue.poll(); // dequeue current runnable
            for (Runnable task = null; (task = (Runnable) queue.peek()) != null; queue
                    .poll())
                task.run();
        }
    }
}
View Full Code Here

Examples of gnu.trove.stack.TIntStack.peek()

339
340
341
342
343
344
345
346
347
348
349
    float furthestDistanceSq = furthestDistance * furthestDistance;

    while (parents.size() > 0) {
      Node n = getNode(parents.peek());
      int startIndex = parentsEntry.peek() + 1;

      if (!n.isLeaf()) {
        // go through every entry in the index node to check
        // if it could contain an entry closer than the farthest entry
        // currently stored.
View Full Code Here

Examples of gnu.trove.stack.array.TIntArrayStack.peek()

339
340
341
342
343
344
345
346
347
348
349
    float furthestDistanceSq = furthestDistance * furthestDistance;

    while (parents.size() > 0) {
      Node n = getNode(parents.peek());
      int startIndex = parentsEntry.peek() + 1;

      if (!n.isLeaf()) {
        // go through every entry in the index node to check
        // if it could contain an entry closer than the farthest entry
        // currently stored.
View Full Code Here

Examples of java.util.ArrayDeque.peek()

25
26
27
28
29
30
31
32
33
34
35
    @Test
    public void peek() throws Exception {
        ArrayDeque deque = create();
        assert deque.size() == 4;
        assert deque.peek().equals("1");
        assert deque.peekFirst().equals("1");
        assert deque.peekLast().equals("4");
        assert deque.size() == 4;
    }
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.