utils.h

Go to the documentation of this file.

// BSD 3-Clause License; see https://github.com/scikit-hep/awkward/blob/main/LICENSE
 
#ifndef AWKWARD_CPP_HEADERS_UTILS_H_
#define AWKWARD_CPP_HEADERS_UTILS_H_
 
#include <iterator>
#include <iostream>
#include <complex>
#include <type_traits>
#include <cassert>
#include <utility>
#include <stdexcept>
#include <stdint.h>
#include <typeinfo>
#include <map>
#include <vector>
 
namespace awkward {

  template <typename T>
  inline const std::string
  type_to_name() {
    if (std::is_integral_v<T>) {
      if (std::is_signed_v<T>) {
        if (sizeof(T) == 1) {
          return "int8";
        }
        else if (sizeof(T) == 2) {
          return "int16";
        }
        else if (sizeof(T) == 4) {
          return "int32";
        }
        else if (sizeof(T) == 8) {
          return "int64";
        }
      }
      else {
        if (sizeof(T) == 1) {
          return "uint8";
        }
        else if (sizeof(T) == 2) {
          return "uint16";
        }
        else if (sizeof(T) == 4) {
          return "uint32";
        }
        else if (sizeof(T) == 8) {
          return "uint64";
        }
      }
    }
    else if (std::is_same_v<T, float>) {
      return "float32";
    }
    else if (std::is_same_v<T, double>) {
      return "float64";
    }
    else if (std::is_same_v<T, std::complex<float>>) {
      return "complex64";
    }
    else if (std::is_same_v<T, std::complex<double>>) {
      return "complex128";
    }
 
    // std::is_integral_v<T> and sizeof(T) not in (1, 2, 4, 8) can get here.
    // Don't connect this line with the above as an 'else' clause.
    return std::string("unsupported primitive type: ") + typeid(T).name();
  }
 
  template <>
  inline const std::string
  type_to_name<bool>() {
    // This takes precedence over the unspecialized template, and therefore any
    // 8-bit data that is not named bool will be mapped to "int8" or "uint8".
    return "bool";
  }
 
  template <>
  inline const std::string
  type_to_name<char>() {
    // This takes precedence over the unspecialized template, and therefore any
    // 8-bit data that is not named char will be mapped to "int8" or "uint8".
    return "char";
  }
 

  template <typename T>
  inline const std::string
  type_to_numpy_like() {
    return type_to_name<T>();
  }

  template <>
  inline const std::string
  type_to_numpy_like<uint8_t>() {
    return "u8";
  }

  template <>
  inline const std::string
  type_to_numpy_like<int8_t>() {
    return "i8";
  }

  template <>
  inline const std::string
  type_to_numpy_like<uint32_t>() {
    return "u32";
  }

  template <>
  inline const std::string
  type_to_numpy_like<int32_t>() {
    return "i32";
  }

  template <>
  inline const std::string
  type_to_numpy_like<int64_t>() {
    return "i64";
  }
 
  template <typename, typename = void>
  constexpr bool is_iterable{};
 
  template <typename T>
  constexpr bool is_iterable<T,
                             std::void_t<decltype(std::declval<T>().begin()),
                                         decltype(std::declval<T>().end())>> = true;
 
  template <typename Test, template <typename...> class Ref>
  struct is_specialization : std::false_type {};
 
  template <template <typename...> class Ref, typename... Args>
  struct is_specialization<Ref<Args...>, Ref> : std::true_type {};

  template <typename T, typename OFFSETS>
  std::string
  type_to_form(int64_t form_key_id) {
    if (std::string(typeid(T).name()).find("awkward") != std::string::npos) {
      return std::string("awkward type");
    }
 
    std::stringstream form_key;
    form_key << "node" << (form_key_id++);
 
    if constexpr (std::is_arithmetic<T>::value) {
      std::string parameters(type_to_name<T>() + "\", ");
      if (std::is_same<T, char>::value) {
        parameters = std::string(
            "uint8\", \"parameters\": { \"__array__\": \"char\" }, ");
      }
      return "{\"class\": \"NumpyArray\", \"primitive\": \"" + parameters +
             "\"form_key\": \"" + form_key.str() + "\"}";
    } else if constexpr (is_specialization<T, std::complex>::value) {
      return "{\"class\": \"NumpyArray\", \"primitive\": \"" +
             type_to_name<T>() + "\", \"form_key\": \"" + form_key.str() +
             "\"}";
    } else {
      typedef typename T::value_type value_type;
 
      if (is_iterable<T>) {
        std::string parameters("");
        if (std::is_same<value_type, char>::value) {
          parameters =
              std::string(" \"parameters\": { \"__array__\": \"string\" }, ");
        }
        return "{\"class\": \"ListOffsetArray\", \"offsets\": \"" +
              type_to_numpy_like<OFFSETS>() + "\", "
              "\"content\":" +
              type_to_form<value_type, OFFSETS>(form_key_id) + ", " + parameters +
              "\"form_key\": \"" + form_key.str() + "\"}";
      }
      return "unsupported type";
    }
  }

  template <typename T>
  bool
  is_awkward_type() {
    return (std::string(typeid(T).name()).find("awkward") != std::string::npos);
  }

  template <size_t INDEX>
  struct visit_impl {
    template <typename CONTENT, typename FUNCTION>
    static void
    visit(CONTENT& contents, size_t index, FUNCTION fun) {
      if (index == INDEX - 1) {
        fun(std::get<INDEX - 1>(contents));
      } else {
        visit_impl<INDEX - 1>::visit(contents, index, fun);
      }
    }
  };

  template <>
  struct visit_impl<0> {
    template <typename CONTENT, typename FUNCTION>
    static void
    visit(CONTENT& /* contents */, size_t /* index */, FUNCTION /* fun */) {
      assert(false);
    }
  };

  template <typename FUNCTION, typename... CONTENTs>
  void
  visit_at(std::tuple<CONTENTs...> const& contents, size_t index, FUNCTION fun) {
    visit_impl<sizeof...(CONTENTs)>::visit(contents, index, fun);
  }

  template <typename FUNCTION, typename... CONTENTs>
  void
  visit_at(std::tuple<CONTENTs...>& contents, size_t index, FUNCTION fun) {
    visit_impl<sizeof...(CONTENTs)>::visit(contents, index, fun);
  }

  template<typename LayoutBuilder>
  std::vector<std::string> buffer_name_helper(const LayoutBuilder* builder) {
    std::map <std::string, size_t> names_nbytes = {};
    std::vector<std::string> buffer_name;
    builder->buffer_nbytes(names_nbytes);
    for (auto it: names_nbytes) {
      buffer_name.push_back(it.first);
    }
    return buffer_name;
  }

  template<typename LayoutBuilder>
  std::vector<size_t> buffer_size_helper(const LayoutBuilder* builder) {
    std::map <std::string, size_t> names_nbytes = {};
    std::vector<size_t> buffer_size;
    builder->buffer_nbytes(names_nbytes);
    for (auto it: names_nbytes) {
      buffer_size.push_back(it.second);
    }
    return buffer_size;
  }

  template<typename LayoutBuilder>
  size_t num_buffers_helper(const LayoutBuilder* builder) {
    std::map <std::string, size_t> names_nbytes = {};
    builder->buffer_nbytes(names_nbytes);
    return names_nbytes.size();
  }
 
}  // namespace awkward
 
#endif  // AWKWARD_CPP_HEADERS_UTILS_H_