snipt

Ctrl+h for KB shortcuts

Text only

SP - zadatak 1- polje.h

#include <cstring>

#define error -1

struct ZaposlenaOsoba {
    char OIB[12];
    char prezime[35], ime[35];
    char datum[12], rad_mj[40]; };

struct lis {
    ZaposlenaOsoba polje[10000];
    int cursor; };

typedef int element;

typedef lis *lista;



element FirstL(lista L) {
    return 0; }

element EndL(lista L) {
    return L->cursor; }

element NextL(element p, lista L) {
    if(p == EndL(L)) {
        return error; }
    else {
        return p+1; } }

element PreviousL(element p, lista L) {
    if(p == FirstL(L)) {
        return error; }
    else {
        return p-1; } }

element LocateL(ZaposlenaOsoba x, lista L) {
    for(int i=FirstL(L); i!=L->cursor; i++) {
        if(strcmp(L->polje[i].OIB, x.OIB) == 0 &&
                strcmp(L->polje[i].prezime, x.prezime) == 0 &&
                strcmp(L->polje[i].ime, x.ime) == 0 &&
                strcmp(L->polje[i].datum, x.datum) == 0 &&
                strcmp(L->polje[i].rad_mj, x.rad_mj) == 0) {
            return i; } }

    return EndL(L); }

bool InsertL(ZaposlenaOsoba x, element p, lista L) {
    if(p<0 || p>=10000) {
        return 0; }

    for(int i=EndL(L); i>p; i--) {
        L->polje[i] = L->polje[i-1]; }
    L->cursor = L->cursor+1;

    L->polje[p] = x;

    return 1; }

bool DeleteL(element p, lista L) {
    if(p<0 || p>=10000) {
        return 0; }

    L->cursor = L->cursor-1;
    for(int i=p; i<L->cursor; i++) {
        L->polje[i] = L->polje[i+1]; }

    return 1; }

ZaposlenaOsoba RetreiveL(element p, lista L) {
    return L->polje[p]; }

void DeleteAllL(lista L) {
    L->cursor = 0; }

lista InitL(lista L) {
    L = new lis;
    L->cursor = 0;
    return L; }

Description

