BitParallelismFactors.h

Go to the documentation of this file.

 
#pragma once
 
#include <indexes/stringology/BitParallelIndex.h>
#include <string/LinearString.h>
#include <global/GlobalData.h>
 
#include <ext/foreach>
 
namespace stringology {
 
namespace query {
 
class BitParallelismFactors {
public:
    template < class SymbolType >
    static ext::set < unsigned > query ( const indexes::stringology::BitParallelIndex < SymbolType > & bitParallelIndex, const string::LinearString < SymbolType > & string );
 
};
 
template < class SymbolType >
ext::set < unsigned > BitParallelismFactors::query ( const indexes::stringology::BitParallelIndex < SymbolType > & bitParallelIndex, const string::LinearString < SymbolType > & string ) {
    if ( string.getContent ( ).empty ( ) ) {
        if ( bitParallelIndex.getData ( ).begin ( ) == bitParallelIndex.getData ( ).end ( ) )
            return { };
 
        return { ext::sequence < unsigned > ( 0 ).begin ( ), ext::sequence < unsigned > ( bitParallelIndex.getData ( ).begin ( )->second.size ( ) ).end ( ) };
    }
 
    auto symbolIter = string.getContent ( ).begin ( );
    typename ext::map < SymbolType, ext::vector < bool > >::const_iterator symbolVectorIter = bitParallelIndex.getData ( ).find ( * symbolIter );
    if ( symbolVectorIter == bitParallelIndex.getData ( ).end ( ) )
        return { };
 
    ext::vector < bool > indexVector = symbolVectorIter->second;
 
    for ( ++ symbolIter; symbolIter != string.getContent ( ).end ( ); ++ symbolIter ) {
        symbolVectorIter = bitParallelIndex.getData ( ).find ( * symbolIter );
        if ( symbolVectorIter == bitParallelIndex.getData ( ).end ( ) )
            return { };
 
        indexVector = ( indexVector << 1 ) & symbolVectorIter->second;
    }
 
    ext::set < unsigned > res;
    for ( unsigned i = 0; i < indexVector.size ( ); i++ )
        if ( indexVector [ i ] )
            res.insert ( i - string.getContent ( ).size ( ) + 1 );
 
    return res;
}
 
} /* namespace query */
 
} /* namespace stringology */