/openjdk7/jdk/src/share/classes/com/sun/jndi/toolkit/ctx/ |
H A D | HeadTail.java | 38 private Name tail; field in class:HeadTail 40 public HeadTail(Name head, Name tail) { argument 41 this(head, tail, 0); 44 public HeadTail(Name head, Name tail, int status) { argument 47 this.tail = tail; 59 return this.tail;
|
H A D | StringHeadTail.java | 36 private String tail; field in class:StringHeadTail 38 public StringHeadTail(String head, String tail) { argument 39 this(head, tail, 0); 42 public StringHeadTail(String head, String tail, int status) { argument 45 this.tail = tail; 57 return this.tail;
|
H A D | ComponentContext.java | 87 * and the entire name as the tail. 91 * head is the empty name and tail is the entire name. 94 * the components as tail. 115 Name head, tail; 119 tail = name.getSuffix(separator); 123 tail = null; 131 return new HeadTail(head, tail); 378 Name tail = p.getTail(); 381 if (tail == null || tail [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/rngom/digested/ |
H A D | DContainerPattern.java | 58 private DPattern tail; field in class:DContainerPattern 65 return tail; 95 if(tail==null) { 97 head = tail = child; 99 child.prev = tail; 100 tail.next = child; 102 tail = child;
|
/openjdk7/jdk/src/share/classes/sun/awt/geom/ |
H A D | ChainEnd.java | 30 CurveLink tail; field in class:ChainEnd 36 this.tail = first; 79 enter.tail.setNext(exit.head); 80 enter.tail = exit.tail; 91 enter.tail.setNext(otherenter.head); 94 otherexit.tail.setNext(enter.head); 95 otherexit.tail = enter.tail; 102 tail [all...] |
/openjdk7/jdk/test/java/util/LinkedList/ |
H A D | AddAll.java | 35 List tail = Collections.nCopies(4, "basic food group"); 38 l1.addAll(tail); 39 l2.addAll(tail);
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/api/server/ |
H A D | ServerPipelineHook.java | 59 * @param tail 66 * The default implementation just returns <tt>tail</tt>, which means 70 public @NotNull Pipe createMonitoringPipe(ServerPipeAssemblerContext ctxt, @NotNull Pipe tail) { argument 71 return tail; 85 * @param tail 92 * The default implementation just returns <tt>tail</tt>, which means 96 public @NotNull Pipe createSecurityPipe(ServerPipeAssemblerContext ctxt, @NotNull Pipe tail) { argument 97 return tail;
|
/openjdk7/jdk/src/share/classes/com/sun/jmx/remote/internal/ |
H A D | ArrayQueue.java | 36 this.tail = 0; 52 this.tail = size; 61 queue[tail] = o; 62 int newtail = (tail + 1) % capacity; 65 tail = newtail; 72 if (head == tail) 92 int diff = tail - head; 101 private int tail; field in class:ArrayQueue
|
/openjdk7/jdk/src/share/classes/sun/misc/ |
H A D | Queue.java | 43 QueueElement tail = null; field in class:Queue 57 tail = newElt; 91 while (tail == null) { 94 QueueElement elt = tail; 95 tail = elt.prev; 96 if (tail == null) { 99 tail.next = null; 110 return (tail == null); 135 " tail = "+(tail [all...] |
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/ |
H A D | List.java | 43 * <p>Lists are always trailed by a sentinel element, whose head and tail 61 public List<A> tail; field in class:List 63 /** Construct a list given its head and tail. 65 List(A head, List<A> tail) { argument 66 this.tail = tail; 78 public List<Object> setTail(List<Object> tail) { 138 return tail == null; 145 return tail != null; 154 while (l.tail ! 165 setTail(List<A> tail) argument [all...] |
H A D | ListBuffer.java | 106 List<A> p = elems = new List<A>(elems.head, elems.tail); 108 List<A> tail = p.tail; 109 if (tail == null) break; 110 tail = new List<A>(tail.head, tail.tail); 111 p.setTail(tail); 112 p = tail; [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/api/client/ |
H A D | ClientPipelineHook.java | 59 * @param tail 66 * The default implementation just returns <tt>tail</tt>, which means 70 public @NotNull Pipe createSecurityPipe(ClientPipeAssemblerContext ctxt, @NotNull Pipe tail) { argument 71 return tail;
|
/openjdk7/langtools/test/tools/javac/generics/odersky/ |
H A D | List.java | 33 public List<A> tail; field in class:List 35 /** Construct a list given its head and tail. 37 public List(A head, List<A> tail) { argument 38 this.tail = tail; 88 return tail == null; 94 return tail != null; 102 while (l.tail != null) { 103 l = l.tail; 122 else return this.prependList(xs.tail) [all...] |
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | freeList.cpp | 38 // of space in the heap. The head and tail are maintained so that 40 // at the tail of the list and removed from the head of the list to 89 assert(tail() == NULL || tail()->next() == NULL, "list invariant"); 97 } else { // removed tail of list 104 assert(tail() == NULL || tail()->next() == NULL, "list invariant"); 131 // Now we can fix up the tail. 147 assert(tail() == NULL || tail() [all...] |
/openjdk7/jdk/src/share/native/sun/font/layout/ |
H A D | LEInsertionList.cpp | 51 : head(NULL), tail(NULL), growAmount(0), append(rightToLeft) 53 tail = (InsertionRecord *) &head; 70 tail = (InsertionRecord *) &head; 99 tail->next = insertion; 100 tail = insertion;
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | ArrayDeque.java | 92 * thus avoiding head and tail wrapping around to equal each 101 * arbitrary number equal to tail if the deque is empty. 106 * The index at which the next element would be added to the tail 109 private transient int tail; field in class:ArrayDeque 145 * when head and tail have wrapped around to become equal. 148 assert head == tail; 160 tail = n; 171 if (head < tail) { 173 } else if (head > tail) { 176 System.arraycopy(elements, 0, a, headPortionLen, tail); [all...] |
/openjdk7/jdk/src/share/classes/com/sun/jndi/ldap/ |
H A D | EventQueue.java | 64 private QueueElement tail = null; field in class:EventQueue 95 tail = newElt; 114 while (tail == null) 116 QueueElement elt = tail; 117 tail = elt.prev; 118 if (tail == null) { 121 tail.next = null;
|
H A D | ServiceLocator.java | 192 int tail = 0; 199 // find the head and tail of the list of records having the same 206 tail = i; 209 sublistLength = (tail - head) + 1; 211 hostports[k++] = selectHostport(srvRecords, head, tail); 218 * Randomly select a service record in the range [head, tail] and return 222 int tail) { 223 if (head == tail) { 227 // compute the running sum for records between head and tail 229 for (int i = head; i <= tail; 221 selectHostport(SrvRecord[] srvRecords, int head, int tail) argument [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/mimepull/ |
H A D | DataHead.java | 46 volatile Chunk head, tail; field in class:DataHead 71 if (tail != null) { 72 tail = tail.createNext(this, buf); 74 head = tail = new Chunk(new MemoryData(buf, part.msg.config)); 102 head = tail = null; 123 while(tail == null) { 173 while(tail == null) { 174 if (!part.msg.makeProgress() && tail == null) {
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/ws/processor/model/jaxb/ |
H A D | Util.java | 41 char tail = macro.charAt(i+1); 43 if('0'<=ch2 && ch2<='9' && tail==':') {
|
/openjdk7/jdk/src/share/instrument/ |
H A D | JarFacade.c | 43 jarAttribute* tail; member in struct:__anon544 91 context->tail->next = attribute; 93 context->tail = attribute;
|
/openjdk7/langtools/test/tools/javac/unit/util/list/ |
H A D | FromArray.java | 45 ss = ss.tail;
|
/openjdk7/jdk/src/share/native/sun/awt/debug/ |
H A D | debug_mem.c | 142 static void DMem_VerifyTail(MemoryBlockTail * tail) { argument 143 DASSERTMSG( DMem_ClientCheckPtr(tail, sizeof(MemoryBlockTail)), "Tail corruption, invalid pointer"); 144 DASSERTMSG( DMem_VerifyGuardArea(tail->guard), "Tail corruption, possible overwrite" ); 149 MemoryBlockTail * tail; local 161 /* check the tail of the block for overruns */ 162 tail = (MemoryBlockTail *) ( (byte_t *)memptr + header->size ); 163 DMem_VerifyTail(tail); 200 MemoryBlockTail * tail; local 241 tail = (MemoryBlockTail *)(memptr + size); 242 memset(tail [all...] |
/openjdk7/jdk/test/com/sun/tools/attach/ |
H A D | ApplicationSetup.sh | 54 realpid=`ps -p ${pid} | tail -1 | awk '{print $4;}'` 65 port=`tail -1 ${OUTPUTFILE} | sed -e 's@\\r@@g' `
|
/openjdk7/jdk/src/share/classes/sun/security/krb5/ |
H A D | KrbServiceLocator.java | 203 int tail = 0; 210 // find the head and tail of the list of records having the same 217 tail = i; 220 sublistLength = (tail - head) + 1; 222 hostports[k++] = selectHostport(srvRecords, head, tail); 229 * Randomly select a service record in the range [head, tail] and return 233 int tail) { 234 if (head == tail) { 238 // compute the running sum for records between head and tail 240 for (int i = head; i <= tail; 232 selectHostport(SrvRecord[] srvRecords, int head, int tail) argument [all...] |