<?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=Test_list.c</id>
	<title>Test list.c - 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=Test_list.c"/>
	<link rel="alternate" type="text/html" href="http://wiki.dcae.pub.ro/index.php?title=Test_list.c&amp;action=history"/>
	<updated>2026-06-04T16:11:53Z</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=Test_list.c&amp;diff=2064&amp;oldid=prev</id>
		<title>Rhobincu: Pagină nouă: &lt;syntaxhighlight lang=&quot;c&quot;&gt; #include &quot;list.h&quot; #include &lt;stdlib.h&gt; #include &lt;stdio.h&gt;  #define LIST_SIZE  1000  int main(){          struct simply_linked_list * list = create_simply_lin...</title>
		<link rel="alternate" type="text/html" href="http://wiki.dcae.pub.ro/index.php?title=Test_list.c&amp;diff=2064&amp;oldid=prev"/>
		<updated>2014-04-03T09:03:15Z</updated>

		<summary type="html">&lt;p&gt;Pagină nouă: &amp;lt;syntaxhighlight lang=&amp;quot;c&amp;quot;&amp;gt; #include &amp;quot;list.h&amp;quot; #include &amp;lt;stdlib.h&amp;gt; #include &amp;lt;stdio.h&amp;gt;  #define LIST_SIZE  1000  int main(){          struct simply_linked_list * list = create_simply_lin...&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;
#include &amp;quot;list.h&amp;quot;&lt;br /&gt;
#include &amp;lt;stdlib.h&amp;gt;&lt;br /&gt;
#include &amp;lt;stdio.h&amp;gt;&lt;br /&gt;
&lt;br /&gt;
#define LIST_SIZE  1000&lt;br /&gt;
&lt;br /&gt;
int main(){&lt;br /&gt;
    &lt;br /&gt;
    struct simply_linked_list * list = create_simply_linked_list(LIST_SIZE);&lt;br /&gt;
    struct simply_linked_node * node;&lt;br /&gt;
    &lt;br /&gt;
    while(list-&amp;gt;size &amp;lt; LIST_SIZE){&lt;br /&gt;
        node = create_simply_linked_node(rand() % 10);&lt;br /&gt;
        add_node_to_end_of_list(node, list);&lt;br /&gt;
    }&lt;br /&gt;
    &lt;br /&gt;
    int n;&lt;br /&gt;
    int index = 0;&lt;br /&gt;
    printf(&amp;quot;n = &amp;quot;);&lt;br /&gt;
    scanf(&amp;quot;%d&amp;quot;, &amp;amp;n);&lt;br /&gt;
    &lt;br /&gt;
    for(node = list-&amp;gt;first; node != NULL; node = node-&amp;gt;next){&lt;br /&gt;
        if(node-&amp;gt;data == n){&lt;br /&gt;
            printf(&amp;quot;%d, &amp;quot;, index);&lt;br /&gt;
        }&lt;br /&gt;
        index++;&lt;br /&gt;
    }&lt;br /&gt;
    printf(&amp;quot;\n&amp;quot;);&lt;br /&gt;
&lt;br /&gt;
/*&lt;br /&gt;
    while(list-&amp;gt;size){&lt;br /&gt;
        delete_node(list, 0);&lt;br /&gt;
    }&lt;br /&gt;
*/    &lt;br /&gt;
    return 0;&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;/div&gt;</summary>
		<author><name>Rhobincu</name></author>
	</entry>
</feed>