linked-list

I have a linked list and I made a function to fetch a node. But I want to use it both to search by first or last name. typedef struct people { char name[60], lastname[60]; struct people *next; } people; people *search(const char *key, people *list, FIELD) { while (list && strcmp(key, list->FIELD) != 0) { list = list->next; } return list; } Example: people *aux; aux = search("John", list_of_people, "name"); Or: aux = search("Smith", list_of_people, "lastname"); There is a clear and efficient way to solve this problem without repeating code? use offsetof(<stddef.h>) macro. E.g: people *search

How to remove a specific value from a linked list java? I tried to make it in my implementation, but it wasn't easy.. Here is what I'm trying to make: //How to do this...;<.. int remove(Item item) { Node cur = first.next; Node prev = first; while (cur !=null) { if (cur.item.equals(item)) { item = dequeue(); } cur = cur.next; // TODO } return 0; } These are the pre-setup: public class LinkedQueue<Item> implements Iterable<Item> { private int N; // number of elements on queue private Node first; // beginning of queue private Node last; // end of queue // helper linked list class private class

Just started programming in C++. I've created a Point class, a std::list and an iterator like so: class Point { public: int x, y; Point(int x1, int y1) { x = x1; y = y1; } }; std::list <Point> pointList; std::list <Point>::iterator iter; I then push new points onto pointList. Now, I'm needing to iterate through all the points in pointList, so I need to loop using the iterator. This is where I get screwed up. for(iter = pointList.begin(); iter != pointList.end(); iter++) { Point currentPoint = *iter; glVertex2i(currentPoint.x, currentPoint.y); } Update You guys were right, the problem isn't in

I am trying to figure out how to sort my list alphabetically, normally this would be really easy, but I need to ignore the first 5 characters of each string in my list. (they are numerical IDS) ArrayList<String> tempList = new ArrayList<String>(); for(String s : AddressBook){ tempList.add(s); Collections.sort(tempList ); } System.out.println(tempList); You can do it by supplying your own Comparator implementation. Collections.sort (tempList, new Comparator<String>() { public int compare(String o1, String o2) { String sub1 = o1.substring (3); String sub2 = o2.substring (3); return sub1

Here is the problem, it is from Sedgwick's excellent Algorithms in Java (q 3.54) Given a link to a node in a singly linked list that contains no null links (i.e. each node either links to itself or another node in the list) determine the number of different nodes without modifying any of the nodes and using no more than constant memory space. How do you do it? scan through the list once using the hare and tortoise algorithm to work out whether it is circular in any way, and then scan through again to work out where the list becomes circular, then scan through again counting the number of nodes

Can the compare-and-swap function be used to swap variables atomically? I'm using C/C++ via gcc on x86_64 RedHat Linux, specifically the __sync builtins. Example: int x = 0, y = 1; y = __sync_val_compare_and_swap(&x, x, y); I think this boils down to whether x can change between &x and x; for instance, if &x constitutes an operation, it might be possible for x to change between &x and x in the arguments. I want to assume that the comparison implicit above will always be true; my question is whether I can. Obviously there's the bool version of CAS, but then I can't get the old x to write into y