<commit_before>// ======================================================================== //
// Copyright 2009-2015 Intel Corporation                                    //
//                                                                          //
// Licensed 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 "../../common/default.h"
#include "../../common/alloc.h"
#include "../../common/accel.h"
#include "../../common/device.h"
#include "../../common/scene.h"
#include "../geometry/primitive.h"
#include "../../common/ray.h"

namespace embree
{
  /*! Multi BVH with N children. Each node stores the bounding box of
   * it's N children as well as N child pointers. */
  template<int NN>
  class BVHN : public AccelData
  {
    ALIGNED_CLASS;
  public:

    /*! forward declaration of node type */
    struct BaseNode;
    struct Node;
    struct NodeMB;
    struct UnalignedNode;
    struct UnalignedNodeMB;
    struct TransformNode;

    /*! branching width of the tree */
    static const size_t N = NN;

    /*! Number of bytes the Node and primitives are minimally aligned
        to. Maximally byteAlignment-1 many primitive blocks per leaf are
        supported. */
    static const size_t byteAlignment = 16;
    static const size_t byteNodeAlignment = 4*NN;

    /*! highest address bit is used as barrier for some algorithms */
    static const size_t barrier_mask = (1LL << (8*sizeof(size_t)-1));

    /*! Masks the bits that store the number of items per leaf. */
    static const size_t align_mask = byteAlignment-1;
    static const size_t items_mask = byteAlignment-1;

    /*! different supported node types */
    static const size_t tyNode = 0;<commit_msg>cleanup<commit_after>// ======================================================================== //
// Copyright 2009-2015 Intel Corporation                                    //
//                                                                          //
// Licensed 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 "../../common/default.h"
#include "../../common/alloc.h"
#include "../../common/accel.h"
#include "../../common/device.h"
#include "../../common/scene.h"
#include "../geometry/primitive.h"
#include "../../common/ray.h"

namespace embree
{
  /*! Multi BVH with N children. Each node stores the bounding box of
   * it's N children as well as N child pointers. */
  template<int NN>
  class BVHN : public AccelData
  {
    ALIGNED_CLASS;
  public:

    /*! forward declaration of node type */
    struct BaseNode;
    struct Node;
    struct NodeMB;
    struct UnalignedNode;
    struct UnalignedNodeMB;
    struct TransformNode;

    /*! branching width of the tree */
    static const size_t N = NN;

    /*! Number of bytes the Node and primitives are minimally aligned
        to. Maximally byteAlignment-1 many primitive blocks per leaf are
        supported. */
    static const size_t byteAlignment = 16;
    static const size_t byteNodeAlignment = 4*N;

    /*! highest address bit is used as barrier for some algorithms */
    static const size_t barrier_mask = (1LL << (8*sizeof(size_t)-1));

    /*! Masks the bits that store the number of items per leaf. */
    static const size_t align_mask = byteAlignment-1;
    static const size_t items_mask = byteAlignment-1;

    /*! different supported node types */
    static const size_t tyNode = 0;
{'fraction_non_alphanumeric': 0.15072463768115943, 'fraction_numerical': 0.008502415458937198, 'mean_word_length': 1.7256450763559767, 'pattern_counts': {'":': 0, '<': 9, '<?xml version=': 0, '>': 5, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 26, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6474163', 'n_tokens_mistral': 1221, 'n_tokens_neox': 1143, 'n_words': 465}