Posted By

PetraKuhar on 11/10/12

Tagged

Versions (?)

Last Edited at 11/10/12 07:50am

Statistics

Viewed 557 times

Favorited by 0 user(s)

Related snippets

Polje.h za zadatak 1

/ Published in: C++

Lista_polje za zadatak 1

Expand | Embed | Plain Text

Copy this code and paste it in your HTML

struct zivotinja {
    int sifra, cijena;
    string vrsta, naziv;
    long datum;
};
 
struct List {
    zivotinja zivotinje[100];
    int kursor;
};
 
// typedef <a> <b> znaci: "od sad, b je drugi naziv za a"
typedef List Lista;
typedef int element;
 
void InitL(Lista *l) {
    l->kursor = 0;
}
 
element FirstL(Lista *l) {
    return 0;
}
 
element EndL(Lista *l) {
    return l->kursor;
}
 
int InsertL(zivotinja nova, element e, Lista *l) {
    if (l->kursor == 100)
        return 0;
 
    for (int i = l->kursor; i > e; --i) {
        l->zivotinje[i] = l->zivotinje[i-1];
    }
    l->zivotinje[e] = nova;
    l->kursor = l->kursor + 1;
    return 1;
}
 
void DeleteL(element e, Lista *l) {
    if (l->kursor == 0) {
        return;
    }
 
    for (int i = e; i < l->kursor; ++i) {
        l->zivotinje[i] = l->zivotinje[i+1];
    }
    l->kursor = l->kursor - 1;
 
}
 
void DeleteAll (Lista *l) {
    l->kursor = 0;
}
 
element LocateL(zivotinja x, Lista *l) {
    for (int i = 0; i < l->kursor; ++i) {
        if (l->zivotinje[i].sifra == x.sifra) {
            return i;
        }
    }
    return l->kursor;
}
 
element NextL(element e, Lista *l) {
    return e+1;
}
 
element PreviousL(element e, Lista *l) {
    return e-1;
}
 
zivotinja RetrieveL(element e, Lista *l) {
    return l->zivotinje[e];
}

URL: polje_petrak

Report this snippet Tweet

Comments

Subscribe to comments

Comment:

You need to login to post a comment.