<commit_before>﻿using System;

namespace Algorithm.Sandbox.DataStructures.Tree
{
    internal class AsBTreeNode<T> where T : IComparable
    {
        public AsArrayList<T> Value { get; set; }

        public AsBTreeNode<T> Parent { get; set; }
        public AsArrayList<AsBTreeNode<T>> Children { get; set; }

    }

    public class AsBTree<T> where T : IComparable
    {
        public int Count { get; private set; }

        internal AsBTreeNode<T> Root;

        public void Insert(T value)
        {

        }

        public void Delete(T value)
        {

        }

        public bool Exists(T value)
        {
            throw new NotImplementedException();
        }
    }<commit_msg>update progress<commit_after>﻿using System;

namespace Algorithm.Sandbox.DataStructures.Tree
{
    internal class AsBTreeNode<T> where T : IComparable
    {
        public T[] Values { get; set; }

        public AsBTreeNode<T> Parent { get; set; }
        public AsBTreeNode<T>[] Children { get; set; }
        public int Count { get; internal set; }

        public AsBTreeNode(int maxChildren)
        {
            Values = new T[maxChildren];
            Children = new AsBTreeNode<T>[maxChildren + 1];
        }
    }

    public class AsBTree<T> where T : IComparable
    {
        public int Count { get; private set; }

        internal AsBTreeNode<T> Root;
        private int maxChildren;

        public AsBTree(int maxChildren)
        {
            this.maxChildren = maxChildren;
        }


        public void Insert(T value)
        {
            var nodeToInsert = FindInsertionNode(ref Root, value);

            if (nodeToInsert.Count == nodeToInsert.Values.Length)
            {

            }
        }

        private AsBTreeNode<T> FindInsertionNode(ref AsBTreeNode<T> node, T value)
        {
            if (node == null)
            {
                node = new AsBTreeNode<T>(maxChildren);
                return node;
            }

            throw new NotImplementedException();
        }

        public void Delete(T value)
        {

        }

        public bool Exists(T value)
        {
            throw new NotImplementedException();
        }
    }
{'fraction_non_alphanumeric': 0.08576642335766424, 'fraction_numerical': 0.0004562043795620438, 'mean_word_length': 1.7242236024844722, 'pattern_counts': {'":': 0, '<': 19, '<?xml version=': 0, '>': 19, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5037031', 'n_tokens_mistral': 645, 'n_tokens_neox': 610, 'n_words': 161}