I imagine your question is about the linked list data structure my llist is:
llist can be used to create a range? the answer is, no knowledge test. the answer is yes, it can be part of, each element in the list can point any kind of information, including row. However, if you want to use the llist function for copying, search, and choice, so things are definitely not looking good. In fact, the complete function llist_add_data - the main method of adding information about the list, was ordered ankar - method to add information in your head the list provided by public and private use only do not know what will destroy property Sort the list. firstly consider the llist any other information that the address information on each package thing - the memory address is entered by a council to withdraw any information about the quality of that information. in order to copy, search, capacity choice, they should be given a reminder and llist - function pointers that know what kind of information about the data should be added to the list. This means that one type of information include a list of (a restricted standard of justice, which can be overcome, but I do not need to investigate the application). llist made by him there was no consideration of creating a list of orders - definition reminded that reflect this. sites for consideration to range from? application in llist, which in other days, each time should use a follow-up (think a particular list may be a copy operation) a test to see if the reminder was set a valid Council ( ie if it was not zero). reminded if zero, the code would call a standard system function (ie manki), otherwise it would use the reminder. Then, he realizes that permanent use of his statement were necessary if and only need to spend time on a one enstansyasyon llist. if reminder has not aple in the llist_new, the reminder establish a standard call. But this mechanism requires the definition should be reminded to call the standard point system (ie manki to copying information, and things memcmp to compare data) at that time, he can not, but now can. ok, so this was done to fix? both manki memcmp function and require a third argument - size_t N - how many bytes the copy or compare. If you want to compare objects or copy this information and functions, you must pass the size of information on things to be copied or compare - or the other possibility - the size of the array of articles comparing the information or copying - ie array_size * sizof (data_type). This means that the function that you create at llist to take follow-up and is now also need the same third variable, in order are compatible. However, unlike with manki memcmp, these functions operate on data structures by a sequence of bytes in memory (not a data structure is a sequence of bytes in memory), but in these natural functions are different. , and memcmp responses can be compared to a minimum with the only other multiple. But our data structure, let's say pnote, pnote_cmp minimum function operates in one pnote - pnote included a lot of bytes. here's the problem: Let's pretend the data structures we need a special comparison function - as this is easy - memcmp can be used like this: If (memcmp (data1, data2, sizof (data1)) == 0) ( * Game! * / ) So we memcmp sizof of data in bytes. This means that if we abolished if the declaration is necessary to detect use a reminder or not, we have passed sizof structural information in terms of points reminder advice. What does it mean by a function to compare data structure X? This means that it will also find the size of the data is compared - but he already knows this information _______________________________________________ NetBehaviour mailing list [email protected] http://www.netbehaviour.org/mailman/listinfo/netbehaviour
