Rhobincu la 3 aprilie 2014 09:02

2014-04-03T09:02:45Z

Rhobincu: Pagină nouă: /** * This is the header file for a list implementation */ #ifndef __LIST_H #define LIST_H__ #define UNLIMITED_SIZE -1 struct simply_linked_node...

2014-04-03T09:02:09Z

Pagină nouă: <syntaxhighlight lang="c"> * * This is the header file for a list implementation: #ifndef __LIST_H__ #define __LIST_H__ #define UNLIMITED_SIZE -1 struct simply_linked_node...

Pagină nouă

<syntaxhighlight lang="c">

/**
* This is the header file for a list implementation
*/

#ifndef __LIST_H__
#define __LIST_H__

#define UNLIMITED_SIZE -1

struct simply_linked_node{
int data;
struct simply_linked_node * next;
};

struct simply_linked_node * create_simply_linked_node(int data);

struct simply_linked_list{
struct simply_linked_node * first;
struct simply_linked_node * last;
unsigned size;
int max_size;
};

struct simply_linked_list * create_simply_linked_list(int max_size);

int is_full(struct simply_linked_list * list);

void add_node_to_end_of_list(struct simply_linked_node * node, struct simply_linked_list * list);

void add_node_to_list(struct simply_linked_node * node, struct simply_linked_list * list, unsigned position);

struct simply_linked_node * get_node(struct simply_linked_list * list, unsigned position);

void delete_node(struct simply_linked_list * list, unsigned position);

#endif
</syntaxhighlight>

@@ Linia 1: / Linia 1: @@
 <syntaxhighlight lang="c">
-#ifndef __LIST_H__
+struct simply_linked_node * create_simply_linked_node(int data){
-#define __LIST_H__
+    struct simply_linked_node * new_node =
-#define UNLIMITED_SIZE -1
+struct simply_linked_list * create_simply_linked_list(int max_size){
-struct simply_linked_node{
+void add_node_to_end_of_list(struct simply_linked_node * node, struct simply_linked_list * list){
-   int data;
+    if(is_full(list)){
-   struct simply_linked_node * next;
+        return;
 };
-−
-struct simply_linked_node * create_simply_linked_node(int data);
+    node->next = NULL;
+    if(!list->size){
-struct simply_linked_list{
+        list->first = node;
-   struct simply_linked_node * first;
+        list->last = node;
-   struct simply_linked_node * last;
+    }else{
-   unsigned size;
+        list->last->next = node;
-   int max_size;
+        list->last = node;
-};
-−
-struct simply_linked_list * create_simply_linked_list(int max_size);
+    list->size++;
-−
+}
-int is_full(struct simply_linked_list * list);
+struct simply_linked_node * get_node(struct simply_linked_list * list, unsigned position){
-void add_node_to_end_of_list(struct simply_linked_node * node, struct simply_linked_list * list);
+    struct simply_linked_node * node = list->first;
+    while(node != NULL && position){
-void add_node_to_list(struct simply_linked_node * node, struct simply_linked_list * list, unsigned position);
+        node = node->next;
-struct simply_linked_node * get_node(struct simply_linked_list * list, unsigned position);
+void delete_node(struct simply_linked_list * list, unsigned position){
-void delete_node(struct simply_linked_list * list, unsigned position);
+    if(!list->size){
+        return;
-#endif
 </syntaxhighlight>

List.c - Revizia istoricului

Rhobincu la 3 aprilie 2014 09:02

Rhobincu: Pagină nouă: /** * This is the header file for a list implementation */ #ifndef __LIST_H__ #define __LIST_H__ #define UNLIMITED_SIZE -1 struct simply_linked_node...

Rhobincu: Pagină nouă: /** * This is the header file for a list implementation */ #ifndef __LIST_H #define LIST_H__ #define UNLIMITED_SIZE -1 struct simply_linked_node...