snipt

Ctrl+h for KB shortcuts

C++

lista_pokazivaci.h

struct tigra{
       string sifra = "";
       char naziv[40];
       char proizvodac[40];
       char zanr[10];
       int pegi;};

struct element{
       tigra podaci;
       element *sl;};

typedef element *elem;

elem FirstL(element *l){
   return l->sl;}
            
elem EndL(element *l){
   return NULL;}

elem NextL(element *p, element *l){
   return p->sl;}

elem PreviousL(element *p, element *l){
   el pr=l;
   while(pr->sl != p){
                  pr=pr->sl;}
   return pr;}

elem LocateL(tigra b, lista *l){
	element tekuci;
	tekuci = l->sl;
	while(tekuci){
		if(b.sifra!=""){
			if(b.sifra == tekuci->podaci.sifra)
			return tekuci;} 
		tekuci = tekuci->sljedeci;}}

int InsertL(tigra b, element *p, element *l){
   if (p==EndL(l)) return 0;
   else{
        element *n = new element;
        n->sl = b;
        n->sl = p->sl;               
        p->sl = n;      
        return 1;}}

void DeleteL(element *p, element *l){
     element *br = p->sl;
     ps->l = br->sl;
     delete br;}

podaci RetrieveL(element *p, element *l){
    p=p->sl;
    return p->podaci;}

void DeleteAllL(element *l){
     while(l->sl != NULL){
                DeleteL(l,l);}}

void InitL(element *l){
     l->sl = NULL;}

Description

