snipt

Ctrl+h for KB shortcuts

C++

lista_polje.h

#include <string.h>
#include <cstdlib>
#include <iostream>
using namespace std;
typedef int element1;

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


struct tlista {
	   tigra igre[15000];
       int cursor;};

element1 EndL(tlista *l){
                return (*l).cursor;}

element1 FirstL(tlista *l){
        if(!(l->cursor)) return EndL(l);
        else return 0;}

element1 NextL(element1 p, tlista *l){
                if (p==EndL(l)) return 0;
                else return p=p+1;}

element1 PreviousL(element1 p, tlista *l){
        if (p==FirstL(l)) return 0;
        else return p=p-1;}

element1 LocateL(tigra a, tlista *l){
        for(int i = 0; i < l->cursor; i++){
                if(l->igre[i].sifra == a.sifra) return i;}
        return EndL(l);}

int InsertL(tigra x, element1 p, tlista *L){
    	if(p<0 || p>L->cursor) return 0;
    	int i=L->cursor;
    	L->cursor++;
    	while(i>=p) { L->igre[i] = L->igre[i-1]; i--; }
    	L->igre[p] = x;
    	return 1;}

int DeleteL(element1 p, tlista *l){
        if (p >= 0 && p < l->cursor) {
                for (int i = p; i < l->cursor; i++){
                        l->igre[i].sifra = l->igre[i+1].sifra;
                        strcpy(l->igre[i].naziv, l->igre[i+1].naziv);
                        }
                l->cursor--;
                return 1;}
        else return 0;}

tigra RetrieveL(element1 p, tlista *l){
        igra.sifra = l->igre[p].sifra;
        strcpy(igra.naziv, l->igre[p].naziv);
        igra.pegi = l->igre[p].pegi;
        strcpy(igra.zanr, l->igre[p].zanr);
        return igra;}

void DeleteAllL(tlista *l){
        l->cursor = 0;}


tlista* InitL(tlista *l){
         l = new tlista;
         l->cursor = 0;
         return l;}

Description

