blob: f66c966d8149793216d5d10f6e21d00c59368845 [file] [log] [blame]
Alexander Afanasyev7a696fb2012-03-01 17:17:22 -08001/* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil -*- */
2/*
3 * Copyright (c) 2012 University of California, Los Angeles
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License version 2 as
7 * published by the Free Software Foundation;
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 *
18 * Author: Zhenkai Zhu <zhenkai@cs.ucla.edu>
19 * 卞超轶 Chaoyi Bian <bcy@pku.edu.cn>
20 * Alexander Afanasyev <alexander.afanasyev@ucla.edu>
21 */
22
23#ifndef SYNC_STATE_LEAF_CONTAINER
24#define SYNC_STATE_LEAF_CONTAINER
25
26#include <boost/multi_index_container.hpp>
27// #include <boost/multi_index/tag.hpp>
28// #include <boost/multi_index/ordered_index.hpp>
29// #include <boost/multi_index/composite_key.hpp>
30#include <boost/multi_index/hashed_index.hpp>
31// #include <boost/multi_index/random_access_index.hpp>
32// #include <boost/multi_index/member.hpp>
33#include <boost/multi_index/mem_fun.hpp>
34
35namespace mi = boost::multi_index;
36
37namespace ns3 {
38namespace Sync {
39
40/**
41 * \ingroup sync
42 * @brief Container for SYNC leaves
43 */
44struct LeafContainer : public mi::multi_index_container<
45 LeafPtr,
46 mi::indexed_by<
47 // For fast access to elements using NameInfo
48 mi::hashed_unique<
49 mi::const_mem_fun<Leaf, const NameInfo&, &Leaf::getInfo>,
50 LeafHash (),
51 LeafEqual ()
52 >
53 >
54 >
55{
56};
57
58} // Sync
59} // ns3
60
61#endif // SYNC_STATE_LEAF_CONTAINER