vertices_builder.h

/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */
 
#pragma once
 
#include <any>
#include <cassert>
#include <cstddef>
#include <memory>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
 
#include "graphar/arrow/chunk_writer.h"
#include "graphar/fwd.h"
#include "graphar/graph_info.h"
#include "graphar/result.h"
#include "graphar/status.h"
#include "graphar/types.h"
#include "graphar/writer_util.h"
 
// forward declaration
namespace arrow {
class Array;
class Table;
}  // namespace arrow
 
namespace graphar::builder {
 
class Vertex {
 public:
  Vertex() : empty_(true) {}
 
  explicit Vertex(IdType id) : id_(id), empty_(false) {}
 
  inline IdType GetId() const noexcept { return id_; }
 
  inline void SetId(IdType id) { id_ = id; }
 
  inline bool Empty() const noexcept { return empty_; }
 
  // TODO(@acezen): Enable the property to be a vector(list).
  inline void AddProperty(const std::string& name, const std::any& val) {
    empty_ = false;
    properties_[name] = val;
  }
 
  inline void AddProperty(const Cardinality cardinality,
                          const std::string& name, const std::any& val) {
    if (cardinality == Cardinality::SINGLE) {
      cardinalities_[name] = Cardinality::SINGLE;
      AddProperty(name, val);
      return;
    }
    empty_ = false;
    if (cardinalities_.find(name) != cardinalities_.end()) {
      if (cardinalities_[name] != cardinality) {
        throw std::runtime_error("Cardinality mismatch for property: " + name);
      }
      auto property_value_list =
          std::any_cast<std::vector<std::any>>(properties_[name]);
      property_value_list.push_back(val);
      properties_[name] = property_value_list;
    } else {
      auto property_value_list = std::vector<std::any>();
      property_value_list.push_back(val);
      properties_[name] = property_value_list;
    }
    cardinalities_[name] = cardinality;
  }
 
  inline const std::any& GetProperty(const std::string& property) const {
    return properties_.at(property);
  }
 
  inline const std::unordered_map<std::string, std::any>& GetProperties()
      const {
    return properties_;
  }
 
  inline bool ContainProperty(const std::string& property) {
    return (properties_.find(property) != properties_.end());
  }
 
  inline bool IsMultiProperty(const std::string& property) const {
    return (cardinalities_.find(property) != cardinalities_.end() &&
            cardinalities_.at(property) != Cardinality::SINGLE);
  }
 
  template <typename T>
  Status ValidatePropertyType(const std::string& property,
                              const Cardinality cardinality) const {
    if (cardinality == Cardinality::SINGLE && IsMultiProperty(property)) {
      return Status::TypeError(
          "Invalid data cardinality for property ", property,
          ", defined as SINGLE but got ",
          cardinalities_.at(property) == Cardinality::LIST ? "LIST" : "SET");
    }
    if (IsMultiProperty(property) &&
        (cardinality == Cardinality::SET ||
         cardinalities_.at(property) == Cardinality::SET)) {
      GAR_RETURN_NOT_OK(ValidateMultiPropertySet<T>(property));
    }
    if (IsMultiProperty(property)) {
      auto value_list =
          std::any_cast<std::vector<std::any>>(properties_.at(property));
      for (auto value : value_list) {
        auto& value_type = value.type();
        if (value_type != typeid(T)) {
          return Status::TypeError("Invalid data type for property ", property,
                                   ", defined as ", typeid(T).name(),
                                   ", but got ", value_type.name());
        }
      }
    } else {
      auto& value_type = properties_.at(property).type();
      if (value_type != typeid(T)) {
        return Status::TypeError("Invalid data type for property ", property,
                                 ", defined as ", typeid(T).name(),
                                 ", but got ", value_type.name());
      }
    }
    return Status::OK();
  }
 
  template <typename T>
  Status ValidateMultiProperty(const std::string& property) const {
    if (IsMultiProperty(property) &&
        cardinalities_.at(property) == Cardinality::SET) {
      GAR_RETURN_NOT_OK(ValidateMultiPropertySet<T>(property));
    }
    return Status::OK();
  }
 
  template <typename T>
  Status ValidateMultiPropertySet(const std::string& property) const {
    auto vec = std::any_cast<std::vector<std::any>>(properties_.at(property));
    std::unordered_set<T> seen;
    for (const auto& item : vec) {
      if (!seen.insert(std::any_cast<T>(item)).second) {
        return Status::KeyError(
            "Duplicate values exist in set type multi-property key: ", property,
            " value: ", std::any_cast<T>(item));
      }
    }
    return Status::OK();
  }
 
 private:
  IdType id_;
  bool empty_;
  std::unordered_map<std::string, std::any> properties_;
  std::unordered_map<std::string, Cardinality> cardinalities_;
};
 
class VerticesBuilder {
 public:
  explicit VerticesBuilder(
      const std::shared_ptr<VertexInfo>& vertex_info, const std::string& prefix,
      IdType start_vertex_index = 0,
      std::shared_ptr<WriterOptions> writerOptions = nullptr,
      const ValidateLevel& validate_level = ValidateLevel::no_validate)
      : vertex_info_(std::move(vertex_info)),
        prefix_(prefix),
        start_vertex_index_(start_vertex_index),
        writer_options_(writerOptions),
        validate_level_(validate_level) {
    if (validate_level_ == ValidateLevel::default_validate) {
      throw std::runtime_error(
          "default_validate is not allowed to be set as the global validate "
          "level for VerticesBuilder");
    }
    vertices_.clear();
    num_vertices_ = 0;
    is_saved_ = false;
  }
  inline void Clear() {
    vertices_.clear();
    num_vertices_ = 0;
    is_saved_ = false;
  }
 
