#include <adobe/config.hpp>
#include <functional>
#include <iterator>
#include <utility>
#include <boost/operators.hpp>
#include <boost/static_assert.hpp>
#include <adobe/algorithm/copy.hpp>
#include <adobe/algorithm/lower_bound.hpp>
#include <adobe/algorithm/mismatch.hpp>
#include <adobe/algorithm/sort.hpp>
#include <adobe/name.hpp>
#include <adobe/any_regular.hpp>
#include <adobe/utility.hpp>
#include <iostream>
Go to the source code of this file.
Classes |
| struct | lex_token_t< E > |
Namespaces |
| namespace | adobe |
Typedefs |
typedef pair< name_t,
any_regular_t > | stream_lex_token_t |
typedef std::pair< uchar_ptr_t,
uchar_ptr_t > | token_range_t |
| typedef const unsigned char * | uchar_ptr_t |
Functions |
| template<typename I1 , typename I2 , typename BP > |
| bool | bounded_equal (I1 first1, I1 last1, I2 first2, I2 last2, BP pred) |
| template<typename I1 , typename I2 > |
| bool | bounded_equal (I1 first1, I1 last1, I2 first2, I2 last2) |
| template<typename R1 , typename R2 > |
| bool | bounded_equal (R1 &range1, R2 &range2) |
| template<typename E > |
| E | eof_token () |
| std::ostream & | operator<< (std::ostream &s, const token_range_t &x) |
| template<typename T > |
| token_range_t | static_token_range (T *begin) |
| bool | token_range_equal (const token_range_t &x, const token_range_t &y) |
| bool | token_range_less (const token_range_t &x, const token_range_t &y) |
Variables |
| aggregate_name_t | eof_k |
