I'm trying to create a singly linked list from an input text file for an assignment. I'm trying to do it a little bit at a time so I know my code is not complete. I tried creating the head pointe... More on stackoverflow.com

A couple minor issues (at a glance): 0. Allocations aren't checked. If you're assuming that allocations cannot fail (not a bad assumption on most hosted environments) you should still do something like if (ptr == NULL) abort(); rather than deref-ing a null pointer, which is undefined-behavior. 0. Identifiers starting with underscores are reserved by the standard. If you compile with clang's -Wreserved-identifer it would warn you about these. 0. Rather than returning error code for user-error, you should consider using assert() instead (e.g if someone calls list_push with a null list). Returning an error code to a caller that has proven itself to be buggy makes things harder to debug since the program continues on as if everything is fine. Some major issues: 0. There's simply too much code. Linked list are a rather simple data structure which really shouldn't take up 600+ sloc (IMO). 0. Generics with void * pointers aren't a good idea for several reasons. One major issue with this approach is that there's no type-checking (i.e if someone mistakenly passes a char * instead of an int *, the compiler cannot warn about that). 0. The other issue with void * generics is that it creates a massive web of pointers, which becomes very difficult to manage correctly . You can take a look at tllist which solves the type-safety issue by using generic macros instead of void *. It still has the individual allocation problem, and to solve that you'd need to have a flat array and use relative pointers (i.e indexes into that flat array) as the next and prev pointers. Not only will this allow you to allocate and deallocate the entire list at once; this also allows you to reduce the memory usage because you can use smaller sized relative pointers (e.g uint_least32_t (4 bytes) should allow enough elements for almost all use-cases compared to an absolute pointer which typically takes up 8 bytes on 64bit arch). More on reddit.com

No catch. Algorithm to reverse a Singly Linked List %%Input : head node of the linked list Begin: If (head != NULL) then prevNode ← head head ← head.next curNode ← head prevNode.next ← NULL While (head != NULL) do head ← head.next curNode.next ← prevNode prevNode ← curNode curNode ← head End while head ← prevNode End if End More on reddit.com

C++ is a high-level, general-purpose programming language first released in 1985. Modern C++ has object-oriented, generic, and functional features, in addition to facilities for low-level memory manipulation. More on reddit.com