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();
99 nodePtr.dataPtr = dataPtr;
100 nodePtr.nextPtr = null;
106 /* =============================================================================
108 * -- If NULL passed for 'compare' function, will compare data pointer addresses
109 * -- Returns NULL on failure
110 * =============================================================================
111 * list_t* list_alloc (long (*compare)(const void*, const void*));
116 //mode 0 = element_list_compare
117 //mode 1 = element_list_compareedge
119 public List_t(int mode) {
127 /* =============================================================================
129 * -- Return TRUE if list is empty, else FALSE
130 * =============================================================================
131 * bool_t list_isEmpty (list_t* listPtr);
133 public boolean isEmpty()
135 return (head.nextPtr == null);
138 /* =============================================================================
140 * -- Returns size of list
141 * =============================================================================
142 * long list_getSize (list_t* listPtr);
144 public int getSize() {
148 /* =============================================================================
150 * =============================================================================
151 * void* list_find (list_t* listPtr, void* dataPtr);
153 private List_Node findPrevious(Object dataPtr)
155 List_Node prevPtr = head;
156 List_Node nodePtr = prevPtr.nextPtr;
158 for(; nodePtr != null; nodePtr = nodePtr.nextPtr) {
159 if (compare(nodePtr.dataPtr,dataPtr) >= 0) {
168 /* =============================================================================
170 * -- Returns NULL if not found, else returns pointer to data
171 * =============================================================================
172 * void* list_find (list_t* listPtr, void* dataPtr);
174 public Object find(Object dataPtr) {
176 List_Node prevPtr = findPrevious(dataPtr);
178 nodePtr = prevPtr.nextPtr;
180 if((nodePtr == null) ||
181 (compare(nodePtr.dataPtr,dataPtr) != 0)) {
185 return nodePtr.dataPtr;
188 //mode 0 = element_list_compare
189 //mode 1 = element_list_compareedge
191 public int compare(Object obj1,Object obj2) {
193 return element.element_compare((element)obj1, (element)obj2);
195 return element.compareEdge((edge)obj1, (edge) obj2);
199 /* =============================================================================
201 * -- Return TRUE on success, else FALSE
202 * =============================================================================
203 * bool_t list_insert (list_t* listPtr, void* dataPtr);
205 public boolean insert(Object dataPtr) {
210 prevPtr = findPrevious(dataPtr);
211 currPtr = prevPtr.nextPtr;
213 nodePtr = allocNode(dataPtr);
214 if (nodePtr == null) {
218 nodePtr.nextPtr = currPtr;
219 prevPtr.nextPtr = nodePtr;
226 /* =============================================================================
228 * -- Returns TRUE if successful, else FALSE
229 * =============================================================================
230 * bool_t list_remove (list_t* listPtr, void* dataPtr);
232 public boolean remove(Object dataPtr)
237 prevPtr = findPrevious(dataPtr);
239 nodePtr = prevPtr.nextPtr;
241 if((nodePtr != null) &&
242 (compare(nodePtr.dataPtr,dataPtr) == 0))
244 prevPtr.nextPtr = nodePtr.nextPtr;
245 nodePtr.nextPtr = null;
255 int compareObject(Object obj1,Object obj2) {
260 /* =============================================================================
262 * -- Removes all elements
263 * =============================================================================
264 * void list_clear (list_t* listPtr);
266 public void clear() {
267 head = new List_Node();
271 /* =============================================================================
275 * =============================================================================
280 public static void main(String[] argv) {
282 int[] data1 = new int[5];
283 int[] data2 = new int[6];
287 System.out.println("Starting...");