boostorg/intrusive
1
0
Fork 1
mirror of https://github.com/boostorg/intrusive.git synced 2025-10-11 23:55:20 +02:00
Code Issues Packages Projects Releases Wiki Activity

Trailing whitespaces

Browse Source 
[SVN r78516]
This commit is contained in:
Ion Gaztañaga
2012-05-20 09:54:48 +00:00
parent b8d71929b8
commit 19b14d339a
55 changed files with 385 additions and 385 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
example/doc_advanced_value_traits.cpp
View File

@@ -14,7 +14,7 @@
#include <boost/intrusive/list.hpp>
#include <vector>
//This is the node that will be used with algorithms.
//This is the node that will be used with algorithms.
struct simple_node
{
simple_node *prev_;
@@ -26,7 +26,7 @@ struct simple_node
class base_1{};
class base_2{};
struct value_1 : public base_1, public simple_node
struct value_1 : public base_1, public simple_node
{ int id_; };
struct value_2 : public base_1, public base_2, public simple_node
@@ -38,10 +38,10 @@ struct simple_node_traits
typedef simple_node node;
typedef node * node_ptr;
typedef const node * const_node_ptr;
static node *get_next(const node *n) { return n->next_; }
static void set_next(node *n, node *next) { n->next_ = next; }
static node *get_previous(const node *n) { return n->prev_; }
static void set_previous(node *n, node *prev) { n->prev_ = prev; }
static node *get_next(const node *n) { return n->next_; }
static void set_next(node *n, node *next) { n->next_ = next; }
static node *get_previous(const node *n) { return n->prev_; }
static void set_previous(node *n, node *prev) { n->prev_ = prev; }
};
//A templatized value traits for value_1 and value_2