snipt

Ctrl+h for KB shortcuts

C++

Datoteka zaglavlja: lista_polje.h

using namespace std;

struct igra{
	char sifra[10];
	char naziv[30];
	char proizvod[20];
	char zanr[20];
	char podzanr[20];
	int PEGI;
	
};

struct lista{
	igra podaci[1000];
	int kursor;
};

void InitL(lista* L){
	L.kursor=0;
}

int FirstL(lista* L){
	return 0;
}

int EndL(lista* L){
	return L.kursor;
}

int NextL(int p,lista* L){
	if(p<0) return -1;
	else if (p>=0 && p<L.kursor) return p+1;
	else return -1;
}

int PreviousL(int p, lista* L){
	if(p<1) return -1;
	else if (p>0 && p<=L.kursor) return p-1;
	else return -1;
}

int LocateL(igra* x, lista* L){
	for(int i=0;i<=L.kursor;i++){
		if((!strcmp(x.sifra, L.podaci[i].sifra))
			&& (!strcmp(x.naziv,L.podaci[i].naziv))
			&& (!strcmp(x.proizvod,L.podaci[i].proizvod))
			&& (!strcmp(x.zanr,L.podaci[i].zanr))
			&& (!strcmp(x.podzanr,L.podaci[i].podzanr))
			&& (!strcmp(x.PEGI,L.podaci[i].PEGI)))
				return i;
		return L.kursor;
	}

}

int InsertL(igra* x, int p, lista* L){
	if(p<0 || p>L.kursor) return -1;
	L.kursor++;
	for(int i=L.kursor-1; i>p; i--)
		L.podaci[i]=L.podaci[i+1];
	L.podaci[p]= x;
	return 0;
	
}

int DeleteL(int p, lista* L){
	if(p<0 || p>L.kursor) return -1;
	for(int i=p; i<L.kursor+1; i++)
		L.podaci[i]=L.podaci[i+1];
	L.kursor--;
	return 0;
}

lista* RetrieveL(int p, lista* L){
	if(p<0 || p>L.kursor) return NULL;
	return L.podaci[p];
}

void DeleteAllL(lista* L){
	L.kursor=0;
}

Description

