/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */

/*

 * This file is part of the LibreOffice project.

 *

 * This Source Code Form is subject to the terms of the Mozilla Public

 * License, v. 2.0. If a copy of the MPL was not distributed with this

 * file, You can obtain one at http://mozilla.org/MPL/2.0/.

 */

#pragma once

#include <mdds/flat_segment_tree.hpp>

#include <vector>

namespace sc {

template<typename Key, typename Span>

void buildSpan(

    std::vector<Span>& rSpans,

    typename mdds::flat_segment_tree<Key,bool>::const_iterator it,

    typename mdds::flat_segment_tree<Key,bool>::const_iterator itEnd, const Key* pStart )

{

    Key nLastPos = it->first;

    bool bLastVal = it->second;

    for (++it; it != itEnd; ++it)

    {

        Key nThisPos = it->first;

        bool bThisVal = it->second;

        if (bLastVal)

        {

            Key nIndex1 = nLastPos;

            Key nIndex2 = nThisPos-1;

            if (!pStart || *pStart < nIndex1)

                rSpans.push_back(Span(nIndex1, nIndex2));

            else if (*pStart <= nIndex2)

                rSpans.push_back(Span(*pStart, nIndex2));

        }

        nLastPos = nThisPos;

        bLastVal = bThisVal;

    }

}

void sc::buildSpan<int, sc::RowSpan>(std::__1::vector<sc::RowSpan, std::__1::allocator<sc::RowSpan> >&, mdds::flat_segment_tree<int, bool>::const_iterator, mdds::flat_segment_tree<int, bool>::const_iterator, int const*)

Line

Count

Source

22

3.63M

{

23

3.63M

    Key nLastPos = it->first;

24

3.63M

    bool bLastVal = it->second;

25

7.79M

    for (++it; it != itEnd; ++it)

26

4.15M

    {

27

4.15M

        Key nThisPos = it->first;

28

4.15M

        bool bThisVal = it->second;

29

30

4.15M

        if (bLastVal)

31

313k

        {

32

313k

            Key nIndex1 = nLastPos;

33

313k

            Key nIndex2 = nThisPos-1;

34

35

313k

            if (!pStart || *pStart < nIndex1)

36

313k

                rSpans.push_back(Span(nIndex1, nIndex2));

37

0

            else if (*pStart <= nIndex2)

38

0

                rSpans.push_back(Span(*pStart, nIndex2));

39

313k

        }

40

41

4.15M

        nLastPos = nThisPos;

42

4.15M

        bLastVal = bThisVal;

43

4.15M

    }

44

3.63M

}

Unexecuted instantiation: void sc::buildSpan<int, sc::ColRowSpan>(std::__1::vector<sc::ColRowSpan, std::__1::allocator<sc::ColRowSpan> >&, mdds::flat_segment_tree<int, bool>::const_iterator, mdds::flat_segment_tree<int, bool>::const_iterator, int const*)

template<typename Key, typename Val, typename Span>

void buildSpanWithValue(

    std::vector<Span>& rSpans,

    typename mdds::flat_segment_tree<Key,Val>::const_iterator it,

    typename mdds::flat_segment_tree<Key,Val>::const_iterator itEnd )

{

    Key nLastPos = it->first;

    Val nLastVal = it->second;

    for (++it; it != itEnd; ++it)

    {

        Key nThisPos = it->first;

        Val nThisVal = it->second;

        if (nLastVal)

        {

            Key nIndex1 = nLastPos;

            Key nIndex2 = nThisPos-1;

            rSpans.push_back(Span(nIndex1, nIndex2, nLastVal));

        }

        nLastPos = nThisPos;

        nLastVal = std::move(nThisVal);

    }

}

/**

 * Convert a flat_segment_tree structure whose value type is boolean, into

 * an array of ranges that corresponds with the segments that have a 'true'

 * value.

 */

template<typename Key, typename Span>

std::vector<Span> toSpanArray( const mdds::flat_segment_tree<Key,bool>& rTree )

{

    std::vector<Span> aSpans;

    buildSpan<Key,Span>(aSpans, rTree.begin(), rTree.end(), nullptr);

    return aSpans;

}

std::__1::vector<sc::RowSpan, std::__1::allocator<sc::RowSpan> > sc::toSpanArray<int, sc::RowSpan>(mdds::flat_segment_tree<int, bool> const&)

Line

Count

Source

78

3.63M

{

79

3.63M

    std::vector<Span> aSpans;

80

3.63M

    buildSpan<Key,Span>(aSpans, rTree.begin(), rTree.end(), nullptr);

81

3.63M

    return aSpans;

82

3.63M

}

Unexecuted instantiation: std::__1::vector<sc::ColRowSpan, std::__1::allocator<sc::ColRowSpan> > sc::toSpanArray<int, sc::ColRowSpan>(mdds::flat_segment_tree<int, bool> const&)

/**

 * Convert a flat_segment_tree structure into an array of ranges with

 * values.  Only those ranges whose value is evaluated to be true will be

 * included.  The value type must be something that supports bool operator.

 * The span type must support a constructor that takes a start key, an end

 * key and a value in this order.

 */

template<typename Key, typename Val, typename Span>

std::vector<Span> toSpanArrayWithValue( const mdds::flat_segment_tree<Key,Val>& rTree )

{

    std::vector<Span> aSpans;

    buildSpanWithValue<Key,Val,Span>(aSpans, rTree.begin(), rTree.end());

    return aSpans;

}

template<typename Key, typename Span>

std::vector<Span> toSpanArray( const mdds::flat_segment_tree<Key,bool>& rTree, Key nStartPos )

{

    typedef mdds::flat_segment_tree<Key,bool> FstType;

    std::vector<Span> aSpans;

    if (!rTree.valid_tree())

        return aSpans;

    bool bThisVal = false;

    std::pair<typename FstType::const_iterator, bool> r =

        rTree.search_tree(nStartPos, bThisVal);

    if (!r.second)

        // Tree search failed.

        return aSpans;

    buildSpan<Key,Span>(aSpans, r.first, rTree.end(), &nStartPos);

    return aSpans;

}

}

/* vim:set shiftwidth=4 softtabstop=4 expandtab: */