snipt

Ctrl+h for KB shortcuts

Text only

marfioren-l_polj.h

#include<string.h>
#include <cstring>
using namespace std;

            
struct z{
        string zanr1;
        string zanr2;
        string zanr3;
        string podzanr1;
        string podzanr2;
       
            };

struct igre{
       string sifra;
       string naziv;
       string proizv;
       z zanr;
       string PEGI;
            };


struct lista{
       string sifra[1000];
       string naziv[1000];
       string proizv[1000];
       z zanr[1000];
       string PEGI[1000];
       int cursor;
       };      
  
typedef int el;
igre x;

el Endl(lista *l){

                 return l->cursor+1;
   
    
    }
    
el Firstl(lista *l){
        if (l->cursor == 0) 
           Endl(l);
        return 0;
    
    }

        
lista *Initl(lista *l) {
       l=new lista;
       l->cursor = 0;
        return l;
        }
        
el Nextl(el pos, lista *l){
if ((pos > l->cursor) || (pos < 0))
           return 0;
        return(pos+ 1);
    }
    


el insertl(igre igr, el pos, lista *l){
                int br;
                if((pos<=l->cursor+1)&&(pos>=0)){
                for (br=l->cursor; br >= pos; br --){
                     l->PEGI[br]=l->PEGI[br-1];
                     l->sifra[br]=l->sifra[br-1];
                        l->naziv[br]=l->naziv[br-1];
                        l->proizv[br]=l->proizv[br-1];
                        l->zanr[br]=l->zanr[br-1];
                        }
                        
                     l->cursor ++;
                      l->PEGI[br]=igr.PEGI;
                     l->sifra[br]=igr.sifra;
                      l->naziv[br]=igr.naziv;
                        l->proizv[br]=igr.proizv;
                        l->zanr[br]=igr.zanr;
                        
                        return 1;
                        }
               
                else
                return 0;
                }

igre retrivel(el pos, lista *l) {
        if ((pos < l->cursor) && (pos >= 0)) {
                      x.sifra = l->sifra[pos];
                       x.naziv = l->naziv[pos];
                      x.proizv = l->proizv[pos];
                     x.zanr.zanr1 = l->zanr[pos].zanr1;
                       x.zanr.zanr2 = l->zanr[pos].zanr2;
                        x.zanr.zanr3 = l->zanr[pos].zanr3;
                         x.zanr.podzanr1 = l->zanr[pos].podzanr1;
                          x.zanr.podzanr2 = l->zanr[pos].podzanr2;
                       x.PEGI = l->PEGI[pos];  
                      return x;
                      }
        }
                
el deletel(el pos, lista *l){
          int br;
        if ((pos < l->cursor) && (pos >= 0)) {
                for (br = pos; br < l->cursor; br++){
                     l->PEGI[br]=l->PEGI[br+1];
                     l->sifra[br]=l->sifra[br+1];
                        l->naziv[br]=l->naziv[br+1];
                        l->proizv[br]=l->proizv[br+1];
                        l->zanr[br]=l->zanr[br+1];
                    }
                l->cursor --;
                return 1;
                }
        else
            return 0;
} 
 
el Locatel(string p, lista *l) {
        el br = 1;
        while (br != l->cursor){
       if(p==l->sifra[br]){
                          return br;
                          }
                          br++;
                          }
     
        
        }

el deleteall(lista *l){
      l->cursor=0;
        return 0;
     }

Description

