about summary refs log tree commit diff stats
path: root/data/maps/daedalus/rooms/Pyramid 6.txtpb
diff options
context:
space:
mode:
Diffstat (limited to 'data/maps/daedalus/rooms/Pyramid 6.txtpb')
0 files changed, 0 insertions, 0 deletions
p;id=34133b1e330a7d3c2a3e6a6bcd36deb5f95e8f13'>^
a5a6c1b ^

7f4b6b4 ^
a5a6c1b ^



738d970 ^



7f4b6b4 ^

738d970 ^

4ffb587 ^






738d970 ^


4ffb587 ^

7f4b6b4 ^



738d970 ^
a5a6c1b ^
7f4b6b4 ^
738d970 ^





a3d5e37 ^
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


                          


                           

                                                          


                        

                                     
   



                                     



                                         

 

                                                                                   






                                            


                                            

 



                                                
                                                                        
                                 
 





                                                           
 
#include "network_set.h"

void NetworkSet::Clear() {
  network_by_item_.clear();
}

void NetworkSet::AddLink(int id1, int id2, bool two_way) {
  if (two_way && id2 > id1) {
    std::swap(id1, id2);
  }

  if (!network_by_item_.count(id1)) {
    network_by_item_[id1] = {};
  }
  if (!network_by_item_.count(id2)) {
    network_by_item_[id2] = {};
  }

  NetworkNode node = {id1, id2, two_way};

  network_by_item_[id1].insert(node);
  network_by_item_[id2].insert(node);
}

void NetworkSet::AddLinkToNetwork(int network_id, int id1, int id2, bool two_way) {
  if (two_way && id2 > id1) {
    std::swap(id1, id2);
  }

  if (!network_by_item_.count(network_id)) {
    network_by_item_[network_id] = {};
  }

  NetworkNode node = {id1, id2, two_way};

  network_by_item_[network_id].insert(node);
}

bool NetworkSet::IsItemInNetwork(int id) const {
  return network_by_item_.count(id);
}

const std::set<NetworkNode>& NetworkSet::GetNetworkGraph(int id) const {
  return network_by_item_.at(id);
}

bool NetworkNode::operator<(const NetworkNode& rhs) const {
  if (entry != rhs.entry) return entry < rhs.entry;
  if (exit != rhs.exit) return exit < rhs.exit;
  if (two_way != rhs.two_way) return two_way < rhs.two_way;
  return false;
}