pns_layerset.h 2.53 KB
Newer Older
1 2 3
/*
 * KiRouter - a push-and-(sometimes-)shove PCB router
 *
4
 * Copyright (C) 2013-2014 CERN
5
 * Author: Tomasz Wlostowski <tomasz.wlostowski@cern.ch>
6
 *
7 8 9 10
 * This program is free software: you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by the
 * Free Software Foundation, either version 3 of the License, or (at your
 * option) any later version.
11
 *
12 13 14 15
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
16
 *
17
 * You should have received a copy of the GNU General Public License along
18
 * with this program.  If not, see <http://www.gnu.org/licenses/>.
19 20 21 22 23 24 25 26 27 28
 */

#ifndef __PNS_LAYERSET_H
#define __PNS_LAYERSET_H

#include <algorithm>

/**
 * Class PNS_LAYERSET
 *
29
 * Represents a contiguous set of PCB layers.
30 31 32
 */
class PNS_LAYERSET
{
33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
public:
    PNS_LAYERSET() :
        m_start( -1 ),
        m_end( -1 )
    {};

    PNS_LAYERSET( int aStart, int aEnd )
    {
        if( aStart > aEnd )
            std::swap( aStart, aEnd );

        m_start = aStart;
        m_end = aEnd;
    }

    PNS_LAYERSET( int aLayer )
    {
        m_start = m_end = aLayer;
    }

53 54 55
    PNS_LAYERSET( const PNS_LAYERSET& aB ) :
        m_start( aB.m_start ),
        m_end( aB.m_end )
56 57 58 59
    {}

    ~PNS_LAYERSET() {};

60
    const PNS_LAYERSET& operator=( const PNS_LAYERSET& aB )
61
    {
62 63
        m_start = aB.m_start;
        m_end = aB.m_end;
64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110
        return *this;
    }

    bool Overlaps( const PNS_LAYERSET& aOther ) const
    {
        return m_end >= aOther.m_start && m_start <= aOther.m_end;
    }

    bool Overlaps( const int aLayer ) const
    {
        return aLayer >= m_start && aLayer <= m_end;
    }

    bool IsMultilayer() const
    {
        return m_start != m_end;
    }

    int Start() const
    {
        return m_start;
    }

    int End() const
    {
        return m_end;
    }

    void Merge( const PNS_LAYERSET& aOther )
    {
        if( m_start < 0 || m_end < 0 )
        {
            m_start = aOther.m_start;
            m_end = aOther.m_end;
            return;
        }

        if( aOther.m_start < m_start )
            m_start = aOther.m_start;

        if( aOther.m_end > m_end )
            m_end = aOther.m_end;
    }

    ///> Shortcut for comparisons/overlap tests
    static PNS_LAYERSET All()
    {
111
        return PNS_LAYERSET( 0, 64 );
112 113 114 115 116
    }

private:
    int m_start;
    int m_end;
117 118
};

119
#endif    // __PNS_LAYERSET_H