Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Is there any way to emulate the list data structure in C? (What I really need is a doubly-linked list.)
More simply put, is there a good way to solve the Least Recently Used memory management technique?
My train of thought at the current time has me needing access to both the head and tail of the list (for obtaining/removing values and for inserting values, respectively).
An oft-cited list implementation in C comes from the Linux kernel: list.h
It does a lot of things right, in the context of the C language.