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 * =============================================================================
77 public List_Node head;
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();
96 nodePtr.dataPtr = dataPtr;
97 nodePtr.nextPtr = null;
103 /* =============================================================================
105 * -- If NULL passed for 'compare' function, will compare data pointer addresses
106 * -- Returns NULL on failure
107 * =============================================================================
108 * list_t* list_alloc (long (*compare)(const void*, const void*));
113 public List_t alloc(int isCoordinate)
115 List_t listPtr = new List_t();
118 listPtr.head.dataPtr = null;
119 listPtr.head.nextPtr = null;
122 listPtr.isCoordinate = (isCoordinate==1)?true:false;
127 /* =============================================================================
129 * -- If NULL passed for 'compare' function, will compare data pointer addresses
130 * -- Returns NULL on failure
131 * =============================================================================
132 * void list_free (list_t* listPtr);
134 public void free(List_t listPtr)
141 /* =============================================================================
143 * -- Return TRUE if list is empty, else FALSE
144 * =============================================================================
145 * bool_t list_isEmpty (list_t* listPtr);
147 public boolean isEmpty()
149 return (head.nextPtr == null);
152 /* =============================================================================
154 * -- Returns size of list
155 * =============================================================================
156 * long list_getSize (list_t* listPtr);
158 public int getSize() {
162 /* =============================================================================
164 * =============================================================================
165 * void* list_find (list_t* listPtr, void* dataPtr);
167 private List_Node findPrevious(Object dataPtr)
169 List_Node prevPtr = head;
170 List_Node nodePtr = prevPtr.nextPtr;
172 for(; nodePtr != null; nodePtr = nodePtr.nextPtr) {
173 if (compare(nodePtr.dataPtr,dataPtr) >= 0) {
182 /* =============================================================================
184 * -- Returns NULL if not found, else returns pointer to data
185 * =============================================================================
186 * void* list_find (list_t* listPtr, void* dataPtr);
188 public Object find(Object dataPtr) {
190 List_Node prevPtr = findPrevious(dataPtr);
192 nodePtr = prevPtr.nextPtr;
194 if((nodePtr == null) ||
195 (compare(nodePtr.dataPtr,dataPtr) != 0)) {
199 return (nodePtr.dataPtr);
202 public int compare(Object obj1,Object obj2)
204 Coordinate coordinate = new Coordinate();
207 return coordinate.comparePair(obj1,obj2);
210 return compareObject(obj1,obj2);
213 /* =============================================================================
215 * -- Return TRUE on success, else FALSE
216 * =============================================================================
217 * bool_t list_insert (list_t* listPtr, void* dataPtr);
219 public boolean insert(Object dataPtr) {
224 prevPtr = findPrevious(dataPtr);
225 currPtr = prevPtr.nextPtr;
227 nodePtr = allocNode(dataPtr);
228 if (nodePtr == null) {
232 nodePtr.nextPtr = currPtr;
233 prevPtr.nextPtr = nodePtr;
240 /* =============================================================================
242 * -- Returns TRUE if successful, else FALSE
243 * =============================================================================
244 * bool_t list_remove (list_t* listPtr, void* dataPtr);
246 public boolean remove(Object dataPtr)
251 prevPtr = findPrevious(dataPtr);
253 nodePtr = prevPtr.nextPtr;
255 if((nodePtr != null) &&
256 (compare(nodePtr.dataPtr,dataPtr) == 0))
258 prevPtr.nextPtr = nodePtr.nextPtr;
259 nodePtr.nextPtr = null;
269 int compareObject(Object obj1,Object obj2) {
274 /* =============================================================================
276 * -- Removes all elements
277 * =============================================================================
278 * void list_clear (list_t* listPtr);
280 public void clear() {
281 head = new List_Node();
285 /* =============================================================================
289 * =============================================================================
294 // public static void main(String[] argv) {
296 // int[] data1 = new int[5];
297 // int[] data2 = new int[6];
301 // System.out.println("Starting...");