cpp-practice/ShapesList.h at master · Yasna1998/cpp-practice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#pragma once
#ifndef SHAPESLIST_H
#define SHAPESLIST_H
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include "Shape.h"
#include "Circle.h"
#include "Rectangle.h"
#include "Triangle.h"
#include "Square.h"

using namespace std;

class ShapesList
{
private:
    vector<Shape*> shape_list;

public:
    void add(Shape & shape)
    {
        shape_list.push_back(&shape);
    }

    void remove(double area)
    {
		int shape_index;
        for (auto iter = shape_list.begin(); iter != shape_list.end(); iter++) {
			if ((*iter)->area() == area)
			{
				shape_index = distance(shape_list.begin(), iter);
				shape_list.erase(iter);
				break;
			}
		}
    }


	void find(double area)
	{
		int shape_index;
		for (auto iter = shape_list.begin(); iter != shape_list.end(); iter++) {
			if ((*iter)->area() == area)
			{
				(*iter)->draw();
			}
		}
	}

	struct {
		bool operator()(Shape* first_shape, Shape* second_shape) const
		{
			return first_shape->area() > second_shape->area();
		}
	} sort_order;

	void Sort()
	{
		sort(shape_list.begin(), shape_list.end(), sort_order);
	}

};

#endif