snipt

Ctrl+h for KB shortcuts

C++

lista_polje.h

#ifndef lista_polje
#define lista_polje
#include <iostream>
#include <cstring>
using namespace std;

struct tgame {
	char sifra[7];
	char naziv[100];
	char proizvodjac[100];
	char zanr[100];
	char podzanr[100];
	int pegi;
};

struct tlista {
	tgame game [10000];
	int cursor;	
};
tlista *lista = new tlista;
typedef int vrijed;

vrijed firstL (tlista *lista) {
	return 0;
}

vrijed endL (tlista *lista) {
	return (lista->cursor);
}

vrijed nextL (vrijed pos,tlista *lista) {
	if (pos < lista->cursor && pos >= 0)
		return pos+1;
	if (pos >= lista->cursor)
		return lista->cursor;
	else
		return -1;
}

vrijed previousL (vrijed pos,tlista *lista) {
	if (pos > 0 && pos < lista->cursor)
		return pos-1;
	if (pos >= lista->cursor)
		return lista->cursor;
	else
		return -1;
}

vrijed locateL(char sifra[7], tlista *lista) {
	for (int i = 0; i < lista->cursor; i++) {
		if (strcmp(sifra, lista->game[i].sifra) == 0)
			return i;	
	}
	return lista->cursor;
}

vrijed insertL (tgame elem, int pos, tlista *lista) {
	if (lista->cursor == 0) {
		lista->cursor++;
		lista->game[0] = elem;
		return 1;
	}
	if ( pos >= 0 && pos <= lista->cursor) {
		lista->cursor += 1;
		for (int i = (lista->cursor-1); i > pos; i--) {
			lista->game[i] = lista->game[i-1];
		}
		lista->game[pos] = elem;
		return 1;
	}
	return 0;
}

vrijed deleteL (vrijed pos, tlista *lista) {
	if (pos == lista->cursor-1) {
		lista->cursor -= 1;
		return 1;
	}
	if (pos >= 0 && pos < (lista->cursor)) {
		for (int i = pos; i < (lista->cursor); i++) {
			lista->game[i] = lista->game[i+1];
		}
		lista->cursor -= 1;
		return 1;
	}
	return -1;	
}

tgame retrieveL (vrijed pos, tlista *lista) {
	return lista->game[pos];	
}

void deleteallL (tlista *lista) {
	lista->cursor = 0;
}

void initL (tlista *lista) {
	lista->cursor = 0;
}
#endif

Description