datoteka zaglavlja sa poljima
https://snipt.net/embed/892bce5b876263069a351997582d1582/
/raw/892bce5b876263069a351997582d1582/
892bce5b876263069a351997582d1582
text
Text only
80
2019-07-16T10:25:56
True
False
False
Nov 10, 2013 at 01:07 PM
/api/public/snipt/93176/
sp-zad-1-poljeh
<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></pre></div></td><td class="code"><div class="highlight"><pre><span></span><span id="L-1"><a name="L-1"></a>#include &lt;cstring&gt; </span><span id="L-2"><a name="L-2"></a> </span><span id="L-3"><a name="L-3"></a>#define error -1 </span><span id="L-4"><a name="L-4"></a> </span><span id="L-5"><a name="L-5"></a>struct ZaposlenaOsoba { </span><span id="L-6"><a name="L-6"></a> char OIB[12]; </span><span id="L-7"><a name="L-7"></a> char prezime[35], ime[35]; </span><span id="L-8"><a name="L-8"></a> char datum[12], rad_mj[40]; }; </span><span id="L-9"><a name="L-9"></a> </span><span id="L-10"><a name="L-10"></a>struct lis { </span><span id="L-11"><a name="L-11"></a> ZaposlenaOsoba polje[10000]; </span><span id="L-12"><a name="L-12"></a> int cursor; }; </span><span id="L-13"><a name="L-13"></a> </span><span id="L-14"><a name="L-14"></a>typedef int element; </span><span id="L-15"><a name="L-15"></a> </span><span id="L-16"><a name="L-16"></a>typedef lis *lista; </span><span id="L-17"><a name="L-17"></a> </span><span id="L-18"><a name="L-18"></a> </span><span id="L-19"><a name="L-19"></a> </span><span id="L-20"><a name="L-20"></a>element FirstL(lista L) { </span><span id="L-21"><a name="L-21"></a> return 0; } </span><span id="L-22"><a name="L-22"></a> </span><span id="L-23"><a name="L-23"></a>element EndL(lista L) { </span><span id="L-24"><a name="L-24"></a> return L-&gt;cursor; } </span><span id="L-25"><a name="L-25"></a> </span><span id="L-26"><a name="L-26"></a>element NextL(element p, lista L) { </span><span id="L-27"><a name="L-27"></a> if(p == EndL(L)) { </span><span id="L-28"><a name="L-28"></a> return error; } </span><span id="L-29"><a name="L-29"></a> else { </span><span id="L-30"><a name="L-30"></a> return p+1; } } </span><span id="L-31"><a name="L-31"></a> </span><span id="L-32"><a name="L-32"></a>element PreviousL(element p, lista L) { </span><span id="L-33"><a name="L-33"></a> if(p == FirstL(L)) { </span><span id="L-34"><a name="L-34"></a> return error; } </span><span id="L-35"><a name="L-35"></a> else { </span><span id="L-36"><a name="L-36"></a> return p-1; } } </span><span id="L-37"><a name="L-37"></a> </span><span id="L-38"><a name="L-38"></a>element LocateL(ZaposlenaOsoba x, lista L) { </span><span id="L-39"><a name="L-39"></a> for(int i=FirstL(L); i!=L-&gt;cursor; i++) { </span><span id="L-40"><a name="L-40"></a> if(strcmp(L-&gt;polje[i].OIB, x.OIB) == 0 &amp;&amp; </span><span id="L-41"><a name="L-41"></a> strcmp(L-&gt;polje[i].prezime, x.prezime) == 0 &amp;&amp; </span><span id="L-42"><a name="L-42"></a> strcmp(L-&gt;polje[i].ime, x.ime) == 0 &amp;&amp; </span><span id="L-43"><a name="L-43"></a> strcmp(L-&gt;polje[i].datum, x.datum) == 0 &amp;&amp; </span><span id="L-44"><a name="L-44"></a> strcmp(L-&gt;polje[i].rad_mj, x.rad_mj) == 0) { </span><span id="L-45"><a name="L-45"></a> return i; } } </span><span id="L-46"><a name="L-46"></a> </span><span id="L-47"><a name="L-47"></a> return EndL(L); } </span><span id="L-48"><a name="L-48"></a> </span><span id="L-49"><a name="L-49"></a>bool InsertL(ZaposlenaOsoba x, element p, lista L) { </span><span id="L-50"><a name="L-50"></a> if(p&lt;0 || p&gt;=10000) { </span><span id="L-51"><a name="L-51"></a> return 0; } </span><span id="L-52"><a name="L-52"></a> </span><span id="L-53"><a name="L-53"></a> for(int i=EndL(L); i&gt;p; i--) { </span><span id="L-54"><a name="L-54"></a> L-&gt;polje[i] = L-&gt;polje[i-1]; } </span><span id="L-55"><a name="L-55"></a> L-&gt;cursor = L-&gt;cursor+1; </span><span id="L-56"><a name="L-56"></a> </span><span id="L-57"><a name="L-57"></a> L-&gt;polje[p] = x; </span><span id="L-58"><a name="L-58"></a> </span><span id="L-59"><a name="L-59"></a> return 1; } </span><span id="L-60"><a name="L-60"></a> </span><span id="L-61"><a name="L-61"></a>bool DeleteL(element p, lista L) { </span><span id="L-62"><a name="L-62"></a> if(p&lt;0 || p&gt;=10000) { </span><span id="L-63"><a name="L-63"></a> return 0; } </span><span id="L-64"><a name="L-64"></a> </span><span id="L-65"><a name="L-65"></a> L-&gt;cursor = L-&gt;cursor-1; </span><span id="L-66"><a name="L-66"></a> for(int i=p; i&lt;L-&gt;cursor; i++) { </span><span id="L-67"><a name="L-67"></a> L-&gt;polje[i] = L-&gt;polje[i+1]; } </span><span id="L-68"><a name="L-68"></a> </span><span id="L-69"><a name="L-69"></a> return 1; } </span><span id="L-70"><a name="L-70"></a> </span><span id="L-71"><a name="L-71"></a>ZaposlenaOsoba RetreiveL(element p, lista L) { </span><span id="L-72"><a name="L-72"></a> return L-&gt;polje[p]; } </span><span id="L-73"><a name="L-73"></a> </span><span id="L-74"><a name="L-74"></a>void DeleteAllL(lista L) { </span><span id="L-75"><a name="L-75"></a> L-&gt;cursor = 0; } </span><span id="L-76"><a name="L-76"></a> </span><span id="L-77"><a name="L-77"></a>lista InitL(lista L) { </span><span id="L-78"><a name="L-78"></a> L = new lis; </span><span id="L-79"><a name="L-79"></a> L-&gt;cursor = 0; </span><span id="L-80"><a name="L-80"></a> return L; } </span></pre></div> </td></tr></table>
header, liste, polje.h