Funkcije za rad s listom.
https://snipt.net/embed/85afa5fc149b12be28064e89da10db37/
/raw/85afa5fc149b12be28064e89da10db37/
85afa5fc149b12be28064e89da10db37
cpp
C++
81
2019-07-16T10:24:12
True
False
False
Nov 16, 2014 at 04:59 PM
/api/public/snipt/137220/
datoteka-zaglavlja-lista_poljeh-4db1e7ce
<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> <a href="#L-72">72</a> <a href="#L-73">73</a> <a href="#L-74">74</a> <a href="#L-75">75</a> <a href="#L-76">76</a> <a href="#L-77">77</a> <a href="#L-78">78</a> <a href="#L-79">79</a> <a href="#L-80">80</a> <a href="#L-81">81</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">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span> </span><span id="L-2"><a name="L-2"></a> </span><span id="L-3"><a name="L-3"></a><span class="k">struct</span> <span class="n">igra</span><span class="p">{</span> </span><span id="L-4"><a name="L-4"></a> <span class="kt">char</span> <span class="n">sifra</span><span class="p">[</span><span class="mi">10</span><span class="p">];</span> </span><span id="L-5"><a name="L-5"></a> <span class="kt">char</span> <span class="n">naziv</span><span class="p">[</span><span class="mi">30</span><span class="p">];</span> </span><span id="L-6"><a name="L-6"></a> <span class="kt">char</span> <span class="n">proizvod</span><span class="p">[</span><span class="mi">20</span><span class="p">];</span> </span><span id="L-7"><a name="L-7"></a> <span class="kt">char</span> <span class="n">zanr</span><span class="p">[</span><span class="mi">20</span><span class="p">];</span> </span><span id="L-8"><a name="L-8"></a> <span class="kt">char</span> <span class="n">podzanr</span><span class="p">[</span><span class="mi">20</span><span class="p">];</span> </span><span id="L-9"><a name="L-9"></a> <span class="kt">int</span> <span class="n">PEGI</span><span class="p">;</span> </span><span id="L-10"><a name="L-10"></a> </span><span id="L-11"><a name="L-11"></a><span class="p">};</span> </span><span id="L-12"><a name="L-12"></a> </span><span id="L-13"><a name="L-13"></a><span class="k">struct</span> <span class="n">lista</span><span class="p">{</span> </span><span id="L-14"><a name="L-14"></a> <span class="n">igra</span> <span class="n">podaci</span><span class="p">[</span><span class="mi">1000</span><span class="p">];</span> </span><span id="L-15"><a name="L-15"></a> <span class="kt">int</span> <span class="n">kursor</span><span class="p">;</span> </span><span id="L-16"><a name="L-16"></a><span class="p">};</span> </span><span id="L-17"><a name="L-17"></a> </span><span id="L-18"><a name="L-18"></a><span class="kt">void</span> <span class="nf">InitL</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-19"><a name="L-19"></a> <span class="n">L</span><span class="p">.</span><span class="n">kursor</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span> </span><span id="L-20"><a name="L-20"></a><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="kt">int</span> <span class="nf">FirstL</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-23"><a name="L-23"></a> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-24"><a name="L-24"></a><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="kt">int</span> <span class="nf">EndL</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-27"><a name="L-27"></a> <span class="k">return</span> <span class="n">L</span><span class="p">.</span><span class="n">kursor</span><span class="p">;</span> </span><span id="L-28"><a name="L-28"></a><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="kt">int</span> <span class="nf">NextL</span><span class="p">(</span><span class="kt">int</span> <span class="n">p</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-31"><a name="L-31"></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="p">)</span> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-32"><a name="L-32"></a> <span class="k">else</span> <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="p">.</span><span class="n">kursor</span><span class="p">)</span> <span class="k">return</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 class="k">else</span> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-34"><a name="L-34"></a><span class="p">}</span> </span><span id="L-35"><a name="L-35"></a> </span><span id="L-36"><a name="L-36"></a><span class="kt">int</span> <span class="nf">PreviousL</span><span class="p">(</span><span class="kt">int</span> <span class="n">p</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-37"><a name="L-37"></a> <span class="k">if</span><span class="p">(</span><span class="n">p</span><span class="o">&lt;</span><span class="mi">1</span><span class="p">)</span> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-38"><a name="L-38"></a> <span class="k">else</span> <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="p">.</span><span class="n">kursor</span><span class="p">)</span> <span class="k">return</span> <span class="n">p</span><span class="o">-</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-39"><a name="L-39"></a> <span class="k">else</span> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-40"><a name="L-40"></a><span class="p">}</span> </span><span id="L-41"><a name="L-41"></a> </span><span id="L-42"><a name="L-42"></a><span class="kt">int</span> <span class="nf">LocateL</span><span class="p">(</span><span class="n">igra</span><span class="o">*</span> <span class="n">x</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-43"><a name="L-43"></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="p">.</span><span class="n">kursor</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">){</span> </span><span id="L-44"><a name="L-44"></a> <span class="k">if</span><span class="p">((</span><span class="o">!</span><span class="n">strcmp</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">sifra</span><span class="p">,</span> <span class="n">L</span><span class="p">.</span><span class="n">podaci</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">sifra</span><span class="p">))</span> </span><span id="L-45"><a name="L-45"></a> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="o">!</span><span class="n">strcmp</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">naziv</span><span class="p">,</span><span class="n">L</span><span class="p">.</span><span class="n">podaci</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">naziv</span><span class="p">))</span> </span><span id="L-46"><a name="L-46"></a> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="o">!</span><span class="n">strcmp</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">proizvod</span><span class="p">,</span><span class="n">L</span><span class="p">.</span><span class="n">podaci</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">proizvod</span><span class="p">))</span> </span><span id="L-47"><a name="L-47"></a> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="o">!</span><span class="n">strcmp</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">zanr</span><span class="p">,</span><span class="n">L</span><span class="p">.</span><span class="n">podaci</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">zanr</span><span class="p">))</span> </span><span id="L-48"><a name="L-48"></a> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="o">!</span><span class="n">strcmp</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">podzanr</span><span class="p">,</span><span class="n">L</span><span class="p">.</span><span class="n">podaci</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">podzanr</span><span class="p">))</span> </span><span id="L-49"><a name="L-49"></a> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="o">!</span><span class="n">strcmp</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">PEGI</span><span class="p">,</span><span class="n">L</span><span class="p">.</span><span class="n">podaci</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">PEGI</span><span class="p">)))</span> </span><span id="L-50"><a name="L-50"></a> <span class="k">return</span> <span class="n">i</span><span class="p">;</span> </span><span id="L-51"><a name="L-51"></a> <span class="k">return</span> <span class="n">L</span><span class="p">.</span><span class="n">kursor</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><span id="L-54"><a name="L-54"></a><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">int</span> <span class="nf">InsertL</span><span class="p">(</span><span class="n">igra</span><span class="o">*</span> <span class="n">x</span><span class="p">,</span> <span class="kt">int</span> <span class="n">p</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-57"><a name="L-57"></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="p">.</span><span class="n">kursor</span><span class="p">)</span> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-58"><a name="L-58"></a> <span class="n">L</span><span class="p">.</span><span class="n">kursor</span><span class="o">++</span><span class="p">;</span> </span><span id="L-59"><a name="L-59"></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">L</span><span class="p">.</span><span class="n">kursor</span><span class="o">-</span><span class="mi">1</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="n">i</span><span class="o">--</span><span class="p">)</span> </span><span id="L-60"><a name="L-60"></a> <span class="n">L</span><span class="p">.</span><span class="n">podaci</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="p">.</span><span class="n">podaci</span><span class="p">[</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">];</span> </span><span id="L-61"><a name="L-61"></a> <span class="n">L</span><span class="p">.</span><span class="n">podaci</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-62"><a name="L-62"></a> <span class="k">return</span> <span class="mi">0</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="p">}</span> </span><span id="L-65"><a name="L-65"></a> </span><span id="L-66"><a name="L-66"></a><span class="kt">int</span> <span class="nf">DeleteL</span><span class="p">(</span><span class="kt">int</span> <span class="n">p</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-67"><a name="L-67"></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="p">.</span><span class="n">kursor</span><span class="p">)</span> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-68"><a name="L-68"></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="p">.</span><span class="n">kursor</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><span id="L-69"><a name="L-69"></a> <span class="n">L</span><span class="p">.</span><span class="n">podaci</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="p">.</span><span class="n">podaci</span><span class="p">[</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">];</span> </span><span id="L-70"><a name="L-70"></a> <span class="n">L</span><span class="p">.</span><span class="n">kursor</span><span class="o">--</span><span class="p">;</span> </span><span id="L-71"><a name="L-71"></a> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-72"><a name="L-72"></a><span class="p">}</span> </span><span id="L-73"><a name="L-73"></a> </span><span id="L-74"><a name="L-74"></a><span class="n">lista</span><span class="o">*</span> <span class="nf">RetrieveL</span><span class="p">(</span><span class="kt">int</span> <span class="n">p</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-75"><a name="L-75"></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="p">.</span><span class="n">kursor</span><span class="p">)</span> <span class="k">return</span> <span class="nb">NULL</span><span class="p">;</span> </span><span id="L-76"><a name="L-76"></a> <span class="k">return</span> <span class="n">L</span><span class="p">.</span><span class="n">podaci</span><span class="p">[</span><span class="n">p</span><span class="p">];</span> </span><span id="L-77"><a name="L-77"></a><span class="p">}</span> </span><span id="L-78"><a name="L-78"></a> </span><span id="L-79"><a name="L-79"></a><span class="kt">void</span> <span class="nf">DeleteAllL</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-80"><a name="L-80"></a> <span class="n">L</span><span class="p">.</span><span class="n">kursor</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span> </span><span id="L-81"><a name="L-81"></a><span class="p">}</span> </span></pre></div> </td></tr></table>
igra, list, lista