Biblioteka koja sadrži funkcije pomoću kojih implementiramo listu pomoću polja, sadrži funkcije Initl, Endl, Fisrtl, insertl, Nextl,Previousl,deletel i deleteall
https://snipt.net/embed/d48f63be96a88848c36e0052a6bd2766/
/raw/d48f63be96a88848c36e0052a6bd2766/
d48f63be96a88848c36e0052a6bd2766
text
Text only
137
2019-07-23T12:21:58
True
False
False
/api/public/snipt/137139/
l_poljh-ff580e6e
<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> <a href="#L-101">101</a> <a href="#L-102">102</a> <a href="#L-103">103</a> <a href="#L-104">104</a> <a href="#L-105">105</a> <a href="#L-106">106</a> <a href="#L-107">107</a> <a href="#L-108">108</a> <a href="#L-109">109</a> <a href="#L-110">110</a> <a href="#L-111">111</a> <a href="#L-112">112</a> <a href="#L-113">113</a> <a href="#L-114">114</a> <a href="#L-115">115</a> <a href="#L-116">116</a> <a href="#L-117">117</a> <a href="#L-118">118</a> <a href="#L-119">119</a> <a href="#L-120">120</a> <a href="#L-121">121</a> <a href="#L-122">122</a> <a href="#L-123">123</a> <a href="#L-124">124</a> <a href="#L-125">125</a> <a href="#L-126">126</a> <a href="#L-127">127</a> <a href="#L-128">128</a> <a href="#L-129">129</a> <a href="#L-130">130</a> <a href="#L-131">131</a> <a href="#L-132">132</a> <a href="#L-133">133</a> <a href="#L-134">134</a> <a href="#L-135">135</a> <a href="#L-136">136</a> <a href="#L-137">137</a></pre></div></td><td class="code"><div class="highlight"><pre><span></span><span id="L-1"><a name="L-1"></a>#include&lt;string.h&gt; </span><span id="L-2"><a name="L-2"></a>#include &lt;cstring&gt; </span><span id="L-3"><a name="L-3"></a>using namespace std; </span><span id="L-4"><a name="L-4"></a> </span><span id="L-5"><a name="L-5"></a> </span><span id="L-6"><a name="L-6"></a>struct z{ </span><span id="L-7"><a name="L-7"></a> string zanr1; </span><span id="L-8"><a name="L-8"></a> string zanr2; </span><span id="L-9"><a name="L-9"></a> string zanr3; </span><span id="L-10"><a name="L-10"></a> string podzanr1; </span><span id="L-11"><a name="L-11"></a> string podzanr2; </span><span id="L-12"><a name="L-12"></a> </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>struct igre{ </span><span id="L-16"><a name="L-16"></a> string sifra; </span><span id="L-17"><a name="L-17"></a> string naziv; </span><span id="L-18"><a name="L-18"></a> string proizv; </span><span id="L-19"><a name="L-19"></a> z zanr; </span><span id="L-20"><a name="L-20"></a> string PEGI; </span><span id="L-21"><a name="L-21"></a> }; </span><span id="L-22"><a name="L-22"></a> </span><span id="L-23"><a name="L-23"></a> </span><span id="L-24"><a name="L-24"></a>struct lista{ </span><span id="L-25"><a name="L-25"></a> string sifra[1000]; </span><span id="L-26"><a name="L-26"></a> string naziv[1000]; </span><span id="L-27"><a name="L-27"></a> string proizv[1000]; </span><span id="L-28"><a name="L-28"></a> z zanr[1000]; </span><span id="L-29"><a name="L-29"></a> string PEGI[1000]; </span><span id="L-30"><a name="L-30"></a> int cursor; </span><span id="L-31"><a name="L-31"></a> }; </span><span id="L-32"><a name="L-32"></a> </span><span id="L-33"><a name="L-33"></a>typedef int el; </span><span id="L-34"><a name="L-34"></a>igre x; </span><span id="L-35"><a name="L-35"></a> </span><span id="L-36"><a name="L-36"></a>el Endl(lista *l){ </span><span id="L-37"><a name="L-37"></a> </span><span id="L-38"><a name="L-38"></a> return l-&gt;cursor+1; </span><span id="L-39"><a name="L-39"></a> </span><span id="L-40"><a name="L-40"></a> </span><span id="L-41"><a name="L-41"></a> } </span><span id="L-42"><a name="L-42"></a> </span><span id="L-43"><a name="L-43"></a>el Firstl(lista *l){ </span><span id="L-44"><a name="L-44"></a> if (l-&gt;cursor == 0) </span><span id="L-45"><a name="L-45"></a> Endl(l); </span><span id="L-46"><a name="L-46"></a> return 0; </span><span id="L-47"><a name="L-47"></a> </span><span id="L-48"><a name="L-48"></a> } </span><span id="L-49"><a name="L-49"></a> </span><span id="L-50"><a name="L-50"></a> </span><span id="L-51"><a name="L-51"></a>lista *Initl(lista *l) { </span><span id="L-52"><a name="L-52"></a> l=new lista; </span><span id="L-53"><a name="L-53"></a> l-&gt;cursor = 0; </span><span id="L-54"><a name="L-54"></a> return l; </span><span id="L-55"><a name="L-55"></a> } </span><span id="L-56"><a name="L-56"></a> </span><span id="L-57"><a name="L-57"></a>el Nextl(el pos, lista *l){ </span><span id="L-58"><a name="L-58"></a>if ((pos &gt; l-&gt;cursor) || (pos &lt; 0)) </span><span id="L-59"><a name="L-59"></a> return 0; </span><span id="L-60"><a name="L-60"></a> return(pos+ 1); </span><span id="L-61"><a name="L-61"></a> } </span><span id="L-62"><a name="L-62"></a> </span><span id="L-63"><a name="L-63"></a> </span><span id="L-64"><a name="L-64"></a> </span><span id="L-65"><a name="L-65"></a>el insertl(igre igr, el pos, lista *l){ </span><span id="L-66"><a name="L-66"></a> int br; </span><span id="L-67"><a name="L-67"></a> if((pos&lt;=l-&gt;cursor+1)&amp;&amp;(pos&gt;=0)){ </span><span id="L-68"><a name="L-68"></a> for (br=l-&gt;cursor; br &gt;= pos; br --){ </span><span id="L-69"><a name="L-69"></a> l-&gt;PEGI[br]=l-&gt;PEGI[br-1]; </span><span id="L-70"><a name="L-70"></a> l-&gt;sifra[br]=l-&gt;sifra[br-1]; </span><span id="L-71"><a name="L-71"></a> l-&gt;naziv[br]=l-&gt;naziv[br-1]; </span><span id="L-72"><a name="L-72"></a> l-&gt;proizv[br]=l-&gt;proizv[br-1]; </span><span id="L-73"><a name="L-73"></a> l-&gt;zanr[br]=l-&gt;zanr[br-1]; </span><span id="L-74"><a name="L-74"></a> } </span><span id="L-75"><a name="L-75"></a> </span><span id="L-76"><a name="L-76"></a> l-&gt;cursor ++; </span><span id="L-77"><a name="L-77"></a> l-&gt;PEGI[br]=igr.PEGI; </span><span id="L-78"><a name="L-78"></a> l-&gt;sifra[br]=igr.sifra; </span><span id="L-79"><a name="L-79"></a> l-&gt;naziv[br]=igr.naziv; </span><span id="L-80"><a name="L-80"></a> l-&gt;proizv[br]=igr.proizv; </span><span id="L-81"><a name="L-81"></a> l-&gt;zanr[br]=igr.zanr; </span><span id="L-82"><a name="L-82"></a> </span><span id="L-83"><a name="L-83"></a> return 1; </span><span id="L-84"><a name="L-84"></a> } </span><span id="L-85"><a name="L-85"></a> </span><span id="L-86"><a name="L-86"></a> else </span><span id="L-87"><a name="L-87"></a> return 0; </span><span id="L-88"><a name="L-88"></a> } </span><span id="L-89"><a name="L-89"></a> </span><span id="L-90"><a name="L-90"></a>igre retrivel(el pos, lista *l) { </span><span id="L-91"><a name="L-91"></a> if ((pos &lt; l-&gt;cursor) &amp;&amp; (pos &gt;= 0)) { </span><span id="L-92"><a name="L-92"></a> x.sifra = l-&gt;sifra[pos]; </span><span id="L-93"><a name="L-93"></a> x.naziv = l-&gt;naziv[pos]; </span><span id="L-94"><a name="L-94"></a> x.proizv = l-&gt;proizv[pos]; </span><span id="L-95"><a name="L-95"></a> x.zanr.zanr1 = l-&gt;zanr[pos].zanr1; </span><span id="L-96"><a name="L-96"></a> x.zanr.zanr2 = l-&gt;zanr[pos].zanr2; </span><span id="L-97"><a name="L-97"></a> x.zanr.zanr3 = l-&gt;zanr[pos].zanr3; </span><span id="L-98"><a name="L-98"></a> x.zanr.podzanr1 = l-&gt;zanr[pos].podzanr1; </span><span id="L-99"><a name="L-99"></a> x.zanr.podzanr2 = l-&gt;zanr[pos].podzanr2; </span><span id="L-100"><a name="L-100"></a> x.PEGI = l-&gt;PEGI[pos]; </span><span id="L-101"><a name="L-101"></a> return x; </span><span id="L-102"><a name="L-102"></a> } </span><span id="L-103"><a name="L-103"></a> } </span><span id="L-104"><a name="L-104"></a> </span><span id="L-105"><a name="L-105"></a>el deletel(el pos, lista *l){ </span><span id="L-106"><a name="L-106"></a> int br; </span><span id="L-107"><a name="L-107"></a> if ((pos &lt; l-&gt;cursor) &amp;&amp; (pos &gt;= 0)) { </span><span id="L-108"><a name="L-108"></a> for (br = pos; br &lt; l-&gt;cursor; br++){ </span><span id="L-109"><a name="L-109"></a> l-&gt;PEGI[br]=l-&gt;PEGI[br+1]; </span><span id="L-110"><a name="L-110"></a> l-&gt;sifra[br]=l-&gt;sifra[br+1]; </span><span id="L-111"><a name="L-111"></a> l-&gt;naziv[br]=l-&gt;naziv[br+1]; </span><span id="L-112"><a name="L-112"></a> l-&gt;proizv[br]=l-&gt;proizv[br+1]; </span><span id="L-113"><a name="L-113"></a> l-&gt;zanr[br]=l-&gt;zanr[br+1]; </span><span id="L-114"><a name="L-114"></a> } </span><span id="L-115"><a name="L-115"></a> l-&gt;cursor --; </span><span id="L-116"><a name="L-116"></a> return 1; </span><span id="L-117"><a name="L-117"></a> } </span><span id="L-118"><a name="L-118"></a> else </span><span id="L-119"><a name="L-119"></a> return 0; </span><span id="L-120"><a name="L-120"></a>} </span><span id="L-121"><a name="L-121"></a> </span><span id="L-122"><a name="L-122"></a>el Locatel(string p, lista *l) { </span><span id="L-123"><a name="L-123"></a> el br = 1; </span><span id="L-124"><a name="L-124"></a> while (br != l-&gt;cursor){ </span><span id="L-125"><a name="L-125"></a> if(p==l-&gt;sifra[br]){ </span><span id="L-126"><a name="L-126"></a> return br; </span><span id="L-127"><a name="L-127"></a> } </span><span id="L-128"><a name="L-128"></a> br++; </span><span id="L-129"><a name="L-129"></a> } </span><span id="L-130"><a name="L-130"></a> </span><span id="L-131"><a name="L-131"></a> </span><span id="L-132"><a name="L-132"></a> } </span><span id="L-133"><a name="L-133"></a> </span><span id="L-134"><a name="L-134"></a>el deleteall(lista *l){ </span><span id="L-135"><a name="L-135"></a> l-&gt;cursor=0; </span><span id="L-136"><a name="L-136"></a> return 0; </span><span id="L-137"><a name="L-137"></a> } </span></pre></div> </td></tr></table>
biblioteka, funkcije, lista, polja