NonlinearCompressedBitParallelIndexConstruction.h

Go to the documentation of this file.

 
#pragma once
 
#include <indexes/arbology/NonlinearCompressedBitParallelTreeIndex.h>
#include <tree/ranked/PrefixRankedBarTree.h>
#include <exception/CommonException.h>
#include <tree/properties/SubtreeJumpTable.h>
#include <tree/properties/ExactSubtreeRepeatsNaive.h>
 
namespace arbology {
 
namespace indexing {
 
class NonlinearCompressedBitParallelIndexConstruction {
public:
    template < class SymbolType >
    static indexes::arbology::NonlinearCompressedBitParallelTreeIndex < SymbolType > construct ( const tree::PrefixRankedBarTree < SymbolType > & w );
};
 
template < class SymbolType >
indexes::arbology::NonlinearCompressedBitParallelTreeIndex < SymbolType > NonlinearCompressedBitParallelIndexConstruction::construct ( const tree::PrefixRankedBarTree < SymbolType > & w ) {
    ext::map < common::ranked_symbol < SymbolType >, common::SparseBoolVector > res;
 
    for ( const common::ranked_symbol < SymbolType > & symbol : w.getAlphabet ( ) )
        res [ symbol ].resize ( w.getContent ( ).size ( ) );
 
    for ( unsigned i = 0; i < w.getContent ( ).size ( ); ++i )
        res [ w.getContent ( ) [ i ] ] [ i ] = true;
 
    ext::vector < common::ranked_symbol < unsigned > > content = tree::properties::ExactSubtreeRepeatsNaive::repeats ( w ).getContent ( );
 
    ext::vector < unsigned > repeats;
    for ( const common::ranked_symbol < unsigned > & symbol : content )
        repeats.push_back ( symbol.getSymbol ( ) );
 
    return indexes::arbology::NonlinearCompressedBitParallelTreeIndex < SymbolType > ( w.getAlphabet ( ), std::move ( res ), tree::properties::SubtreeJumpTable::compute ( w ), std::move ( repeats ) );
}
 
} /* namespace indexing */
 
} /* namespace arbology */