aboutsummaryrefslogtreecommitdiff
path: root/cpp08/ex01/span.cpp
blob: a9bcaf630da2c82e4d8ce1a78adc2a3da6ba0300 (plain)
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
67
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   span.cpp                                           :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: charles <charles.cabergs@gmail.com>        +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2020/04/15 06:57:44 by charles           #+#    #+#             */
/*   Updated: 2020/04/15 07:22:42 by charles          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "span.hpp"

Span::Span() : m_under(new int[0]), m_size(0), m_fillIndex(0)
{}

Span::Span(Span const& other)
    : m_under(new int[other.m_size]),
      m_size(other.m_size),
      m_fillIndex(other.m_fillIndex)
{
    for (unsigned int i = 0; i < m_fillIndex; i++)
        m_under[i] = other.m_under[i];
}

void Span::operator=(Span const& other)
{
    delete [] m_under;
    m_size = other.m_size;
    m_under = new int[m_size];
    m_fillIndex = other.m_fillIndex;
    for (unsigned int i = 0; i < m_fillIndex; i++)
        m_under[i] = other.m_under[i];
}

Span::~Span()
{
    delete [] m_under;
}

Span::Span(unsigned int n) : m_under(new int[n]), m_size(n), m_fillIndex(0)
{}

void Span::addNumber(int x)
{
    if (m_fillIndex == m_size)
        throw std::exception();
    m_under[m_fillIndex] = x;
    m_fillIndex++;
}

int Span::shortestSpan() const
{
    if (m_size <= 1)
        throw std::exception();
    std::sort(m_under, m_under + m_fillIndex);
    return m_under[1] - m_under[0];
}

int Span::longestSpan() const
{
    if (m_size <= 1)
        throw std::exception();
    std::sort(m_under, m_under + m_fillIndex);
    return m_under[m_fillIndex - 1] - m_under[0];
}