<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ro">
	<id>http://wiki.dcae.pub.ro/index.php?action=history&amp;feed=atom&amp;title=List.h</id>
	<title>List.h - Revizia istoricului</title>
	<link rel="self" type="application/atom+xml" href="http://wiki.dcae.pub.ro/index.php?action=history&amp;feed=atom&amp;title=List.h"/>
	<link rel="alternate" type="text/html" href="http://wiki.dcae.pub.ro/index.php?title=List.h&amp;action=history"/>
	<updated>2026-06-04T15:05:31Z</updated>
	<subtitle>Istoricul versiunilor pentru această pagină din wiki</subtitle>
	<generator>MediaWiki 1.35.14</generator>
	<entry>
		<id>http://wiki.dcae.pub.ro/index.php?title=List.h&amp;diff=2062&amp;oldid=prev</id>
		<title>Rhobincu: Pagină nouă: &lt;syntaxhighlight lang=&quot;c&quot;&gt;  /**  * This is the header file for a list implementation  */  #ifndef __LIST_H__ #define __LIST_H__   #define UNLIMITED_SIZE -1   struct simply_linked_node...</title>
		<link rel="alternate" type="text/html" href="http://wiki.dcae.pub.ro/index.php?title=List.h&amp;diff=2062&amp;oldid=prev"/>
		<updated>2014-04-03T09:02:22Z</updated>

		<summary type="html">&lt;p&gt;Pagină nouă: &amp;lt;syntaxhighlight lang=&amp;quot;c&amp;quot;&amp;gt;  &lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;*  * This is the header file for a list implementation: &lt;/span&gt;  #ifndef __LIST_H__ #define __LIST_H__   #define UNLIMITED_SIZE -1   struct simply_linked_node...&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Pagină nouă&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;lt;syntaxhighlight lang=&amp;quot;c&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/**&lt;br /&gt;
 * This is the header file for a list implementation&lt;br /&gt;
 */&lt;br /&gt;
&lt;br /&gt;
#ifndef __LIST_H__&lt;br /&gt;
#define __LIST_H__&lt;br /&gt;
 &lt;br /&gt;
#define UNLIMITED_SIZE -1&lt;br /&gt;
 &lt;br /&gt;
struct simply_linked_node{&lt;br /&gt;
   int data;&lt;br /&gt;
   struct simply_linked_node * next;&lt;br /&gt;
};&lt;br /&gt;
 &lt;br /&gt;
struct simply_linked_node * create_simply_linked_node(int data);&lt;br /&gt;
 &lt;br /&gt;
struct simply_linked_list{&lt;br /&gt;
   struct simply_linked_node * first;&lt;br /&gt;
   struct simply_linked_node * last;&lt;br /&gt;
   unsigned size;&lt;br /&gt;
   int max_size;&lt;br /&gt;
};&lt;br /&gt;
 &lt;br /&gt;
struct simply_linked_list * create_simply_linked_list(int max_size);&lt;br /&gt;
 &lt;br /&gt;
int is_full(struct simply_linked_list * list);&lt;br /&gt;
 &lt;br /&gt;
void add_node_to_end_of_list(struct simply_linked_node * node, struct simply_linked_list * list);&lt;br /&gt;
 &lt;br /&gt;
void add_node_to_list(struct simply_linked_node * node, struct simply_linked_list * list, unsigned position);&lt;br /&gt;
&lt;br /&gt;
struct simply_linked_node * get_node(struct simply_linked_list * list, unsigned position);&lt;br /&gt;
&lt;br /&gt;
void delete_node(struct simply_linked_list * list, unsigned position);&lt;br /&gt;
 &lt;br /&gt;
#endif&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;/div&gt;</summary>
		<author><name>Rhobincu</name></author>
	</entry>
</feed>