jotoho / cpp2-praktikum Goto Github PK

Tasks
The following things are required of us:

• Create folder 3/
• Create class Liste
• Implement the following prototypes as methods of the class:
  • Liste()
  • ~Liste()
  • void add(int wert)
  • void clear()
  • bool contains(int wert)

This week's task revolves around taking the previous work under /1/ and expanding on it with more features.

Tasks

The following things are required of us:

• Copy contents of 1/ into folder 2/ (Done. See c33d225)
• Rework the Stack class to use dynamically allocated memory, instead of a statically sized array on the stack.
• Implement the following prototypes as methods of the class:
  • Stack();
  • Stack(const Stack&);
  • ~Stack();
  • const Stack& operator=(const Stack&);
• Modify the Stack::push(int) method such that pushes to a full Stack allocates a larger block of memory, copies over the existing contents, frees the old block and adds the parameter to the new block of memory.

Open questions

• The tasks explicitly mention that the type of the storage block should be changed from int[] to int*. Should we take this to mean, that we cannot use a reliable storage structure, like a std::vector internally and avoid all memory management headaches?
  Yes, the type needs to be int*
• The description of changes required to Stack::push(int) explicitly mentions copying the memory over. Does this mean we need to do so manually ourselves or can we use C stdlib functionality like realloc()?
  We can use realloc

While working on #18, we forgot to add our usual two-line comment to the beginnings of each of the source files.

We need to add them before submitting our work for university review.

In order to get admitted into the final exam of this course, we need to complete the following tasks.

• Expand Liste class with the following methods. When ever a method fails, it should throw exceptions.
  • void add_last(int wert)
  • void add_first(int wert)
  • int remove_last()
  • int remove_first()
  • int get(std::size_t index)
• Create tests for all (wtf?) failure scenarios
• Overload operator[] for the Liste class
• Implement a Stack using class Liste in the form of delegation

I forgot to add the two lines of comment that should be at the beginning of cpp and hpp files when writing #10

• Bei der Addition (Klasse Fraction) muss der Bruch vorher erweitert werden, um auf den gleichen Nenner zu kommen. Ihre Implementierung berechnet zur Zeit 1/3 + 1/3 = 1/3, was eigentlich 2/3 ergeben müsste.
• Es kann keine Null (0/1) abgebildet werden. 1/3 - 1/3 erzeugt eine "Floating point exception (core dumped)" genau wie der Versuch, 0/1 als Fraction zu instanzieren.

It would only be fair, since this way it is more obvious to university reviewers that we're working on and submitting the same codebase. Not to mention that it might be more comfortable to review in browser or with git support.

Currently the CI job for locking threads and the github actions base used in the format checker refer to very broad version ranges. To avoid unplanned behaviour changes, I will be pinning those to specific version numbers.

If updates are pushed to those automations, I want to read the changelogs first and bump the dependency version number manually or with the help of dependabot.