imported lab skeletons

lab3/User.cc

@@ -0,0 +1,6 @@
+#include "User.h"
+
+std::ostream& operator<<(std::ostream& os, const User& u)
+{
+    return os  << "(" << u.getCardNbr() << ") "<< u.getName();
+}

lab3/User.h

@@ -0,0 +1,27 @@
+#ifndef __USER_H
+#define __USER_H
+
+#include <iostream>
+#include <string>
+
+using std::cout;
+using std::endl;
+
+class User {
+public:
+    User() :cardNbr{0},name{"default"}{}
+    User(int c, std::string n) :cardNbr{c},name{n} {}
+    ~User() {cardNbr=-2; name="--------------------";} // overwrite values for security reasons
+    User(const User& u) =default;
+    User& operator=(const User&) =default;
+    int getCardNbr() const {return cardNbr;}
+    std::string getName() const {return name;}
+    bool operator==(const User& u) const {return cardNbr == u.cardNbr && name == u.name;}
+    bool operator!=(const User& u) const {return ! (u == *this);}
+private:
+    int cardNbr;
+    std::string name;
+};
+
+std::ostream& operator<<(std::ostream& os, const User& u);
+#endif

lab3/UserTable.cc

@@ -0,0 +1,122 @@
+#include "UserTable.h"
+#include <fstream>
+#include <algorithm>
+
+const User UserTable::user_not_found = User{-1,"Not Found"};
+
+UserTable::UserTable() :users{new User[capacity]} { }
+
+UserTable::UserTable(const std::string& fname) :UserTable{}
+{
+    std::ifstream ufile(fname);
+
+    if(ufile.is_open()) {
+        while(ufile) {
+            int cn;
+            if(ufile >> cn ) {
+                ufile.ignore(); // skip space
+                char n[80];
+                ufile.getline(n,80);
+                addUser(User(cn,n));
+
+            }
+        }
+    } else {
+        std::cout << "Could not open " << fname << std::endl;
+    }
+}
+
+void UserTable::addUser(const User& u)
+{
+    // gör tabellen större vid behov
+    ensureCapacity(n+1);
+    // 1. Hitta rätt plats
+    int pos{0};
+    while ( (pos < n) && (users[pos].getCardNbr() < u.getCardNbr())){
+        ++pos;
+    }
+
+    //2. skapa lucka i vektorn
+    for(int i=n; i > pos; --i){
+        users[i] = users[i-1];
+    }
+
+    //3. stoppa in den nya användaren i luckan
+    users[pos] = u;
+}
+
+User UserTable::find(int c) const
+{
+    // binärsökning (baserad på Holm, 2007)
+
+    int low = 0;
+    int high = n - 1;
+    int mid = -1;
+    bool found = false;
+    while (low < high && ! found) {
+        mid = (low + high) / 2;
+        //
+        int midnbr = users[mid].getCardNbr();
+        if (midnbr = c) {
+            found = true;
+        } else if (users[mid].getCardNbr() < c) {
+            low = mid + 1;
+        } else {
+            high = mid - 1;
+        }
+    }
+
+    return found ? users[mid] : user_not_found;
+}
+User UserTable::find(std::string name) const
+{
+    for (int i = 0; i != n; ++i) {
+        if (users[i].getName() == name) {
+            return users[i];
+        } else {
+            return user_not_found;
+        }
+    }
+    return user_not_found;
+}
+
+void UserTable::ensureCapacity(int s)
+{
+    if(s>capacity) {
+        while(s > capacity) {
+            capacity*=4;
+        }
+        auto tmp = new User[capacity];
+        std::copy(users, users+n, tmp);
+        delete[] users;
+        users=tmp;
+    }
+
+}
+void UserTable::print(std::ostream& os) const
+{
+    os << "-------------" << std::endl;
+    for(int i = 0; i != getNbrUsers(); ++i) {
+        const auto& u = users[i];
+        os << "(" <<u.getCardNbr() << ") " << u.getName() << std::endl;
+    }
+    os << "=============" << std::endl;
+}
+/**
+    * Testmetod för binärsökningen:
+    * går igenom alla användare och kollar att deras kortnummer kan sökas upp.
+    * Om något kortnummer inte kunde sökas upp returneras detta. Annars, om
+    * alla sökningar lyckades, returneras 0.
+    */
+int testFindNbr(const UserTable ut)
+{
+    for (int i = 0; i < ut.n; i++) {
+        int nbr = ut.users[i].getCardNbr();
+        User found = ut.find(nbr);
+        if (found != ut.users[i]) {
+            return nbr;
+        }
+    }
+    return 0;
+}
+

lab3/UserTable.h

@@ -0,0 +1,33 @@
+#ifndef __USERTABLE_H
+#define __USERTABLE_H
+
+#include <iostream>
+
+#include "User.h"
+
+class UserTable{
+public:
+    UserTable();
+    UserTable(const std::string&);
+    ~UserTable() {delete[] users;}
+
+    void addUser(const User&);
+    User find(int) const;
+    User find(std::string) const;
+
+    int getNbrUsers() const {
+        return n;
+    }
+
+    void print(std::ostream&) const;
+
+    static const User user_not_found;
+private:
+    int capacity{1000};
+    void ensureCapacity(int);
+    int n{0};
+    User* users;
+
+    friend int testFindNbr(const UserTable ut);
+};
+#endif