/openjdk7/jdk/make/sun/awt/ |
H A D | CondenseRules.awk | 2 previous=""; 8 if ($1 != previous) { 9 if (previous != "") { 12 previous = $1;
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/stream/buffer/ |
H A D | FragmentedArray.java | 37 FragmentedArray(T item, FragmentedArray<T> previous) { argument 39 if (previous != null) { 40 previous._next = this; 41 _previous = previous; 70 void setPrevious(FragmentedArray<T> previous) { argument 71 _previous = previous; 72 if (previous != null) { 73 previous._next = this;
|
/openjdk7/jdk/src/share/classes/java/text/ |
H A D | CharacterIterator.java | 56 * The methods previous() and next() are used for iteration. They return DONE if 76 * for(char c = iter.last(); c != CharacterIterator.DONE; c = iter.previous()) { 94 * c = iter.previous()) { 156 public char previous(); method in interface:CharacterIterator
|
H A D | CollationElementIterator.java | 176 * previous() updates the pointer first and then returns the element. This 178 * then call previous(), or call previous() and then call next()), you'll get 244 text.previous(); 254 text.previous(); 263 * Get the previous collation element in the string. <p>This iterator iterates 267 * collation element [or ordering priority] of the previous character in the 273 * iterating (i.e., call next() and then call previous(), or call previous() 277 public int previous() method in class:CollationElementIterator [all...] |
/openjdk7/jdk/test/java/util/AbstractList/ |
H A D | HasNextAfterException.java | 28 * true, after ListIterator.previous() causes 40 i.previous(); 47 + "List after ListIterator.previous().");
|
/openjdk7/corba/src/share/classes/com/sun/corba/se/spi/transport/ |
H A D | IIOPPrimaryToContactInfo.java | 59 * @param previous - if null return true. Otherwise, find previous in 66 ContactInfo previous, 71 * @param previous - if null then map primary to failover. If failover is 73 * non-empty then return failover. If previous is non-null that 74 * indicates that the previous failed. Therefore, find previous in 76 * previous to primary and return that <code>ContactInfo</code>. 79 ContactInfo previous, 65 hasNext(ContactInfo primary, ContactInfo previous, List contactInfos) argument 78 next(ContactInfo primary, ContactInfo previous, List contactInfos) argument
|
/openjdk7/jdk/test/java/lang/management/ThreadMXBean/ |
H A D | ResetPeakThreadCount.java | 71 long previous = mbean.getThreadCount(); 77 checkThreadCount(previous, current, DAEMON_THREADS_1); 78 previous = current; 83 checkThreadCount(previous, current, TERMINATE_1 * -1); 85 previous = current; 92 checkThreadCount(previous, current, DAEMON_THREADS_2); 93 previous = current; 102 checkThreadCount(previous, current, DAEMON_THREADS_3); 103 previous = current; 108 checkThreadCount(previous, curren 224 checkThreadCount(long previous, long current, int expectedDelta) argument [all...] |
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/ |
H A D | ThreadContext.java | 70 "previous" and "key" both null. There is a different sentinel 99 private /*final*/ ThreadContext previous; field in class:ThreadContext 103 private ThreadContext(ThreadContext previous, String key, Object value) { argument 104 this.previous = previous; 163 context = context.previous) { 261 context = context.previous) { 312 throw new IllegalArgumentException("previous context not empty");
|
/openjdk7/jdk/src/share/classes/sun/tools/jstat/ |
H A D | SymbolResolutionClosure.java | 55 String previous = e.toString(); 58 System.out.print("Expression: " + previous + " resolved to "
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | ListIterator.java | 35 * to {@code previous()} and the element that would be 46 * {@link #previous()}. 77 * or intermixed with calls to {@link #previous} to go back and forth. 78 * (Note that alternating calls to {@code next} and {@code previous} 89 * returns {@code true} if {@link #previous} would return an element 98 * Returns the previous element in the list and moves the cursor 102 * to {@code next} and {@code previous} will return the same 105 * @return the previous element in the list 106 * @throws NoSuchElementException if the iteration has no previous 109 E previous(); method in interface:ListIterator [all...] |
H A D | AbstractList.java | 206 if (it.previous()==null) 210 if (o.equals(it.previous())) 338 * previous. Reset to -1 if this element is deleted by a call 399 public E previous() { method in class:AbstractList.ListItr 403 E previous = get(i); 405 return previous; 585 * response to the {@code next}, {@code remove}, {@code previous}, 716 public E previous() { 718 return i.previous();
|
/openjdk7/jdk/src/share/classes/sun/awt/util/ |
H A D | IdentityLinkedList.java | 100 header.next = header.previous = header; 139 return header.previous.element; 159 return remove(header.previous); 281 Entry<E> predecessor = successor.previous; 287 successor.previous = predecessor; 300 e.next = e.previous = null; 304 header.next = header.previous = header; 378 e = e.previous; 421 for (Entry e = header.previous; e != header; e = e.previous) { 692 public E previous() { method in class:IdentityLinkedList.ListItr 750 Entry<E> previous; field in class:IdentityLinkedList.Entry 752 Entry(E element, Entry<E> next, Entry<E> previous) argument [all...] |
/openjdk7/jdk/test/java/util/LinkedList/ |
H A D | Remove.java | 28 * get screwed up by a remove() following a previous(). 41 e.previous();
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/serializer/ |
H A D | ElemContext.java | 107 /** The previous element "stack frame". */ 135 * @param previous The "stack frame" corresponding to the new 138 private ElemContext(final ElemContext previous) argument 140 m_prev = previous; 141 m_currentElemDepth = previous.m_currentElemDepth + 1;
|
/openjdk7/jdk/src/macosx/native/jobjc/src/generator/java/com/apple/internal/jobjc/generator/model/types/ |
H A D | TypeCache.java | 91 final Clazz previous = classesByName.put(obj.name, obj); 92 if(previous != null) 95 obj.name, obj.parent.name, previous.parent.name)); 99 final Struct previous = structsByName.put(obj.name, obj); 100 if(previous != null) 103 obj.name, obj.type, previous.type)); 107 final CFType previous = cfTypesByName.put(obj.name, obj); 108 if(previous != null) 111 obj.name, obj.type, previous.type)); 115 final Opaque previous [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/ |
H A D | Output.java | 104 private void transferAttribute(Output previous, String qname) { argument 105 if (!hasAttribute(qname) && previous.hasAttribute(qname)) { 106 addAttribute(qname, previous.getAttribute(qname)); 110 public void mergeOutput(Output previous) { argument 111 // Transfer attributes from previous xsl:output 112 transferAttribute(previous, "version"); 113 transferAttribute(previous, "method"); 114 transferAttribute(previous, "encoding"); 115 transferAttribute(previous, "doctype-system"); 116 transferAttribute(previous, "doctyp [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/ |
H A D | AttributeMap.java | 110 AttrImpl previous = null; 112 previous = (AttrImpl) nodes.get(i); 114 previous.ownerNode = ownerNode.ownerDocument(); 115 previous.isOwned(false); 117 previous.isSpecified(true); 127 ownerNode.ownerDocument().setAttrNode(argn, previous); 134 return previous; 179 AttrImpl previous = null; 181 previous = (AttrImpl) nodes.get(i); 183 previous [all...] |
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/serialization/ |
H A D | Printer.java | 78 InputGraph previous = null; 80 export(writer, graph, previous, true); 81 previous = graph; 87 public void export(XMLWriter writer, InputGraph graph, InputGraph previous, boolean difference) throws IOException { argument 96 if (previous != null) { 97 for (InputNode n : previous.getNodes()) { 128 if (previous != null) { 129 for (InputEdge e : previous.getEdges()) {
|
/openjdk7/jdk/src/share/classes/sun/text/normalizer/ |
H A D | CharacterIteratorWrapper.java | 97 * @see UCharacterIterator#previous() 99 public int previous() { method in class:CharacterIteratorWrapper 100 int i = iterator.previous();
|
H A D | UCharacterIterator.java | 169 previous(); 176 * Decrement to the position of the previous code unit in the 180 * @return the previous code unit in the text, or DONE if the new 184 public abstract int previous(); method in class:UCharacterIterator
|
/openjdk7/jdk/test/javax/management/MBeanServer/ |
H A D | PostRegisterDeadlockTest.java | 100 String previous = null; 136 if (failure == previous) 139 previous = failure; 169 if (failure == previous) 171 previous = failure;
|
/openjdk7/jdk/test/javax/swing/text/View/8014863/ |
H A D | bug8014863.java | 88 int previous; 92 previous = current; 97 } while (current != previous);
|
/openjdk7/make/scripts/ |
H A D | update_copyright_year.sh | 133 previous=`hg status|wc -l` 134 if [ ${previous} -ne 0 ] ; then 181 if [ ${previous} -eq 0 ] ; then 190 if [ ${previous} -ne 0 ] ; then
|
/openjdk7/jdk/src/share/classes/javax/imageio/metadata/ |
H A D | IIOMetadataNode.java | 278 * The previous (left) sibling node of this node, or 406 * Returns the previous sibling of this node, or <code>null</code> 407 * if this node has no previous sibling. 409 * @return the previous sibling, as a <code>Node</code>, or 475 IIOMetadataNode previous = null; 479 previous = this.lastChild; 483 previous = refChildNode.previousSibling; 487 if (previous != null) { 488 previous.nextSibling = newChildNode; 495 newChildNode.previousSibling = previous; [all...] |
/openjdk7/jdk/src/share/classes/sun/security/smartcardio/ |
H A D | PCSCTerminals.java | 131 private int current, previous; field in class:PCSCTerminals.ReaderState 134 previous = SCARD_STATE_UNAWARE; 140 previous = current; 144 return !present(previous) && present(current); 147 return present(previous) && !present(current);
|