/** @file
 * @brief Class for merging AllTermsList objects from subdatabases.
 */
/* Copyright (C) 2007,2008,2009,2011,2017,2018,2020,2024 Olly Betts
 *
 * This program 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 2 of the License, or
 * (at your option) any later version.
 *
 * This program 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 this program; if not, see
 * <https://www.gnu.org/licenses/>.
 */

#include <config.h>

#include "multi_alltermslist.h"

#include <xapian/database.h>

#include "backends/databaseinternal.h"
#include "heap.h"
#include "omassert.h"

using namespace std;

/// Comparison functor which orders TermList* by ascending term name.
struct CompareTermListsByTerm {
    /// Order by ascending term name.
    bool operator()(const TermList *a, const TermList *b) const {
        return a->get_termname() > b->get_termname();
    }
};

MultiAllTermsList::MultiAllTermsList(size_t count_, TermList** termlists_)
    : count(count_), termlists(termlists_)
{
}

MultiAllTermsList::~MultiAllTermsList()
{
    while (count)
        delete termlists[--count];
    delete [] termlists;
}

Xapian::termcount
MultiAllTermsList::get_approx_size() const
{
    // This should never get called.
    Assert(false);
    return 0;
}

Xapian::doccount
MultiAllTermsList::get_termfreq() const
{
    if (current_termfreq == 0 && count != 0) {
        while (true) {
            TermList * tl = termlists[0];
            if (tl->get_termname() != current_term)
                break;
            current_termfreq += tl->get_termfreq();
            if (tl->next()) {
                // Out of entries.
                Heap::pop(termlists, termlists + count,
                          CompareTermListsByTerm());
                delete tl;
                if (--count == 0)
                    break;
            } else {
                Heap::replace(termlists, termlists + count,
                              CompareTermListsByTerm());
            }
        }
    }
    return current_termfreq;
}

TermList *
MultiAllTermsList::next()
{
    if (current_term.empty()) {
        // Make termlists into a heap so that the one (or one of the ones) with
        // earliest sorting term is at the top of the heap.
        size_t j = 0;
        for (size_t i = 0; i != count; ++i) {
            if (termlists[i]->next() == NULL) {
                if (i != j)
                    swap(termlists[i], termlists[j]);
                ++j;
            }
        }
        while (count > j)
            delete termlists[--count];
        Heap::make(termlists, termlists + count,
                   CompareTermListsByTerm());
    } else if (current_termfreq == 0 && count != 0) {
        // Skip over current_term if we haven't already.
        while (true) {
            TermList* tl = termlists[0];
            if (tl->get_termname() != current_term)
                break;
            if (tl->next()) {
                // Out of entries.
                Heap::pop(termlists, termlists + count,
                          CompareTermListsByTerm());
                delete tl;
                if (--count == 0)
                    break;
            } else {
                Heap::replace(termlists, termlists + count,
                              CompareTermListsByTerm());
            }
        }
    }

    current_termfreq = 0;

    if (count <= 1) {
        if (count == 0) {
            return this;
        }
        count = 0;
        // Prune.
        return termlists[0];
    }

    current_term = termlists[0]->get_termname();
    return NULL;
}

TermList*
MultiAllTermsList::skip_to(std::string_view term)
{
    // Assume the skip is likely to be a long distance, and rebuild the heap
    // from scratch.  FIXME: It would be useful to profile this against an
    // approach more like that next() uses if this ever gets heavy use.
    size_t j = 0;
    for (size_t i = 0; i != count; ++i) {
        if (termlists[i]->skip_to(term) == NULL) {
            if (i != j)
                swap(termlists[i], termlists[j]);
            ++j;
        }
    }
    while (count > j)
        delete termlists[--count];

    current_termfreq = 0;

    if (count <= 1) {
        if (count == 0) {
            return this;
        }
        count = 0;
        // Prune.
        return termlists[0];
    }

    Heap::make(termlists, termlists + count, CompareTermListsByTerm());

    current_term = termlists[0]->get_termname();
    return NULL;
}
