author | William Roberts <williamr@symbian.org> |
Wed, 31 Mar 2010 12:33:34 +0100 | |
branch | Symbian3 |
changeset 4 | 837f303aceeb |
permissions | -rw-r--r-- |
williamr@4 | 1 |
/* |
williamr@4 | 2 |
* |
williamr@4 | 3 |
* Copyright (c) 1999 |
williamr@4 | 4 |
* Boris Fomitchev |
williamr@4 | 5 |
* |
williamr@4 | 6 |
* This material is provided "as is", with absolutely no warranty expressed |
williamr@4 | 7 |
* or implied. Any use is at your own risk. |
williamr@4 | 8 |
* |
williamr@4 | 9 |
* Permission to use or copy this software for any purpose is hereby granted |
williamr@4 | 10 |
* without fee, provided the above notices are retained on all copies. |
williamr@4 | 11 |
* Permission to modify the code and to distribute modified code is granted, |
williamr@4 | 12 |
* provided the above notices are retained, and a notice that the code was |
williamr@4 | 13 |
* modified is included with the above copyright notice. |
williamr@4 | 14 |
* |
williamr@4 | 15 |
*/ |
williamr@4 | 16 |
|
williamr@4 | 17 |
/* NOTE: This is an internal header file, included by other STL headers. |
williamr@4 | 18 |
* You should not attempt to use it directly. |
williamr@4 | 19 |
*/ |
williamr@4 | 20 |
|
williamr@4 | 21 |
#ifndef _STLP_INTERNAL_ABBREVS_H |
williamr@4 | 22 |
# define _STLP_INTERNAL_ABBREVS_H |
williamr@4 | 23 |
|
williamr@4 | 24 |
// ugliness is intentional - to reduce conflicts |
williamr@4 | 25 |
# define input_iterator_tag _In__ItT |
williamr@4 | 26 |
# define output_iterator_tag _Ou__ItT |
williamr@4 | 27 |
# define bidirectional_iterator_tag _Bd__ItT |
williamr@4 | 28 |
# define random_access_iterator_tag _Ra__ItT |
williamr@4 | 29 |
# define input_iterator _In__It |
williamr@4 | 30 |
# define output_iterator _Ou__It |
williamr@4 | 31 |
# define bidirectional_iterator _Bd__It |
williamr@4 | 32 |
# define random_access_iterator _Ra__It |
williamr@4 | 33 |
# define reverse_bidirectional_iterator _rBd__It |
williamr@4 | 34 |
# define reverse_iterator _r__It |
williamr@4 | 35 |
# define back_insert_iterator _bI__It |
williamr@4 | 36 |
# define front_insert_iterator _fI__It |
williamr@4 | 37 |
# define raw_storage_iterator _rS__It |
williamr@4 | 38 |
# define _Const_traits _C_Tr |
williamr@4 | 39 |
# define _Nonconst_traits _N_Tr |
williamr@4 | 40 |
|
williamr@4 | 41 |
// ugliness is intentional - to reduce conflicts probability |
williamr@4 | 42 |
# define __malloc_alloc M__A |
williamr@4 | 43 |
# define __node_alloc D__A |
williamr@4 | 44 |
# define __new_alloc N__A |
williamr@4 | 45 |
# define __debug_alloc G__A |
williamr@4 | 46 |
|
williamr@4 | 47 |
# define __deque_iterator _dQ__It |
williamr@4 | 48 |
# define _Buf_traits _dQ__BTr |
williamr@4 | 49 |
# define _Deque_iterator _Dq__It |
williamr@4 | 50 |
|
williamr@4 | 51 |
# define _Select1st _S1st |
williamr@4 | 52 |
# define _Select2nd _S2nd |
williamr@4 | 53 |
|
williamr@4 | 54 |
# define _Hashtable_iterator _hT__It |
williamr@4 | 55 |
# define _Hashtable_const_iterator _hT__cIt |
williamr@4 | 56 |
# define _Hashtable_node _hT__N |
williamr@4 | 57 |
# define _Hashtable_base _hT__B |
williamr@4 | 58 |
# define _Ht_iterator _Ht_It |
williamr@4 | 59 |
|
williamr@4 | 60 |
# define __list_iterator _L__It |
williamr@4 | 61 |
# define __slist_iterator _SL__It |
williamr@4 | 62 |
|
williamr@4 | 63 |
# define _Rb_tree_node_base _rbT__NB |
williamr@4 | 64 |
# define _Rb_tree_node _rbT__N |
williamr@4 | 65 |
# define _Rb_base_iterator _rbTB__It |
williamr@4 | 66 |
# define _Rb_tree_base_iterator _rbT__It |
williamr@4 | 67 |
# define _Rb_tree_base _rbT__B |
williamr@4 | 68 |
|
williamr@4 | 69 |
#endif |
williamr@4 | 70 |