  inline void SetWriterOptions(std::shared_ptr<WriterOptions> writer_options) {
    this->writer_options_ = writer_options;
  }
 
  inline std::shared_ptr<WriterOptions> GetWriterOptions() {
    return this->writer_options_;
  }
 
  inline void SetValidateLevel(const ValidateLevel& validate_level) {
    if (validate_level == ValidateLevel::default_validate) {
      return;
    }
    validate_level_ = validate_level;
  }
 
  inline ValidateLevel GetValidateLevel() const { return validate_level_; }
 
  Status AddVertex(
      Vertex& v, IdType index = -1,  // NOLINT
      ValidateLevel validate_level = ValidateLevel::default_validate) {
    // validate
    GAR_RETURN_NOT_OK(validate(v, index, validate_level));
    // add a vertex
    if (index == -1) {
      v.SetId(vertices_.size());
      vertices_.push_back(v);
    } else {
      v.SetId(index);
      if (index >= static_cast<IdType>(vertices_.size()))
        vertices_.resize(index + 1);
      vertices_[index] = v;
    }
    num_vertices_++;
    return Status::OK();
  }
 
  IdType GetNum() const { return num_vertices_; }
 
  Status Dump() {
    // construct the writer
    VertexPropertyWriter writer(vertex_info_, prefix_, writer_options_,
                                validate_level_);
    IdType start_chunk_index =
        start_vertex_index_ / vertex_info_->GetChunkSize();
    // convert to table
    GAR_ASSIGN_OR_RAISE(auto input_table, convertToTable());
    // write table
    GAR_RETURN_NOT_OK(writer.WriteTable(input_table, start_chunk_index));
    GAR_RETURN_NOT_OK(
        writer.WriteVerticesNum(num_vertices_ + start_vertex_index_));
    is_saved_ = true;
    vertices_.clear();
    return Status::OK();
  }
 
  static Result<std::shared_ptr<VerticesBuilder>> Make(
      const std::shared_ptr<VertexInfo>& vertex_info, const std::string& prefix,
      std::shared_ptr<WriterOptions> writer_options,
      IdType start_vertex_index = 0,
      const ValidateLevel& validate_level = ValidateLevel::no_validate) {
    return std::make_shared<VerticesBuilder>(vertex_info, prefix,
                                             start_vertex_index, writer_options,
                                             validate_level);
  }
 
  static Result<std::shared_ptr<VerticesBuilder>> Make(
      const std::shared_ptr<VertexInfo>& vertex_info, const std::string& prefix,
      IdType start_vertex_index = 0,
      const ValidateLevel& validate_level = ValidateLevel::no_validate) {
    return std::make_shared<VerticesBuilder>(
        vertex_info, prefix, start_vertex_index, nullptr, validate_level);
  }
 
  static Result<std::shared_ptr<VerticesBuilder>> Make(
      const std::shared_ptr<GraphInfo>& graph_info, const std::string& type,
      std::shared_ptr<WriterOptions> writer_options,
      IdType start_vertex_index = 0,
      const ValidateLevel& validate_level = ValidateLevel::no_validate) {
    const auto vertex_info = graph_info->GetVertexInfo(type);
    if (!vertex_info) {
      return Status::KeyError("The vertex type ", type,
                              " doesn't exist in graph ", graph_info->GetName(),
                              ".");
    }
    return Make(vertex_info, graph_info->GetPrefix(), writer_options,
                start_vertex_index, validate_level);
  }
 
  static Result<std::shared_ptr<VerticesBuilder>> Make(
      const std::shared_ptr<GraphInfo>& graph_info, const std::string& type,
      IdType start_vertex_index = 0,
      const ValidateLevel& validate_level = ValidateLevel::no_validate) {
    const auto vertex_info = graph_info->GetVertexInfo(type);
    if (!vertex_info) {
      return Status::KeyError("The vertex type ", type,
                              " doesn't exist in graph ", graph_info->GetName(),
                              ".");
    }
    return Make(vertex_info, graph_info->GetPrefix(), nullptr,
                start_vertex_index, validate_level);
  }
 
 private:
  Status validate(const Vertex& v, IdType index,
                  ValidateLevel validate_level) const;
 
  Status appendToArray(const std::shared_ptr<DataType>& type,
                       const std::string& property_name,
                       std::shared_ptr<arrow::Array>& array);  // NOLINT
 
  template <Type type>
  Status tryToAppend(const std::string& property_name,
                     std::shared_ptr<arrow::Array>& array);  // NOLINT
 
  Result<std::shared_ptr<arrow::Table>> convertToTable();
 
 private:
  std::shared_ptr<VertexInfo> vertex_info_;
  std::string prefix_;
  std::vector<Vertex> vertices_;
  IdType start_vertex_index_;
  IdType num_vertices_;
  bool is_saved_;
  std::shared_ptr<WriterOptions> writer_options_;
  ValidateLevel validate_level_;
};
 
}  // namespace graphar::builder