CompressedBitParallelTreeIndex.h

Go to the documentation of this file.

 
/*
 * This file is part of Algorithms library toolkit.
 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
 
 * Algorithms library toolkit is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 
 * Algorithms library toolkit is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 
 * You should have received a copy of the GNU General Public License
 * along with Algorithms library toolkit.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#pragma once
 
#include <alib/set>
#include <alib/map>
#include <alib/string>
 
#include <common/DefaultSymbolType.h>
#include <common/ranked_symbol.hpp>
 
#include <core/components.hpp>
#include <exception/CommonException.h>
 
#include <common/SparseBoolVector.hpp>
 
#include <alphabet/common/SymbolNormalize.h>
 
namespace indexes {
 
namespace arbology {
 
class GeneralAlphabet;
 
template < class SymbolType = DefaultSymbolType >
class CompressedBitParallelTreeIndex final : public core::Components < CompressedBitParallelTreeIndex < SymbolType >, ext::set < common::ranked_symbol < SymbolType > >, component::Set, GeneralAlphabet > {
    ext::map < common::ranked_symbol < SymbolType >, common::SparseBoolVector > m_vectors;
 
    ext::vector < int > m_jumpTable;
 
public:
    explicit CompressedBitParallelTreeIndex ( ext::set < common::ranked_symbol < SymbolType > > alphabet, ext::map < common::ranked_symbol < SymbolType >, common::SparseBoolVector > vectors, ext::vector < int > jumpTable );
 
    const ext::map < common::ranked_symbol < SymbolType >, common::SparseBoolVector > & getData ( ) const &;
 
    ext::map < common::ranked_symbol < SymbolType >, common::SparseBoolVector > && getData ( ) &&;
 
    const ext::vector < int > & getJumps ( ) const &;
 
    ext::vector < int > && getJumps ( ) &&;
 
    ext::vector < common::ranked_symbol < SymbolType > > getString ( ) const;
 
    const ext::set < common::ranked_symbol < SymbolType > > & getAlphabet ( ) const & {
        return this->template accessComponent < GeneralAlphabet > ( ).get ( );
    }
 
    ext::set < common::ranked_symbol < SymbolType > > && getAlphabet ( ) && {
        return std::move ( this->template accessComponent < GeneralAlphabet > ( ).get ( ) );
    }
 
    void setCompressedBitVectorForSymbol ( common::ranked_symbol < SymbolType > symbol, common::SparseBoolVector data );
 
    bool removeSymbolFromAlphabet ( const common::ranked_symbol < SymbolType > & symbol ) {
        return this->template accessComponent < GeneralAlphabet > ( ).remove ( symbol );
    }
 
    auto operator <=> ( const CompressedBitParallelTreeIndex & other ) const {
        return std::tie ( getData ( ), getAlphabet ( ), getJumps ( ) ) <=> std::tie ( other.getData ( ), other.getAlphabet ( ), other.getJumps ( ) );
    }
 
    bool operator == ( const CompressedBitParallelTreeIndex & other ) const {
        return std::tie ( getData ( ), getAlphabet ( ), getJumps ( ) ) == std::tie ( other.getData ( ), other.getAlphabet ( ), other.getJumps ( ) );
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const CompressedBitParallelTreeIndex & instance ) {
        return out << "(CompressedBitParallelTreeIndex " << instance.m_vectors << ", " << instance.m_jumpTable << ")";
    }
};
 
} /* namespace arbology */
 
} /* namespace indexes */
 