Header lista_polje.h contains all functions for list implementation with array.
https://snipt.net/embed/54dc81b971789e8ffc8a68d833877497/
/raw/54dc81b971789e8ffc8a68d833877497/
54dc81b971789e8ffc8a68d833877497
cpp
C++
100
2019-07-16T10:54:40
True
False
False
/api/public/snipt/137198/
lista_poljeh-a1cba923
<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> <a href="#L-82"> 82</a> <a href="#L-83"> 83</a> <a href="#L-84"> 84</a> <a href="#L-85"> 85</a> <a href="#L-86"> 86</a> <a href="#L-87"> 87</a> <a href="#L-88"> 88</a> <a href="#L-89"> 89</a> <a href="#L-90"> 90</a> <a href="#L-91"> 91</a> <a href="#L-92"> 92</a> <a href="#L-93"> 93</a> <a href="#L-94"> 94</a> <a href="#L-95"> 95</a> <a href="#L-96"> 96</a> <a href="#L-97"> 97</a> <a href="#L-98"> 98</a> <a href="#L-99"> 99</a> <a href="#L-100">100</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">#ifndef lista_polje</span> </span><span id="L-2"><a name="L-2"></a><span class="cp">#define lista_polje</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="cp">#include</span> <span class="cpf">&lt;cstring&gt;</span><span class="cp"></span> </span><span id="L-5"><a name="L-5"></a><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</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">tgame</span> <span class="p">{</span> </span><span id="L-8"><a name="L-8"></a> <span class="kt">char</span> <span class="n">sifra</span><span class="p">[</span><span class="mi">7</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">100</span><span class="p">];</span> </span><span id="L-10"><a name="L-10"></a> <span class="kt">char</span> <span class="n">proizvodjac</span><span class="p">[</span><span class="mi">100</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">100</span><span class="p">];</span> </span><span id="L-12"><a name="L-12"></a> <span class="kt">char</span> <span class="n">podzanr</span><span class="p">[</span><span class="mi">100</span><span class="p">];</span> </span><span id="L-13"><a name="L-13"></a> <span class="kt">int</span> <span class="n">pegi</span><span class="p">;</span> </span><span id="L-14"><a name="L-14"></a><span class="p">};</span> </span><span id="L-15"><a name="L-15"></a> </span><span id="L-16"><a name="L-16"></a><span class="k">struct</span> <span class="n">tlista</span> <span class="p">{</span> </span><span id="L-17"><a name="L-17"></a> <span class="n">tgame</span> <span class="n">game</span> <span class="p">[</span><span class="mi">10000</span><span class="p">];</span> </span><span id="L-18"><a name="L-18"></a> <span class="kt">int</span> <span class="n">cursor</span><span class="p">;</span> </span><span id="L-19"><a name="L-19"></a><span class="p">};</span> </span><span id="L-20"><a name="L-20"></a><span class="n">tlista</span> <span class="o">*</span><span class="n">lista</span> <span class="o">=</span> <span class="k">new</span> <span class="n">tlista</span><span class="p">;</span> </span><span id="L-21"><a name="L-21"></a><span class="k">typedef</span> <span class="kt">int</span> <span class="n">vrijed</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">vrijed</span> <span class="nf">firstL</span> <span class="p">(</span><span class="n">tlista</span> <span class="o">*</span><span class="n">lista</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-24"><a name="L-24"></a> <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 class="p">}</span> </span><span id="L-26"><a name="L-26"></a> </span><span id="L-27"><a name="L-27"></a><span class="n">vrijed</span> <span class="nf">endL</span> <span class="p">(</span><span class="n">tlista</span> <span class="o">*</span><span class="n">lista</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-28"><a name="L-28"></a> <span class="k">return</span> <span class="p">(</span><span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">);</span> </span><span id="L-29"><a name="L-29"></a><span class="p">}</span> </span><span id="L-30"><a name="L-30"></a> </span><span id="L-31"><a name="L-31"></a><span class="n">vrijed</span> <span class="nf">nextL</span> <span class="p">(</span><span class="n">vrijed</span> <span class="n">pos</span><span class="p">,</span><span class="n">tlista</span> <span class="o">*</span><span class="n">lista</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-32"><a name="L-32"></a> <span class="k">if</span> <span class="p">(</span><span class="n">pos</span> <span class="o">&lt;</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span> <span class="o">&amp;&amp;</span> <span class="n">pos</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span> </span><span id="L-33"><a name="L-33"></a> <span class="k">return</span> <span class="n">pos</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="k">if</span> <span class="p">(</span><span class="n">pos</span> <span class="o">&gt;=</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">)</span> </span><span id="L-35"><a name="L-35"></a> <span class="k">return</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">;</span> </span><span id="L-36"><a name="L-36"></a> <span class="k">else</span> </span><span id="L-37"><a name="L-37"></a> <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="p">}</span> </span><span id="L-39"><a name="L-39"></a> </span><span id="L-40"><a name="L-40"></a><span class="n">vrijed</span> <span class="nf">previousL</span> <span class="p">(</span><span class="n">vrijed</span> <span class="n">pos</span><span class="p">,</span><span class="n">tlista</span> <span class="o">*</span><span class="n">lista</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-41"><a name="L-41"></a> <span class="k">if</span> <span class="p">(</span><span class="n">pos</span> <span class="o">&gt;</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">pos</span> <span class="o">&lt;</span> <span class="n">lista</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="k">return</span> <span class="n">pos</span><span class="o">-</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-43"><a name="L-43"></a> <span class="k">if</span> <span class="p">(</span><span class="n">pos</span> <span class="o">&gt;=</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">)</span> </span><span id="L-44"><a name="L-44"></a> <span class="k">return</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">;</span> </span><span id="L-45"><a name="L-45"></a> <span class="k">else</span> </span><span id="L-46"><a name="L-46"></a> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-47"><a name="L-47"></a><span class="p">}</span> </span><span id="L-48"><a name="L-48"></a> </span><span id="L-49"><a name="L-49"></a><span class="n">vrijed</span> <span class="nf">locateL</span><span class="p">(</span><span class="kt">char</span> <span class="n">sifra</span><span class="p">[</span><span class="mi">7</span><span class="p">],</span> <span class="n">tlista</span> <span class="o">*</span><span class="n">lista</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-50"><a name="L-50"></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">lista</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 class="p">{</span> </span><span id="L-51"><a name="L-51"></a> <span class="k">if</span> <span class="p">(</span><span class="n">strcmp</span><span class="p">(</span><span class="n">sifra</span><span class="p">,</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">game</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">sifra</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> </span><span id="L-52"><a name="L-52"></a> <span class="k">return</span> <span class="n">i</span><span class="p">;</span> </span><span id="L-53"><a name="L-53"></a> <span class="p">}</span> </span><span id="L-54"><a name="L-54"></a> <span class="k">return</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">;</span> </span><span id="L-55"><a name="L-55"></a><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">vrijed</span> <span class="nf">insertL</span> <span class="p">(</span><span class="n">tgame</span> <span class="n">elem</span><span class="p">,</span> <span class="kt">int</span> <span class="n">pos</span><span class="p">,</span> <span class="n">tlista</span> <span class="o">*</span><span class="n">lista</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-58"><a name="L-58"></a> <span class="k">if</span> <span class="p">(</span><span class="n">lista</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 class="p">{</span> </span><span id="L-59"><a name="L-59"></a> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="o">++</span><span class="p">;</span> </span><span id="L-60"><a name="L-60"></a> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">game</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="n">elem</span><span class="p">;</span> </span><span id="L-61"><a name="L-61"></a> <span class="k">return</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-62"><a name="L-62"></a> <span class="p">}</span> </span><span id="L-63"><a name="L-63"></a> <span class="k">if</span> <span class="p">(</span> <span class="n">pos</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">pos</span> <span class="o">&lt;=</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-64"><a name="L-64"></a> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-65"><a name="L-65"></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="p">(</span><span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</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">pos</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-66"><a name="L-66"></a> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">game</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">game</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-67"><a name="L-67"></a> <span class="p">}</span> </span><span id="L-68"><a name="L-68"></a> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">game</span><span class="p">[</span><span class="n">pos</span><span class="p">]</span> <span class="o">=</span> <span class="n">elem</span><span class="p">;</span> </span><span id="L-69"><a name="L-69"></a> <span class="k">return</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-70"><a name="L-70"></a> <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">vrijed</span> <span class="nf">deleteL</span> <span class="p">(</span><span class="n">vrijed</span> <span class="n">pos</span><span class="p">,</span> <span class="n">tlista</span> <span class="o">*</span><span class="n">lista</span><span class="p">)</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">pos</span> <span class="o">==</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="o">-</span><span class="mi">1</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-76"><a name="L-76"></a> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span> <span class="o">-=</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-77"><a name="L-77"></a> <span class="k">return</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-78"><a name="L-78"></a> <span class="p">}</span> </span><span id="L-79"><a name="L-79"></a> <span class="k">if</span> <span class="p">(</span><span class="n">pos</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">pos</span> <span class="o">&lt;</span> <span class="p">(</span><span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span><span class="p">))</span> <span class="p">{</span> </span><span id="L-80"><a name="L-80"></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">pos</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="p">(</span><span class="n">lista</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 class="p">{</span> </span><span id="L-81"><a name="L-81"></a> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">game</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">game</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-82"><a name="L-82"></a> <span class="p">}</span> </span><span id="L-83"><a name="L-83"></a> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">cursor</span> <span class="o">-=</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-84"><a name="L-84"></a> <span class="k">return</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-85"><a name="L-85"></a> <span class="p">}</span> </span><span id="L-86"><a name="L-86"></a> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-87"><a name="L-87"></a><span class="p">}</span> </span><span id="L-88"><a name="L-88"></a> </span><span id="L-89"><a name="L-89"></a><span class="n">tgame</span> <span class="nf">retrieveL</span> <span class="p">(</span><span class="n">vrijed</span> <span class="n">pos</span><span class="p">,</span> <span class="n">tlista</span> <span class="o">*</span><span class="n">lista</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-90"><a name="L-90"></a> <span class="k">return</span> <span class="n">lista</span><span class="o">-&gt;</span><span class="n">game</span><span class="p">[</span><span class="n">pos</span><span class="p">];</span> </span><span id="L-91"><a name="L-91"></a><span class="p">}</span> </span><span id="L-92"><a name="L-92"></a> </span><span id="L-93"><a name="L-93"></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">lista</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-94"><a name="L-94"></a> <span class="n">lista</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-95"><a name="L-95"></a><span class="p">}</span> </span><span id="L-96"><a name="L-96"></a> </span><span id="L-97"><a name="L-97"></a><span class="kt">void</span> <span class="nf">initL</span> <span class="p">(</span><span class="n">tlista</span> <span class="o">*</span><span class="n">lista</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-98"><a name="L-98"></a> <span class="n">lista</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-99"><a name="L-99"></a><span class="p">}</span> </span><span id="L-100"><a name="L-100"></a><span class="cp">#endif</span> </span></pre></div> </td></tr></table>
"ATP List", "ATP Lista", "apstract data structures", "data structures", "strukture podataka", algorithms, algoritmi, array, c++, infomratics, informatika, list, pointers, programiranje, programming