jsdbroughton

using System;
using System.Diagnostics;

namespace CASE.Navis2BCF
{

  /// <summary>
  /// Conversion methods between an IFC 
  /// encoded GUID string and a .NET GUID.
  /// This is a translation of the C code 

jsdbroughton

import {
  ActionContext,
  ActionTree,
  GetterTree,
  MutationTree,
  Module,
  Store as VuexStore,
  CommitOptions,
  DispatchOptions,
} from 'vuex'

jsdbroughton

https://medium.com/@jsdbroughton/not-as-recursive-as-id-hoped-2f0fc2a30cc7

jsdbroughton

// tree is what is returned post shenanigans.
let tree:TreeItem[] = [];

// keyMap keeps track of the indexes where parentKeys are found in the keyed but flat array.
const keyMap:Map<string, number> = new Map();

treeItemsWithBranches.forEach( ( node ):void => {

  // nodes with no parents are at root level.
  // this is not a binary tree, there can be several root level nodes.       

jsdbroughton

const parentItems:TreeItem[] = [];
  parentKeys.forEach( ( v:string ):void=>{
    let parts = v.split( `-` );
    while ( uniqueIds.has( lastId ) ) {
      lastId += 1;
    }
    uniqueIds.add( lastId );
    let name = parts.pop() || ``;
    parentItems.push( {
      id: lastId,

jsdbroughton

const keyedItems = treeItems.map( ( item ): TreeItem => {
    const fieldValues = fieldNames.map( ( field ): string => item.data && item.data[field] );
    let parentKey = fieldValues.slice( 0, -1 ).reduce( ( id, field ):string=>{
      if ( id && field ) {
        id += `-` + field;
      }
      if ( !id && field ) {
        id = field;
      }
      parentKeys.add( id );

jsdbroughton

const fieldNames = fieldTokens.map( ( field ): string => field.name );
const parentKeys: Set<string> = new Set();

jsdbroughton

const fieldNames = fieldTokens.map( ( field ): string => field.name );
const parentKeys: Set<string> = new Set();

jsdbroughton

const uniqueIds: Set<number> = new Set();
let lastId = 1;

// All treeviewItems
treeItems.forEach( ( item ): void => {
  if ( item && item.data ) {
    uniqueIds.add( item.data.uniqueId );
    lastId += 1;
  }
});

jsdbroughton

const uniqueIds: Set<number> = new Set();
let lastId = 1;

// All treeviewItems
treeItems.forEach( ( item ): void => {
  if ( item && item.data ) {
    uniqueIds.add( item.data.uniqueId );
    lastId += 1;
  }
});