namespace indexes {
 
namespace arbology {
 
template < class SymbolType >
CompressedBitParallelTreeIndex < SymbolType >::CompressedBitParallelTreeIndex ( ext::set < common::ranked_symbol < SymbolType > > alphabet, ext::map < common::ranked_symbol < SymbolType >, common::SparseBoolVector > vectors, ext::vector < int > jumpTable ) : core::Components < CompressedBitParallelTreeIndex, ext::set < common::ranked_symbol < SymbolType > >, component::Set, GeneralAlphabet > ( std::move ( alphabet ) ), m_vectors ( std::move ( vectors ) ), m_jumpTable ( std::move ( jumpTable ) ) {
}
 
template < class SymbolType >
const ext::map < common::ranked_symbol < SymbolType >, common::SparseBoolVector > & CompressedBitParallelTreeIndex < SymbolType >::getData ( ) const & {
    return m_vectors;
}
 
template < class SymbolType >
ext::map < common::ranked_symbol < SymbolType >, common::SparseBoolVector > && CompressedBitParallelTreeIndex < SymbolType >::getData ( ) && {
    return std::move ( m_vectors );
}
 
template < class SymbolType >
const ext::vector < int > & CompressedBitParallelTreeIndex < SymbolType >::getJumps ( ) const & {
    return m_jumpTable;
}
 
template < class SymbolType >
ext::vector < int > && CompressedBitParallelTreeIndex < SymbolType >::getJumps ( ) && {
    return std::move ( m_jumpTable );
}
 
template < class SymbolType >
ext::vector < common::ranked_symbol < SymbolType > > CompressedBitParallelTreeIndex < SymbolType >::getString ( ) const {
    ext::vector < SymbolType > res;
 
    unsigned index = 0;
 
    do {
        for ( const std::pair < const common::ranked_symbol < SymbolType >, common::SparseBoolVector > & compressedBitVector : m_vectors )
            if ( compressedBitVector.second.size ( ) > index && compressedBitVector.second [ index ] ) {
                res.push_back ( compressedBitVector.first );
                continue;
            }
 
    } while ( res.size ( ) == index ++ + 1 );
 
    return res;
}
 
template < class SymbolType >
void CompressedBitParallelTreeIndex < SymbolType >::setCompressedBitVectorForSymbol ( common::ranked_symbol < SymbolType > symbol, common::SparseBoolVector data ) {
    this->m_vectors [ symbol ] = std::move ( data );
}
 
} /* namespace arbology */
 
} /* namespace indexes */
 
namespace core {
 
template < class SymbolType >
class SetConstraint < indexes::arbology::CompressedBitParallelTreeIndex < SymbolType >, common::ranked_symbol < SymbolType >, indexes::arbology::GeneralAlphabet > {
public:
    static bool used ( const indexes::arbology::CompressedBitParallelTreeIndex < common::ranked_symbol < SymbolType > > & index, const common::ranked_symbol < SymbolType > & symbol ) {
        const ext::map < common::ranked_symbol < SymbolType >, common::SparseBoolVector > & content = index.getData ( );
 
        return content.find ( symbol ) != content.end ( );
    }
 
    static bool available ( const indexes::arbology::CompressedBitParallelTreeIndex < SymbolType > &, const common::ranked_symbol < SymbolType > & ) {
        return true;
    }
 
    static void valid ( const indexes::arbology::CompressedBitParallelTreeIndex < SymbolType > &, const common::ranked_symbol < SymbolType > & ) {
    }
 
};
 
template < class SymbolType >
struct normalize < indexes::arbology::CompressedBitParallelTreeIndex < SymbolType > > {
    static indexes::arbology::CompressedBitParallelTreeIndex < > eval ( indexes::arbology::CompressedBitParallelTreeIndex < SymbolType > && value ) {
        ext::set < common::ranked_symbol < DefaultSymbolType > > alphabet = alphabet::SymbolNormalize::normalizeRankedAlphabet ( std::move ( value ).getAlphabet ( ) );
 
        ext::map < common::ranked_symbol < DefaultSymbolType >, common::SparseBoolVector > vectors;
        for ( std::pair < common::ranked_symbol < SymbolType >, common::SparseBoolVector > && vector : ext::make_mover ( std::move ( value ).getData ( ) ) )
            vectors.insert ( std::make_pair ( alphabet::SymbolNormalize::normalizeRankedSymbol ( std::move ( vector.first ) ), std::move ( vector.second ) ) );
 
        return indexes::arbology::CompressedBitParallelTreeIndex < > ( std::move ( alphabet ), std::move ( vectors ), std::move ( value ).getJumps ( ) );
    }
};
 
} /* namespace core */