1 /* =============================================================================
4 * -- Sorted singly linked list
5 * -- Options: duplicate allowed
6 * (DLIST_NO_DUPLICATES) is no implemented yet (default: allow duplicates)
8 * =============================================================================
10 * Copyright (C) Stanford University, 2006. All Rights Reserved.
11 * Author: Chi Cao Minh
13 * =============================================================================
15 * For the license of bayes/sort.h and bayes/sort.c, please see the header
18 * ------------------------------------------------------------------------
20 * For the license of kmeans, please see kmeans/LICENSE.kmeans
22 * ------------------------------------------------------------------------
24 * For the license of ssca2, please see ssca2/COPYRIGHT
26 * ------------------------------------------------------------------------
28 * For the license of lib/mt19937ar.c and lib/mt19937ar.h, please see the
29 * header of the files.
31 * ------------------------------------------------------------------------
33 * For the license of lib/rbtree.h and lib/rbtree.c, please see
34 * lib/LEGALNOTICE.rbtree and lib/LICENSE.rbtree
36 * ------------------------------------------------------------------------
38 * Unless otherwise noted, the following license applies to STAMP files:
40 * Copyright (c) 2007, Stanford University
41 * All rights reserved.
43 * Redistribution and use in source and binary forms, with or without
44 * modification, are permitted provided that the following conditions are
47 * * Redistributions of source code must retain the above copyright
48 * notice, this list of conditions and the following disclaimer.
50 * * Redistributions in binary form must reproduce the above copyright
51 * notice, this list of conditions and the following disclaimer in
52 * the documentation and/or other materials provided with the
55 * * Neither the name of Stanford University nor the names of its
56 * contributors may be used to endorse or promote products derived
57 * from this software without specific prior written permission.
59 * THIS SOFTWARE IS PROVIDED BY STANFORD UNIVERSITY ``AS IS'' AND ANY
60 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
62 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL STANFORD UNIVERSITY BE LIABLE
63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
64 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
65 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
66 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
67 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
68 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
69 * THE POSSIBILITY OF SUCH DAMAGE.
71 * =============================================================================
82 head = new List_Node();
86 /* =======================================================================
88 * -- Returns null on failure
89 * =======================================================================
91 private List_Node allocNode(Object dataPtr)
93 List_Node nodePtr = new List_Node();
94 nodePtr.dataPtr = dataPtr;
99 /* =============================================================================
101 * -- If NULL passed for 'compare' function, will compare data pointer addresses
102 * -- Returns NULL on failure
103 * =============================================================================
104 * list_t* list_alloc (long (*compare)(const void*, const void*));
109 public List_t(int chk) {
110 this.head = new List_Node();
114 /* =============================================================================
116 * -- If NULL passed for 'compare' function, will compare data pointer addresses
117 * -- Returns NULL on failure
118 * =============================================================================
119 * void list_free (list_t* listPtr);
122 /* =============================================================================
124 * -- Return TRUE if list is empty, else FALSE
125 * =============================================================================
126 * bool_t list_isEmpty (list_t* listPtr);
128 public boolean isEmpty()
130 return (head.nextPtr == null);
133 /* =============================================================================
135 * -- Returns size of list
136 * =============================================================================
137 * long list_getSize (list_t* listPtr);
139 public int getSize() {
143 /* =============================================================================
145 * =============================================================================
146 * void* list_find (list_t* listPtr, void* dataPtr);
148 private List_Node findPrevious(Object dataPtr)
150 List_Node prevPtr = head;
151 List_Node nodePtr = prevPtr.nextPtr;
153 for(; nodePtr != null; nodePtr = nodePtr.nextPtr) {
154 if (compare(nodePtr.dataPtr,dataPtr) >= 0) {
163 /* =============================================================================
165 * -- Returns NULL if not found, else returns pointer to data
166 * =============================================================================
167 * void* list_find (list_t* listPtr, void* dataPtr);
169 public Object find(Object dataPtr) {
171 List_Node prevPtr = findPrevious(dataPtr);
173 nodePtr = prevPtr.nextPtr;
175 if((nodePtr == null) ||
176 (compare(nodePtr.dataPtr,dataPtr) != 0)) {
180 return (nodePtr.dataPtr);
183 public int compare(Object obj1,Object obj2)
187 return Packet.compareFragmentID((Packet)obj1,(Packet)obj2);
190 return compareObject(obj1,obj2);
193 /* =============================================================================
195 * -- Return TRUE on success, else FALSE
196 * =============================================================================
197 * bool_t list_insert (list_t* listPtr, void* dataPtr);
199 public boolean insert(Object dataPtr) {
204 prevPtr = findPrevious(dataPtr);
205 currPtr = prevPtr.nextPtr;
207 nodePtr = allocNode(dataPtr);
208 if (nodePtr == null) {
212 nodePtr.nextPtr = currPtr;
213 prevPtr.nextPtr = nodePtr;
220 /* =============================================================================
222 * -- Returns TRUE if successful, else FALSE
223 * =============================================================================
224 * bool_t list_remove (list_t* listPtr, void* dataPtr);
226 public boolean remove(Object dataPtr)
231 prevPtr = findPrevious(dataPtr);
233 nodePtr = prevPtr.nextPtr;
235 if((nodePtr != null) &&
236 (compare(nodePtr.dataPtr,dataPtr) == 0))
238 prevPtr.nextPtr = nodePtr.nextPtr;
239 nodePtr.nextPtr = null;
249 int compareObject(Object obj1,Object obj2) {
254 /* =============================================================================
256 * -- Removes all elements
257 * =============================================================================
258 * void list_clear (list_t* listPtr);
260 public void clear() {
261 head = new List_Node();
265 /* =============================================================================
269 * =============================================================================