x
Yes
No
Do you want to visit DriveHQ English website?
Inicio
Características
Precios
Prueba gratuita
Software cliente
Acerca de nosotros
Servidor de archivos
|
Solución de copias de seguridad
|
Servidor FTP
|
Servidor de correo electrónico
|
Alojamiento web
|
Software cliente
Servidor de archivos
Solución de copia de seguridad
Servidor FTP
Servidor de correo electrónico
Alojamiento web
Software cliente
finder.hpp - Hosted on DriveHQ Cloud IT Platform
Arriba
Subir
Descargar
Compartir
Publicar
Nueva carpeta
Nuevo archivo
Copiar
Cortar
Eliminar
Pegar
Clasificación
Actualizar
Ruta de la carpeta: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\xpressive\detail\core\finder.hpp
Girar
Efecto
Propiedad
Historial
/// Contains the definition of the basic_regex\<\> class template and its associated helper functions. // // Copyright 2007 Eric Niebler. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_XPRESSIVE_DETAIL_CORE_FINDER_HPP_EAN_10_04_2005 #define BOOST_XPRESSIVE_DETAIL_CORE_FINDER_HPP_EAN_10_04_2005 // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once # pragma warning(push) # pragma warning(disable : 4189) // local variable is initialized but not referenced #endif #include
#include
#include
#include
namespace boost { namespace xpressive { namespace detail { /////////////////////////////////////////////////////////////////////////////// // boyer_moore_finder // template
struct boyer_moore_finder : finder
{ typedef typename iterator_value
::type char_type; boyer_moore_finder(char_type const *begin, char_type const *end, Traits const &tr, bool icase) : bm_(begin, end, tr, icase) { } bool ok_for_partial_matches() const { return false; } bool operator ()(match_state
&state) const { Traits const &traits = traits_cast
(state); state.cur_ = this->bm_.find(state.cur_, state.end_, traits); return state.cur_ != state.end_; } private: boyer_moore_finder(boyer_moore_finder const &); boyer_moore_finder &operator =(boyer_moore_finder const &); boyer_moore
bm_; }; /////////////////////////////////////////////////////////////////////////////// // hash_peek_finder // template
struct hash_peek_finder : finder
{ typedef typename iterator_value
::type char_type; hash_peek_finder(hash_peek_bitset
const &bset) : bset_(bset) { } bool operator ()(match_state
&state) const { Traits const &traits = traits_cast
(state); state.cur_ = (this->bset_.icase() ? this->find_(state.cur_, state.end_, traits, mpl::true_()) : this->find_(state.cur_, state.end_, traits, mpl::false_())); return state.cur_ != state.end_; } private: hash_peek_finder(hash_peek_finder const &); hash_peek_finder &operator =(hash_peek_finder const &); template
BidiIter find_(BidiIter begin, BidiIter end, Traits const &traits, ICase) const { for(; begin != end && !this->bset_.test(*begin, traits, ICase()); ++begin) ; return begin; } hash_peek_bitset
bset_; }; /////////////////////////////////////////////////////////////////////////////// // line_start_finder // template
::type)> struct line_start_finder : finder
{ typedef typename iterator_value
::type char_type; typedef typename iterator_difference
::type diff_type; typedef typename Traits::char_class_type char_class_type; line_start_finder(Traits const &traits) : newline_(lookup_classname(traits, "newline")) { } bool operator ()(match_state
&state) const { if(state.bos() && state.flags_.match_bol_) { return true; } Traits const &traits = traits_cast
(state); BidiIter cur = state.cur_; BidiIter const end = state.end_; std::advance(cur, static_cast
(-!state.bos())); for(; cur != end; ++cur) { if(traits.isctype(*cur, this->newline_)) { state.cur_ = ++cur; return true; } } return false; } private: line_start_finder(line_start_finder const &); line_start_finder &operator =(line_start_finder const &); char_class_type newline_; }; /////////////////////////////////////////////////////////////////////////////// // line_start_finder // template
struct line_start_finder
: finder
{ typedef typename iterator_value
::type char_type; typedef typename iterator_difference
::type diff_type; typedef typename Traits::char_class_type char_class_type; line_start_finder(Traits const &traits) { char_class_type newline = lookup_classname(traits, "newline"); for(int j = 0; j < 256; ++j) { this->bits_[j] = traits.isctype(static_cast
(static_cast
(j)), newline); } } bool operator ()(match_state
&state) const { if(state.bos() && state.flags_.match_bol_) { return true; } BidiIter cur = state.cur_; BidiIter const end = state.end_; std::advance(cur, static_cast
(-!state.bos())); for(; cur != end; ++cur) { if(this->bits_[static_cast
(*cur)]) { state.cur_ = ++cur; return true; } } return false; } private: line_start_finder(line_start_finder const &); line_start_finder &operator =(line_start_finder const &); bool bits_[256]; }; }}} #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma warning(pop) #endif #endif
finder.hpp
Dirección de la página
Dirección del archivo
Anterior
4/16
Siguiente
Descargar
( 5 KB )
Comments
Total ratings:
0
Average rating:
No clasificado
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.