Implementacija ATP liste pomoću pokazivaća
https://snipt.net/embed/87c3b64804b16072bb22905ea5c8e6f7/
/raw/87c3b64804b16072bb22905ea5c8e6f7/
87c3b64804b16072bb22905ea5c8e6f7
cpp
C++
62
2019-07-16T11:16:32
True
False
False
Nov 16, 2014 at 02:35 PM
/api/public/snipt/137167/
lista_pokazivacih-3a7de803
<table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><a href="#L-1"> 1</a> <a href="#L-2"> 2</a> <a href="#L-3"> 3</a> <a href="#L-4"> 4</a> <a href="#L-5"> 5</a> <a href="#L-6"> 6</a> <a href="#L-7"> 7</a> <a href="#L-8"> 8</a> <a href="#L-9"> 9</a> <a href="#L-10">10</a> <a href="#L-11">11</a> <a href="#L-12">12</a> <a href="#L-13">13</a> <a href="#L-14">14</a> <a href="#L-15">15</a> <a href="#L-16">16</a> <a href="#L-17">17</a> <a href="#L-18">18</a> <a href="#L-19">19</a> <a href="#L-20">20</a> <a href="#L-21">21</a> <a href="#L-22">22</a> <a href="#L-23">23</a> <a href="#L-24">24</a> <a href="#L-25">25</a> <a href="#L-26">26</a> <a href="#L-27">27</a> <a href="#L-28">28</a> <a href="#L-29">29</a> <a href="#L-30">30</a> <a href="#L-31">31</a> <a href="#L-32">32</a> <a href="#L-33">33</a> <a href="#L-34">34</a> <a href="#L-35">35</a> <a href="#L-36">36</a> <a href="#L-37">37</a> <a href="#L-38">38</a> <a href="#L-39">39</a> <a href="#L-40">40</a> <a href="#L-41">41</a> <a href="#L-42">42</a> <a href="#L-43">43</a> <a href="#L-44">44</a> <a href="#L-45">45</a> <a href="#L-46">46</a> <a href="#L-47">47</a> <a href="#L-48">48</a> <a href="#L-49">49</a> <a href="#L-50">50</a> <a href="#L-51">51</a> <a href="#L-52">52</a> <a href="#L-53">53</a> <a href="#L-54">54</a> <a href="#L-55">55</a> <a href="#L-56">56</a> <a href="#L-57">57</a> <a href="#L-58">58</a> <a href="#L-59">59</a> <a href="#L-60">60</a> <a href="#L-61">61</a></pre></div></td><td class="code"><div class="highlight"><pre><span></span><span id="L-1"><a name="L-1"></a><span class="k">struct</span> <span class="n">tigra</span><span class="p">{</span> </span><span id="L-2"><a name="L-2"></a> <span class="n">string</span> <span class="n">sifra</span> <span class="o">=</span> <span class="s">&quot;&quot;</span><span class="p">;</span> </span><span id="L-3"><a name="L-3"></a> <span class="kt">char</span> <span class="n">naziv</span><span class="p">[</span><span class="mi">40</span><span class="p">];</span> </span><span id="L-4"><a name="L-4"></a> <span class="kt">char</span> <span class="n">proizvodac</span><span class="p">[</span><span class="mi">40</span><span class="p">];</span> </span><span id="L-5"><a name="L-5"></a> <span class="kt">char</span> <span class="n">zanr</span><span class="p">[</span><span class="mi">10</span><span class="p">];</span> </span><span id="L-6"><a name="L-6"></a> <span class="kt">int</span> <span class="n">pegi</span><span class="p">;};</span> </span><span id="L-7"><a name="L-7"></a> </span><span id="L-8"><a name="L-8"></a><span class="k">struct</span> <span class="n">element</span><span class="p">{</span> </span><span id="L-9"><a name="L-9"></a> <span class="n">tigra</span> <span class="n">podaci</span><span class="p">;</span> </span><span id="L-10"><a name="L-10"></a> <span class="n">element</span> <span class="o">*</span><span class="n">sl</span><span class="p">;};</span> </span><span id="L-11"><a name="L-11"></a> </span><span id="L-12"><a name="L-12"></a><span class="k">typedef</span> <span class="n">element</span> <span class="o">*</span><span class="n">elem</span><span class="p">;</span> </span><span id="L-13"><a name="L-13"></a> </span><span id="L-14"><a name="L-14"></a><span class="n">elem</span> <span class="nf">FirstL</span><span class="p">(</span><span class="n">element</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-15"><a name="L-15"></a> <span class="k">return</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">sl</span><span class="p">;}</span> </span><span id="L-16"><a name="L-16"></a> </span><span id="L-17"><a name="L-17"></a><span class="n">elem</span> <span class="nf">EndL</span><span class="p">(</span><span class="n">element</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-18"><a name="L-18"></a> <span class="k">return</span> <span class="nb">NULL</span><span class="p">;}</span> </span><span id="L-19"><a name="L-19"></a> </span><span id="L-20"><a name="L-20"></a><span class="n">elem</span> <span class="nf">NextL</span><span class="p">(</span><span class="n">element</span> <span class="o">*</span><span class="n">p</span><span class="p">,</span> <span class="n">element</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-21"><a name="L-21"></a> <span class="k">return</span> <span class="n">p</span><span class="o">-&gt;</span><span class="n">sl</span><span class="p">;}</span> </span><span id="L-22"><a name="L-22"></a> </span><span id="L-23"><a name="L-23"></a><span class="n">elem</span> <span class="nf">PreviousL</span><span class="p">(</span><span class="n">element</span> <span class="o">*</span><span class="n">p</span><span class="p">,</span> <span class="n">element</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-24"><a name="L-24"></a> <span class="n">el</span> <span class="n">pr</span><span class="o">=</span><span class="n">l</span><span class="p">;</span> </span><span id="L-25"><a name="L-25"></a> <span class="k">while</span><span class="p">(</span><span class="n">pr</span><span class="o">-&gt;</span><span class="n">sl</span> <span class="o">!=</span> <span class="n">p</span><span class="p">){</span> </span><span id="L-26"><a name="L-26"></a> <span class="n">pr</span><span class="o">=</span><span class="n">pr</span><span class="o">-&gt;</span><span class="n">sl</span><span class="p">;}</span> </span><span id="L-27"><a name="L-27"></a> <span class="k">return</span> <span class="n">pr</span><span class="p">;}</span> </span><span id="L-28"><a name="L-28"></a> </span><span id="L-29"><a name="L-29"></a><span class="n">elem</span> <span class="nf">LocateL</span><span class="p">(</span><span class="n">tigra</span> <span class="n">b</span><span class="p">,</span> <span class="n">lista</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-30"><a name="L-30"></a> <span class="n">element</span> <span class="n">tekuci</span><span class="p">;</span> </span><span id="L-31"><a name="L-31"></a> <span class="n">tekuci</span> <span class="o">=</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">sl</span><span class="p">;</span> </span><span id="L-32"><a name="L-32"></a> <span class="k">while</span><span class="p">(</span><span class="n">tekuci</span><span class="p">){</span> </span><span id="L-33"><a name="L-33"></a> <span class="k">if</span><span class="p">(</span><span class="n">b</span><span class="p">.</span><span class="n">sifra</span><span class="o">!=</span><span class="s">&quot;&quot;</span><span class="p">){</span> </span><span id="L-34"><a name="L-34"></a> <span class="k">if</span><span class="p">(</span><span class="n">b</span><span class="p">.</span><span class="n">sifra</span> <span class="o">==</span> <span class="n">tekuci</span><span class="o">-&gt;</span><span class="n">podaci</span><span class="p">.</span><span class="n">sifra</span><span class="p">)</span> </span><span id="L-35"><a name="L-35"></a> <span class="k">return</span> <span class="n">tekuci</span><span class="p">;}</span> </span><span id="L-36"><a name="L-36"></a> <span class="n">tekuci</span> <span class="o">=</span> <span class="n">tekuci</span><span class="o">-&gt;</span><span class="n">sljedeci</span><span class="p">;}}</span> </span><span id="L-37"><a name="L-37"></a> </span><span id="L-38"><a name="L-38"></a><span class="kt">int</span> <span class="nf">InsertL</span><span class="p">(</span><span class="n">tigra</span> <span class="n">b</span><span class="p">,</span> <span class="n">element</span> <span class="o">*</span><span class="n">p</span><span class="p">,</span> <span class="n">element</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-39"><a name="L-39"></a> <span class="k">if</span> <span class="p">(</span><span class="n">p</span><span class="o">==</span><span class="n">EndL</span><span class="p">(</span><span class="n">l</span><span class="p">))</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-40"><a name="L-40"></a> <span class="k">else</span><span class="p">{</span> </span><span id="L-41"><a name="L-41"></a> <span class="n">element</span> <span class="o">*</span><span class="n">n</span> <span class="o">=</span> <span class="k">new</span> <span class="n">element</span><span class="p">;</span> </span><span id="L-42"><a name="L-42"></a> <span class="n">n</span><span class="o">-&gt;</span><span class="n">sl</span> <span class="o">=</span> <span class="n">b</span><span class="p">;</span> </span><span id="L-43"><a name="L-43"></a> <span class="n">n</span><span class="o">-&gt;</span><span class="n">sl</span> <span class="o">=</span> <span class="n">p</span><span class="o">-&gt;</span><span class="n">sl</span><span class="p">;</span> </span><span id="L-44"><a name="L-44"></a> <span class="n">p</span><span class="o">-&gt;</span><span class="n">sl</span> <span class="o">=</span> <span class="n">n</span><span class="p">;</span> </span><span id="L-45"><a name="L-45"></a> <span class="k">return</span> <span class="mi">1</span><span class="p">;}}</span> </span><span id="L-46"><a name="L-46"></a> </span><span id="L-47"><a name="L-47"></a><span class="kt">void</span> <span class="nf">DeleteL</span><span class="p">(</span><span class="n">element</span> <span class="o">*</span><span class="n">p</span><span class="p">,</span> <span class="n">element</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-48"><a name="L-48"></a> <span class="n">element</span> <span class="o">*</span><span class="n">br</span> <span class="o">=</span> <span class="n">p</span><span class="o">-&gt;</span><span class="n">sl</span><span class="p">;</span> </span><span id="L-49"><a name="L-49"></a> <span class="n">ps</span><span class="o">-&gt;</span><span class="n">l</span> <span class="o">=</span> <span class="n">br</span><span class="o">-&gt;</span><span class="n">sl</span><span class="p">;</span> </span><span id="L-50"><a name="L-50"></a> <span class="k">delete</span> <span class="n">br</span><span class="p">;}</span> </span><span id="L-51"><a name="L-51"></a> </span><span id="L-52"><a name="L-52"></a><span class="n">podaci</span> <span class="nf">RetrieveL</span><span class="p">(</span><span class="n">element</span> <span class="o">*</span><span class="n">p</span><span class="p">,</span> <span class="n">element</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-53"><a name="L-53"></a> <span class="n">p</span><span class="o">=</span><span class="n">p</span><span class="o">-&gt;</span><span class="n">sl</span><span class="p">;</span> </span><span id="L-54"><a name="L-54"></a> <span class="k">return</span> <span class="n">p</span><span class="o">-&gt;</span><span class="n">podaci</span><span class="p">;}</span> </span><span id="L-55"><a name="L-55"></a> </span><span id="L-56"><a name="L-56"></a><span class="kt">void</span> <span class="nf">DeleteAllL</span><span class="p">(</span><span class="n">element</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-57"><a name="L-57"></a> <span class="k">while</span><span class="p">(</span><span class="n">l</span><span class="o">-&gt;</span><span class="n">sl</span> <span class="o">!=</span> <span class="nb">NULL</span><span class="p">){</span> </span><span id="L-58"><a name="L-58"></a> <span class="n">DeleteL</span><span class="p">(</span><span class="n">l</span><span class="p">,</span><span class="n">l</span><span class="p">);}}</span> </span><span id="L-59"><a name="L-59"></a> </span><span id="L-60"><a name="L-60"></a><span class="kt">void</span> <span class="nf">InitL</span><span class="p">(</span><span class="n">element</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-61"><a name="L-61"></a> <span class="n">l</span><span class="o">-&gt;</span><span class="n">sl</span> <span class="o">=</span> <span class="nb">NULL</span><span class="p">;}</span> </span></pre></div> </td></tr></table>
ATP, implementacija, list, lista, pointers, pokazivači