aboutsummaryrefslogtreecommitdiff
path: root/src/game/HateMatrix.h
blob: 68c5da3bebbfe170298e5fec8e03b5f974f08b17 (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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
/*
 * Copyright (C) 2008 Trinity <http://www.trinitycore.org/>
 *
 * Thanks to the original authors: MaNGOS <http://www.mangosproject.org/>
 *
 * 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 2 of the License, or
 * (at your option) any later version.
 *
 * 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.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
 */

#ifndef TRINITY_HATEMATRIX_H
#define TRINITY_HATEMATRIX_H

#include "Utilities/HashMap.h"
#include <cassert>

class Unit;

struct TRINITY_DLL_DECL HateMatrix
{
    typedef hash_map<Unit *, uint32> HateMatrixMapType;

    inline uint32 operator[](Unit *unit) const
    {
        HateMatrixMapType::const_iterator iter = i_hateValues.find(unit);
        return (iter == i_hateValues.end() ? 0 : iter->second);
    }

    inline uint32& operator[](Unit *unit)
    {
        HateMatrixMapType::iterator iter = i_hateValues.find(unit);
        if( iter == i_hateValues.end() )
        {
            std::pair<HateMatrixMapType::iterator, bool> p = i_hateValues.insert( HateMatrixMapType::value_type(unit, 0) );
            assert(p.second);
            iter = p.first;
        }

        return iter->second;
    }

    inline void ClearMatrix(void) { i_hateValues.clear(); }

    inline void RemoveValue(Unit *unit)
    {
        HateMatrixMapType::iterator iter = i_hateValues.find(unit);
        if( iter != i_hateValues.end() )
            i_hateValues.erase( iter );
    }

    inline void AddValue(Unit *unit, uint32 val)
    {
        (*this)[unit] += val;
    }

    private:
        HateMatrixMapType i_hateValues;
};

struct HateBinder
{
    static uint32 si_noHateValue;
    uint32 &i_hateValue;
    Unit *i_unit;
    HateBinder(uint32 &val, Unit *u) : i_hateValue(val), i_unit(u) {}
    HateBinder() : i_hateValue(si_noHateValue), i_unit(NULL) {}
    HateBinder(const HateBinder &obj) : i_hateValue(obj.i_hateValue), i_unit(obj.i_unit) {}

    HateBinder& operator=(const HateBinder &obj)
    {
        i_hateValue = obj.i_hateValue;
        i_unit = obj.i_unit;
        return *this;
    }
};
#endif