// The MIT License (MIT)
// Copyright (c) 2017 Thomas Huetter.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.

/// \file join/tjoin/inverted_list_element.h
///
/// \details
/// Structure of a element in the inverted list.

#pragma once

namespace candidate_index {

/// This is an element of the join's result set.
struct InvertedListElement {
  /// Tree id of the left-hand tree in the result element.
  int offset = 0;
  /// Tree id of the right-hand tree in the result element.
  std::vector<std::pair<int, int>> element_list;
  /// Constructor.
  InvertedListElement();
};

candidate_index::InvertedListElement::InvertedListElement() {}

} // namespace candidate_index