biblioteka sa metodama za implementaciju liste pomoću pollja
https://snipt.net/embed/98a93747ef3aa6fc4364cb53b1f64286/
/raw/98a93747ef3aa6fc4364cb53b1f64286/
98a93747ef3aa6fc4364cb53b1f64286
cpp
C++
71
2019-07-16T11:07:06
True
False
False
Nov 16, 2014 at 02:29 PM
/api/public/snipt/137162/
lista_poljeh-c69eb391
<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> <a href="#L-62">62</a> <a href="#L-63">63</a> <a href="#L-64">64</a> <a href="#L-65">65</a> <a href="#L-66">66</a> <a href="#L-67">67</a> <a href="#L-68">68</a> <a href="#L-69">69</a> <a href="#L-70">70</a> <a href="#L-71">71</a></pre></div></td><td class="code"><div class="highlight"><pre><span></span><span id="L-1"><a name="L-1"></a><span class="cp">#include</span> <span class="cpf">&lt;string.h&gt;</span><span class="cp"></span> </span><span id="L-2"><a name="L-2"></a><span class="cp">#include</span> <span class="cpf">&lt;cstdlib&gt;</span><span class="cp"></span> </span><span id="L-3"><a name="L-3"></a><span class="cp">#include</span> <span class="cpf">&lt;iostream&gt;</span><span class="cp"></span> </span><span id="L-4"><a name="L-4"></a><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span> </span><span id="L-5"><a name="L-5"></a><span class="k">typedef</span> <span class="kt">int</span> <span class="n">element1</span><span class="p">;</span> </span><span id="L-6"><a name="L-6"></a> </span><span id="L-7"><a name="L-7"></a><span class="k">struct</span> <span class="n">tigra</span><span class="p">{</span> </span><span id="L-8"><a name="L-8"></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-9"><a name="L-9"></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-10"><a name="L-10"></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-11"><a name="L-11"></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-12"><a name="L-12"></a> <span class="kt">int</span> <span class="n">pegi</span><span class="p">;}</span><span class="n">igra</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><span id="L-15"><a name="L-15"></a><span class="k">struct</span> <span class="n">tlista</span> <span class="p">{</span> </span><span id="L-16"><a name="L-16"></a> <span class="n">tigra</span> <span class="n">igre</span><span class="p">[</span><span class="mi">15000</span><span class="p">];</span> </span><span id="L-17"><a name="L-17"></a> <span class="kt">int</span> <span class="n">cursor</span><span class="p">;};</span> </span><span id="L-18"><a name="L-18"></a> </span><span id="L-19"><a name="L-19"></a><span class="n">element1</span> <span class="nf">EndL</span><span class="p">(</span><span class="n">tlista</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-20"><a name="L-20"></a> <span class="k">return</span> <span class="p">(</span><span class="o">*</span><span class="n">l</span><span class="p">).</span><span class="n">cursor</span><span class="p">;}</span> </span><span id="L-21"><a name="L-21"></a> </span><span id="L-22"><a name="L-22"></a><span class="n">element1</span> <span class="nf">FirstL</span><span class="p">(</span><span class="n">tlista</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-23"><a name="L-23"></a> <span class="k">if</span><span class="p">(</span><span class="o">!</span><span class="p">(</span><span class="n">l</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">))</span> <span class="k">return</span> <span class="n">EndL</span><span class="p">(</span><span class="n">l</span><span class="p">);</span> </span><span id="L-24"><a name="L-24"></a> <span class="k">else</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;}</span> </span><span id="L-25"><a name="L-25"></a> </span><span id="L-26"><a name="L-26"></a><span class="n">element1</span> <span class="nf">NextL</span><span class="p">(</span><span class="n">element1</span> <span class="n">p</span><span class="p">,</span> <span class="n">tlista</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-27"><a name="L-27"></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-28"><a name="L-28"></a> <span class="k">else</span> <span class="k">return</span> <span class="n">p</span><span class="o">=</span><span class="n">p</span><span class="o">+</span><span class="mi">1</span><span class="p">;}</span> </span><span id="L-29"><a name="L-29"></a> </span><span id="L-30"><a name="L-30"></a><span class="n">element1</span> <span class="nf">PreviousL</span><span class="p">(</span><span class="n">element1</span> <span class="n">p</span><span class="p">,</span> <span class="n">tlista</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-31"><a name="L-31"></a> <span class="k">if</span> <span class="p">(</span><span class="n">p</span><span class="o">==</span><span class="n">FirstL</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-32"><a name="L-32"></a> <span class="k">else</span> <span class="k">return</span> <span class="n">p</span><span class="o">=</span><span class="n">p</span><span class="o">-</span><span class="mi">1</span><span class="p">;}</span> </span><span id="L-33"><a name="L-33"></a> </span><span id="L-34"><a name="L-34"></a><span class="n">element1</span> <span class="nf">LocateL</span><span class="p">(</span><span class="n">tigra</span> <span class="n">a</span><span class="p">,</span> <span class="n">tlista</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-35"><a name="L-35"></a> <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">;</span> <span class="n">i</span><span class="o">++</span><span class="p">){</span> </span><span id="L-36"><a name="L-36"></a> <span class="k">if</span><span class="p">(</span><span class="n">l</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">sifra</span> <span class="o">==</span> <span class="n">a</span><span class="p">.</span><span class="n">sifra</span><span class="p">)</span> <span class="k">return</span> <span class="n">i</span><span class="p">;}</span> </span><span id="L-37"><a name="L-37"></a> <span class="k">return</span> <span class="n">EndL</span><span class="p">(</span><span class="n">l</span><span class="p">);}</span> </span><span id="L-38"><a name="L-38"></a> </span><span id="L-39"><a name="L-39"></a><span class="kt">int</span> <span class="nf">InsertL</span><span class="p">(</span><span class="n">tigra</span> <span class="n">x</span><span class="p">,</span> <span class="n">element1</span> <span class="n">p</span><span class="p">,</span> <span class="n">tlista</span> <span class="o">*</span><span class="n">L</span><span class="p">){</span> </span><span id="L-40"><a name="L-40"></a> <span class="k">if</span><span class="p">(</span><span class="n">p</span><span class="o">&lt;</span><span class="mi">0</span> <span class="o">||</span> <span class="n">p</span><span class="o">&gt;</span><span class="n">L</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-41"><a name="L-41"></a> <span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="n">L</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">;</span> </span><span id="L-42"><a name="L-42"></a> <span class="n">L</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="o">++</span><span class="p">;</span> </span><span id="L-43"><a name="L-43"></a> <span class="k">while</span><span class="p">(</span><span class="n">i</span><span class="o">&gt;=</span><span class="n">p</span><span class="p">)</span> <span class="p">{</span> <span class="n">L</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">L</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">i</span><span class="o">-</span><span class="mi">1</span><span class="p">];</span> <span class="n">i</span><span class="o">--</span><span class="p">;</span> <span class="p">}</span> </span><span id="L-44"><a name="L-44"></a> <span class="n">L</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">p</span><span class="p">]</span> <span class="o">=</span> <span class="n">x</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">int</span> <span class="nf">DeleteL</span><span class="p">(</span><span class="n">element1</span> <span class="n">p</span><span class="p">,</span> <span class="n">tlista</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="k">if</span> <span class="p">(</span><span class="n">p</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">p</span> <span class="o">&lt;</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-49"><a name="L-49"></a> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="n">p</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">;</span> <span class="n">i</span><span class="o">++</span><span class="p">){</span> </span><span id="L-50"><a name="L-50"></a> <span class="n">l</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">sifra</span> <span class="o">=</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">].</span><span class="n">sifra</span><span class="p">;</span> </span><span id="L-51"><a name="L-51"></a> <span class="n">strcpy</span><span class="p">(</span><span class="n">l</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">naziv</span><span class="p">,</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">].</span><span class="n">naziv</span><span class="p">);</span> </span><span id="L-52"><a name="L-52"></a> <span class="p">}</span> </span><span id="L-53"><a name="L-53"></a> <span class="n">l</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="o">--</span><span class="p">;</span> </span><span id="L-54"><a name="L-54"></a> <span class="k">return</span> <span class="mi">1</span><span class="p">;}</span> </span><span id="L-55"><a name="L-55"></a> <span class="k">else</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;}</span> </span><span id="L-56"><a name="L-56"></a> </span><span id="L-57"><a name="L-57"></a><span class="n">tigra</span> <span class="nf">RetrieveL</span><span class="p">(</span><span class="n">element1</span> <span class="n">p</span><span class="p">,</span> <span class="n">tlista</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-58"><a name="L-58"></a> <span class="n">igra</span><span class="p">.</span><span class="n">sifra</span> <span class="o">=</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">p</span><span class="p">].</span><span class="n">sifra</span><span class="p">;</span> </span><span id="L-59"><a name="L-59"></a> <span class="n">strcpy</span><span class="p">(</span><span class="n">igra</span><span class="p">.</span><span class="n">naziv</span><span class="p">,</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">p</span><span class="p">].</span><span class="n">naziv</span><span class="p">);</span> </span><span id="L-60"><a name="L-60"></a> <span class="n">igra</span><span class="p">.</span><span class="n">pegi</span> <span class="o">=</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">p</span><span class="p">].</span><span class="n">pegi</span><span class="p">;</span> </span><span id="L-61"><a name="L-61"></a> <span class="n">strcpy</span><span class="p">(</span><span class="n">igra</span><span class="p">.</span><span class="n">zanr</span><span class="p">,</span> <span class="n">l</span><span class="o">-&gt;</span><span class="n">igre</span><span class="p">[</span><span class="n">p</span><span class="p">].</span><span class="n">zanr</span><span class="p">);</span> </span><span id="L-62"><a name="L-62"></a> <span class="k">return</span> <span class="n">igra</span><span class="p">;}</span> </span><span id="L-63"><a name="L-63"></a> </span><span id="L-64"><a name="L-64"></a><span class="kt">void</span> <span class="nf">DeleteAllL</span><span class="p">(</span><span class="n">tlista</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-65"><a name="L-65"></a> <span class="n">l</span><span class="o">-&gt;</span><span class="n">cursor</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;}</span> </span><span id="L-66"><a name="L-66"></a> </span><span id="L-67"><a name="L-67"></a> </span><span id="L-68"><a name="L-68"></a><span class="n">tlista</span><span class="o">*</span> <span class="nf">InitL</span><span class="p">(</span><span class="n">tlista</span> <span class="o">*</span><span class="n">l</span><span class="p">){</span> </span><span id="L-69"><a name="L-69"></a> <span class="n">l</span> <span class="o">=</span> <span class="k">new</span> <span class="n">tlista</span><span class="p">;</span> </span><span id="L-70"><a name="L-70"></a> <span class="n">l</span><span class="o">-&gt;</span><span class="n">cursor</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-71"><a name="L-71"></a> <span class="k">return</span> <span class="n">l</span><span class="p">;}</span> </span></pre></div> </td></tr></table>
array, biblioteka, header, list, lista, polje