2f:T512,parseParagraps = [ ... paragraphs.querySelectorAll('p') ].reduce((pool,item,i,f)=> { let fuse = /[a-z0-9\,\;]\n$/; let skip = /^\d+([\.\s\d]+)[A-Z]?/; let size = pool.length; if ( size > 0 && fuse.test(f[i-1]?.innerHTML ) &&! skip.test(f[i-1]?.innerHTML ) ) { pool[size-1][1] += item.innerHTML.replaceAll(/\b\-\s+\b/g,''); item.remove() } else if ( i> 0 ) { pool.push([item,item.innerHTML]) } else if ( pool[0][0] == undefined ) { pool[0][0] = item } return pool },[[undefined,'']]) . forEach (([p,text])=>{ let h1 = /^(\d{1,2}\.){0}\d{1,2}(\s+)?[A-Z]/; let h2 = /^(\d{1,2}\.){1}\d{1,2}(\s+)?[A-Z]/; let h3 = /^(\d{1,2}\.){2}\d{1,2}(\s+)?[A-Z]/; let li = /•/; let tag = undefined; switch (true) { case h1.test(text): tag = 'h3'; break; case h2.test(text): tag = 'h4'; break; case h3.test(text): tag = 'h5'; break; case li.test(text): tag = 'li', text = text.replace(li,'');break; } if(tag) { let el = document.createElement(tag); el.innerHTML = text; p.parentNode.replaceChild(el,p); } else { p.innerHTML = text; } })30:T1760,function getWide({ mode = 'BFS', depth = 5 , slots = 2 ** 15, dist = false, cycles = false , tree = false, query = (``), filter = (k,c,p) => true, take = Infinity, meta, format = (v)=> v , parse = (v) => v, leaves = null, ... rest } = {}) { /* -------- */ let iters = -1; let object = rest; let outer = [], queue = []; let t1 = performance.now(); let maxDepth = depth; let prior = new Set(), cache = new Map(), nodes = new Map(), types = new Map(); /* ---------------- */ let its = (prop) => Object.prototype.toString.call(prop); let any = (prop, ...types) => types.some((type) => its(prop) === its(type)); let not = (prop, ...types) => !any(prop,...types) ; let see = (prop) => ext(prop) ? 'Class' : its(prop).slice(1,-1).split(' ')[1] let ext = (prop) => its(prop).includes('Func') && Function.prototype.toString.call(prop).startsWith('class') let end = (prop) => leaves === null ? ~leaves : leaves ^ typeof prop === typeof {}; let bin = (item) => Object.fromEntries(Object.entries(item).map(d=>[d[0],''])); let get = (path) => path.slice(1).reduce((path,item)=> path && path[item] || null, (object)) /* ---------------- */ let sum = (list, all = {}) => { for ( let [ key, val ] of list) { let type = types.get(val) ?? see(val?.value || val); types.set(val,type); all[type] = (all[type] || 0) + 1} return all } /* ---------------- */ let sep = (types, left = '', right = '') => { for ( let [key,val] of types) { if ( key.length > 0 && !isFinite(key)) { left += key + '|' } else { right += key + '|' }} return [ left.slice(0,-1), right.slice(0,1) ] } /* ---------------- */ let add = (item) => { let node = document.createElement(item.own); Object.defineProperty(node,'out',{ get:()=>format(node.outerHTML)}) Object.entries(item) .filter(([key, val], i, f) => ["key", "cid","sub","sig","all"].includes(key) && val) .forEach(([key, val]) => any(val, Object()) ? Object.entries(val).forEach(([key,val])=> node.setAttribute(key+'s',val)) : ( node.setAttribute(key, val), not(item.val, Array(),Object(),Symbol()) ? node.setAttribute('content', item.val) : null )); return node }; /* ---------------- */ function getProp(object, depth = 0) { let chain = [], forward; queue.push([object, chain, depth]); switch (mode) { case "BFS": forward = true, mode = "shift" ; break; case "DFS": forward = false, mode = "pop"; break;} while ( queue.length ) {[ object , chain , depth ] = queue[mode](); for ( let [ key, val ] of forward ? spy(object) : spy(object).reverse().sort((a,b)=>parseInt(a) - parseInt(b))) { ++iters; if ( outer.length > take - 1 ) continue let own = types.get(val) ?? see(val) , set, sig, all, child; types.set(val,own); let entry = { key, own, val, pad:chain, set, sig, all, sub:depth, cid: val?.name ?? val?.constructor?.name } if( typeof meta == 'function' ) { Object.assign(entry, { ext:meta({...entry})}) } Object.defineProperties(entry , { parse: { value:()=>not(val, Object(),Symbol()) ? parse(val.toString()) : {}}, path: { get:()=>entry.pad.map(d=>d.key)}}) if ( dist ) { let details = cache.get(val) if( details === undefined ) { details = spy(val); [ set , sig , all ] = sep(details).concat(sum(details)); cache.set(val , [ set , sig , all ])} else {[ set , sig , all ] = details}; Object.assign(entry,{set,sig,all})} if ( tree ) { let parentPath = chain.map(d=>d.key), childsPath = parentPath.concat(key), parent = nodes.get(parentPath.join(':')) ?? document.createElement('root'); child = nodes.get(childsPath.join(':')) ?? add(entry); nodes.set(childsPath.join(':'),child) parent.appendChild(child)} if ( filter(key, entry, chain.at(-1) ?? bin(entry)) && end(val)) { outer.push( Object.defineProperties( { named: key, above:chain.at(-1), below:entry, chain, child, iters,depth }, { out: { get:()=>child.out}, path:{ get:()=>entry.path }}))} if ((typeof val == 'object' ? prior.has(val) : prior.has(key)) && !cycles || prior.size > slots - 1 ) { continue } if ((typeof val == 'object' || typeof val == 'function') && depth < maxDepth) { prior.add(val); queue.push([val, [...chain, entry], depth + 1]) } else { prior.add(key); } } } } getProp(object); if( tree && query.length > 0 ) { let result = nodes.values().next().value.querySelectorAll(query) for ( let i = 0; i < result.length; ++i) { result[i].dataset.include = true } outer = outer.filter(d=>{ let inc = d.child.dataset.include ; delete d.child.dataset.include; return inc; })} Object.defineProperty(outer,'ticks', { get:()=> performance.now() - t1 }) return outer }31:T877,function createXML(oObjTree) { let visited = new Set(); function loadObjTree(oParentEl, oParentObj) { var val, oChild; if(oParentObj) { if ( ( oParentObj.constructor === String || oParentObj.constructor === Number || oParentObj.constructor === Boolean ) ) { oParentEl.appendChild( oNewDoc.createTextNode(oParentObj.toString()) ); /* verbosity level is 0 or 1 */ if (oParentObj === oParentObj.valueOf()) { return; } } else if ( oParentObj.constructor === Date) { oParentEl.appendChild(oNewDoc.createTextNode(oParentObj.toGMTString())); } let i = 0; for (var [key,val] of Object.entries(oParentObj)) { if (isFinite(key) || visited.has(key)) { continue; } /* verbosity level is 0 */ visited.add(key); if (key === "keyValue") { if (val !== null && val !== true) { oParentEl.appendChild( oNewDoc.createTextNode( val.constructor === Date ? val.toGMTString() : String(val) ) ); } } else if (key === "keyAttributes") { /* verbosity level is 3 */ for (var [attr,value] of val) { oParentEl.setAttribute(attr, value); } } else if (key.charAt(0) === "@") { oParentEl.setAttribute(key.slice(1), val); } else if ( val && val.constructor === Array) { for (var n = 0; n < val.length; n++) { oChild = oNewDoc.createElement(key); loadObjTree(oChild, val[n]); oParentEl.appendChild(oChild); } } else { oChild = oNewDoc.createElement(key); if (val instanceof Object) { loadObjTree(oChild, val); } else if (val !== null && val !== true && val?.['toString'] !== undefined) { oChild.appendChild(oNewDoc.createTextNode(val.toString())); } oParentEl.appendChild(oChild); } //} } }} const oNewDoc = document.implementation.createDocument("", "", null); loadObjTree(oNewDoc, oObjTree); return oNewDoc; } 32:T553,// from // stackoverflow.com/a/9927697 function hashCode(o, l = 2) { /* o: object , l : length */ var i, c, r = []; for (i = 0; i < l; i++) r.push(i * 268803292); function toHex(number) { var ret = ((number < 0 ? 0x8 : 0) + ((number >> 28) & 0x7)).toString(16) + (number & 0xfffffff).toString(16); while (ret.length < 8) ret = "0" + ret; return ret; } function stringify(o) { var i, r; if (o === null) return "n"; if (o === true) return "t"; if (o === false) return "f"; if (o instanceof Date) return "d:" i = typeof o; if (i === "string") return "s:" + o.replace(/([\\\\;])/g, "\\$1"); if (i === "number") return "n:" + o; if (o instanceof Function) return "m:" + o.toString().replace(/([\\\\;])/g, "\\$1"); if (o instanceof Array) { r = []; for (i = 0; i < o.length; i++) r.push(stringify(o[i])); return "a:" + r.join(";"); } r = []; for (i in o) { r.push(i + ":" + stringify(o[i])); } return "o:" + r.join(";"); } o = stringify(o); for (i = 0; i < o.length; i++) { for (c = 0; c < r.length; c++) { r[c] = (r[c] << 13) - (r[c] >> 19); r[c] += o.charCodeAt(i) << r[c] % 24; r[c] = r[c] & r[c]; } } for (i = 0; i < r.length; i++) { r[i] = toHex(r[i]); } return r.join(""); } 33:T53c,function pretty(code, stripWhiteSpaces, stripEmptyLines) { "use strict"; var whitespace = ' '.repeat(2); // Default indenting 4 whitespaces var currentIndent = 0; var char = null; var nextChar = null; var result = ''; for(var pos=0; pos <= code.length; pos++) { char = code.substr(pos, 1); nextChar = code.substr(pos+1, 1); // If opening tag, add newline character and indention if(char === '<' && nextChar !== '/') { result += '\n' + whitespace.repeat(currentIndent); currentIndent++; } // if Closing tag, add newline and indention else if(char === '<' && nextChar === '/') { // If there're more closing tags than opening if(--currentIndent < 0) currentIndent = 0; result += '\n' + whitespace.repeat(currentIndent); } // remove multiple whitespaces else if(stripWhiteSpaces === true && char === ' ' && nextChar === ' ') char = ''; // remove empty lines else if(stripEmptyLines === true && char === '\n' ) { //debugger; if(code.substr(pos, code.substr(pos).indexOf("<")).trim() === '' ) char = ''; } result += char; } return result; }34:Te89,function locate({ prefix = '@' , separator = '.' , mode = "BFS", depth = 5, cycles = false, top = 1024, iters = 1024, filter = (k,v,p)=> v , leaves = null, ... rest} = {}) { let object = rest; let entry, method, i = 0; let inner = {}; let outer = []; let stack = []; stack.push([[prefix],object]); let prior = new Set(); let store = new Map(); let its = (filter); let has = (prop) => Object.prototype.toString.call(prop); let not = (prop, ...types) => !any(prop,...types) ; let any = (prop, ...types) => types.some((type) => has(prop) === has(type)); let end = (prop) => leaves === null ? ~leaves : leaves ^ typeof prop === typeof {}; let get = (path) => path.slice(1).reduce((path,item)=> path && path[item] || null, (object)) let see = (prop) => prop && any(prop, Object(), Array(), Function()) ? prop.prototype ? Object.entries(Object.getOwnPropertyDescriptors(prop.prototype)) .filter((d) => d[0] !== "constructor") .map((d) => [d[0], d[1].value]) : Object.entries(prop) : []; let pin = ({ key , item , path }= {}) => { let sub = see(item); let out = { [ path.join(separator) ]: key, name: key, call: item?.name, step: path.length, type: typeof item === 'function' && /^class\s/.test(Function.prototype.toString.call(item)) ? 'Class' : has(item).replace(/[\[\]]/g,'').split(' ')[1], hash: '',//hashCode(item,2), sign: hashCode(Object.fromEntries(sub.map(d=>[d[0],'']).sort()),2), size: sub.length, path: path.slice(1), item } let node = document.createElement(out.type); node.setAttribute('name', out.name); if(out.call) { node.setAttribute('call', out.call) }; node.setAttribute('hash', out.hash); node.setAttribute('step', out.step); // if(out.hash !== out.sign) { node.setAttribute('sign', out.sign) }; node.setAttribute('size', out.size); Object.defineProperty(node,'out',{ get: ()=>pretty(node.outerHTML) }) ; return {...out,node} } while (stack.length) { let [path,current] = stack.pop(); switch (mode) { case "BFS": entry = see(current), method = "unshift" ; break; case "DFS": entry = see(current).reverse(), method = "push"; break;} for ( let [key, item] of entry ) { if ( prior.has(key) && !isFinite(key) && !cycles || ( depth < path.length || outer.length > top -1 || i > iters )) { continue }; prior.add(key); i++; let parentPath = [...path].join(separator); let childsPath = [...path,key].join(separator); let parent = store.get(parentPath) ?? pin({key:path.at(-1),item:get(path),path}); let child = pin({key,item,path}); parent.node.appendChild(child.node) store.set(childsPath, child) if ( item && any( item, Object(), Function(), Array()) ) { Array.prototype[method].call(stack, [path.concat(key),item]) } else if ( not(item,Symbol())) { child.node.setAttribute('value', item ); } if ( its(key,child,parent) && end(item) ) { outer.push({...child, parent});child.node.setAttribute('include',true); } } } store.forEach((entry)=>!entry.node.getAttribute('include') ? entry.node.replaceWith(...entry.node.children) : entry.node.removeAttribute('include')) return outer //mode == 'DFS' ? outer.sort((a,b)=> a.path.localeCompare( b.path) || a.name.localeCompare( b.name)) : outer // }35:T3a5f,paragraphs = htl.html`

Page 1 of 8

Reconstruction of Threaded Conversations

in Online Discussion Forums

Erik Aumayr and Jeffrey Chan and Conor Hayes

Digital Enterprise Research Institute

NUI Galway, Ireland

Email: {erik.aumayr, jkc.chan, conor.hayes}@deri.org

Abstract

Online discussion boards, or Internet forums, are a significant

part of the Internet. People use Internet forums to post ques- tions, provide advice and participate in discussions. These

online conversations are represented as threads, and the con- versation trees within these threads are important in under- standing the behaviour of online users. Unfortunately, the

reply structures of these threads are generally not publicly

accessible or not maintained. Hence, in this paper, we in- troduce an efficient and simple approach to reconstruct the

reply structure in threaded conversations. We contrast its ac- curacy against three baseline algorithms, and show that our

algorithm can accurately recreate the in and out degree dis- tributions of forum reply graphs built from the reconstructed

reply structures.

1 Introduction

Internet forums are an important part of the Web. Along

with Twitter, web logs and wikis, they provide a platform for

questions to be asked and answered, information to be dis- seminated and public discussions on all types of topics. Ac- cording to Internet Brands1, 11% of Internet traffic in 2009

consists of visits to online forums, showing forums are still

an integral part of the Web.

In forums, conversations are represented as sequences of

posts, or threads, where the posts reply to one or more earlier

posts. For example, Figure 1 shows a thread from the poker

forum on www.boards.ie. It consists of a sequence of posts

discussing how to become a Texas Hold’em poker dealer.

Links exist between posts if one is the reply of another.

The threaded nature of forums allows us to follow the con- versations, and thus study interesting problems. For exam- ple, users can be profiled and analysed based on their reply- ing behaviour, which is extracted from the reply structure

of forums. In (Chan, Daly, and Hayes 2010), users were

profiled using this method, then grouped together into user

roles of common behaviour. The roles were then used to

decompose forums into percentage of users playing partic- ular roles. Another sample application is in topic and trend

tracking (Allan 2002). By recovering the reply structure, we

can follow the actual conversation stream in threads, which

http://www.internetbrands.com

might not be in the order the posts are posted. As it can be

seen, the reply structure of threads have many applications.

There are many forums and many datasets of forums on- line. However, the reply structure of threads is not always

available. This can be due to the failure of the board system

to properly log them, it is not maintained by the providers, it

is not publicly available or even lost. Therefore in this paper,

we propose a new method to reconstruct the reply structure

of posts in forums.

Prior work in reconstructing the thread structure is limited

(Wang et al. 2008). They focus on either detecting ques- tion and answers in forums (Cong et al. 2008), which is

only one type of thread in online forums, or only use con- tent to reconstruct thread structure, which results in low ac- curacy (Wang et al. 2008). We propose a new approach

to reconstructing thread structures. It uses a set of simple

features and a classifier (a decision tree) to reconstruct the

reply structure of threads. We evaluate the accuracy of the

algorithm against the existing and a baseline algorithm us- ing traditional notions of precision and recall and the ability

of the algorithms to recreate the in and out degree distribu- tions of reply graphs built from the reconstructed replying

structure. We also analyse how well the algorithms perform

in recreating the local in and out degrees and the clustering

coefficient for individual vertices in the reply graphs.

In summary, the contributions of this work are:

• Proposal of a classification approach to reconstruct reply

behaviours in threads, that uses content and non-content

features.

• Show that the algorithm can accurately recreate the in and

out degree distributions of the forum reply graphs that are

created from the reconstructed reply structures.

• Show that the difference in accuracy of our algorithm and

a baseline algorithm result in significant differences in the

local degree and clustering coefficient values of the reply

forum graphs.

The remainder of this paper is as follows. In Section 2

we describe related work, then we explain our approach to

reconstructing threaded conversations in Section 3. In the

next section, we present our evaluate and contrast the results

of the different approaches. Finally, Section 5 concludes this

paper and presents possible future work.

Proceedings of the Fifth International AAAI Conference on Weblogs and Social Media

`36:[] 2d:{"title":"","cells":[{"id":10605,"value":"{\n let paragraph = htl.html`

`\n paragraph.textContent =\"online conversations are represented as threads, and the con-\\nversation trees within these threads are important in under-\\nstanding the behaviour of online users. Unfortunately, the\\n\"\n\n\n\n return paragraph.textContent.split(/\\n(?!$)/).map(d=>``+d+`\\n`).join('')\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":80,"value":"$2f","pinned":false,"hidden":false,"mode":"ojs"},{"id":7417,"value":"function getDeep(obj, prop) {\n \n let seen = new Set();\n let outer = [];\n\n let iters = 0\n\n function getProp(obj, prop,depth = 0) {\n for (var i in obj) {\n \n ++iters;\n if ((typeof obj[i] == \"object\" ? seen.has(obj[i]) : seen.has(i)) || seen.size > 25000 || depth > 4) {\n continue; \n }\n \n if (i == prop) { outer.push({entry:{[i]:obj[i]},above:obj,depth,iters}); }\n \n if (typeof obj[i] == \"object\" && depth < 4) {\n seen.add(obj[i]);\n depth++;\n getProp(obj[i], prop,depth);\n } else {\n seen.add(i) \n \n }\n }\n }\n\n getProp(obj,prop)\n\n return outer\n \n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":8434,"value":"function spy(object) {/*\n\n* ------ enumerate keys \n* ------ names, methods\n\n*/ var list = [], props, \n current = object;\n \n do { \n try { props = Object.entries( current?.prototype ? \n Object.getOwnPropertyDescriptors(current.prototype) : current) } \n catch { props= [] }\n \n for ( let [ key , item ] of props ) \n { if ( item !== undefined && list.indexOf([key, item]) === -1\n &&![ \"constructor\", \"__proto__\",\"writable\",\"enumerable\",\"configurable\",].includes(key) \n &&!( item?.location && item.location == window.location) \n &&!( item?.value?.toString().includes(\"native code\")))\n { list.push([key, item?.value ?? item ]) }}} \n \n while ( current && \n ( current = Object.getPrototypeOf(current))); return list }","pinned":false,"hidden":false,"mode":"ojs"},{"id":7761,"value":"$30","pinned":false,"hidden":false,"mode":"ojs"},{"id":7444,"value":"//getWide({_:\n getWide({d3,tree:false,query:('*'),filter:(k,c,p)=>c,depth:10, dist:false,format,mode:'BFS',cycles:true, leaves:null/*, meta: (v)=> ({time:performance.now()})*/})\n//.map(d=>d.chain.map(d=>d.ext.time))\n \n","pinned":true,"hidden":false,"mode":"ojs"},{"id":6671,"value":"format = import('https://cdn.skypack.dev/xml-formatter@2.6.1?min').then(i=>i.default)","pinned":true,"hidden":false,"mode":"ojs"},{"id":9744,"value":"parse = acorn.parse","pinned":true,"hidden":false,"mode":"ojs"},{"id":9742,"value":"acorn = import('https://unpkg.com/acorn@8.8.2/dist/acorn.mjs?module')","pinned":true,"hidden":false,"mode":"ojs"},{"id":3288,"value":"JXON = (await import('https://cdn.skypack.dev/jxon@2.0.0-beta.5?min')).default","pinned":true,"hidden":false,"mode":"ojs"},{"id":3346,"value":"[...\n createXML({_})\n .querySelectorAll('*')].map(d=>d.outerHTML)[0]","pinned":true,"hidden":false,"mode":"ojs"},{"id":3335,"value":"$31","pinned":false,"hidden":false,"mode":"ojs"},{"id":3927,"value":"testObj = ({a:{d:{left:1,top:2,width:3,e:[2,2,7,'s']}},e:[1,2,3,4],b:{f:{left:1,top:2,width:52,height:4}}})","pinned":true,"hidden":false,"mode":"ojs"},{"id":4997,"value":"[...temp[0].querySelectorAll('string[value^=SOME]')].map(d=>d.parentNode.outerHTML)[0]","pinned":true,"hidden":false,"mode":"ojs"},{"id":5471,"value":"$32","pinned":false,"hidden":false,"mode":"ojs"},{"id":6961,"value":"$33","pinned":false,"hidden":false,"mode":"ojs"},{"id":712,"value":"cycle = ({id:'SOMEGUID',t:[0,1]});","pinned":false,"hidden":false,"mode":"ojs"},{"id":5771,"value":"target = Object.getOwnPropertyNames(d3.Voronoi.prototype).length","pinned":true,"hidden":false,"mode":"ojs"},{"id":1804,"value":"temp = locate({d3, mode:'BFS', depth: 10,filter:(k,c,p)=> (p.type == 'Object' || p.type == 'Array') && c.type=='String',cycles:true, leaves:null})[0].node.parentNode.out","pinned":true,"hidden":false,"mode":"ojs"},{"id":1851,"value":"$34","pinned":true,"hidden":false,"mode":"ojs"},{"id":704,"value":"// snippet from:\n// stackoverflow.com/a/57193345\n\nfunction stringify(val, depth, replacer, space, onGetObjID) {\n \n depth = isNaN(+depth) ? 1 : depth;\n var recursMap = new WeakMap();\n \n function _build(val, depth, o, a, r) {\n // (JSON.stringify() has it's own rules, which we respect here by using it for property iteration)\n return !val || typeof val != \"object\"\n ? val\n : ((r = recursMap.has(val)),\n recursMap.set(val, true),\n (a = Array.isArray(val)),\n r\n ? (o = (onGetObjID && onGetObjID(val)) || null)\n : JSON.stringify(val, function (k, v) {\n if (a || depth > 0) {\n if (replacer) v = replacer(k, v);\n if (!k) return (a = Array.isArray(v)), (val = v);\n !o && (o = a ? [] : {});\n o[k] = _build(v, a ? depth : depth - 1);\n }\n }),\n o === void 0 ? (a ? [] : {}) : o);\n }\n \n return JSON.stringify(_build(val, depth), null, space);\n \n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":775,"value":"// adapted from\n// stackoverflow.com/a/66465794\n\nfunction getNested(obj, prop, {type = 'BFS'} = {}) {\n console.log(type)\n let queue = [obj];\n let result = [];\n while (queue.length > 0 && result.length < 1 && prop) {\n let current = queue.shift();\n if (current) {\n for (let [key, val] of Object.entries(current)) {\n console.log(key);\n if (typeof val === \"object\") { queue.push(val); }\n if (key === prop) { \n result.push(key) \n }\n\n }\n }\n }\n return result;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1398,"value":"traverse(graph)","pinned":false,"hidden":false,"mode":"ojs"},{"id":1323,"value":"function traverse(object) {\n \n let depth = 0;\n let stack = [[object, []]];\n let visited = new Set();\n\n const result = [];\n\n while (stack.length > 0 && result.length < 20 && depth < 3) {\n // Get the next node to search.\n let [current, path] = stack.pop();\n\n if (current) {\n for (let [key, val] of Object.entries(current)) {\n \n // Ignore the node if we've visited it before.\n if (visited.has(key) && !isFinite(key)) {\n continue;\n }\n // Mark the node as visited.\n visited.add(key);\n\n // Add its children to the stack.\n if (typeof val === \"object\") {\n stack.push([val, [...path, key]]);\n depth = path.length;\n } \n result.push([key, path.join('.'),val]) }\n //if (key === \"a\") result.push([path.length, key, path.join(\".\"), val]);\n \n }\n }\n return result;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1770,"value":"dfs(testObj)","pinned":true,"hidden":false,"mode":"ojs"},{"id":835,"value":"function dfs(obj, out = {}, prev = []) {\n\n if(obj){\n for (let [key, val] of Object.entries(obj)) {\n let path = [...prev, key];\n\n \n if (typeof val === \"object\" && prev.length < 3) {\n out[key] = {}; \n dfs(val, out[key], path);\n } else {\n out[key] = val;\n }\n console.log(path.length,key,path)\n \n }\n \n } return out;\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":710,"value":"graph = ({a:[12,2,{y:3,z:{o1:{u:{r:cycle}}},e:{f:cycle}}],s:'!',b:{j:{k:null},x:1,o2:cycle,o3:cycle},c:[23,24,[25,26,undefined]]})","pinned":true,"hidden":false,"mode":"ojs"},{"id":718,"value":"stringify(graph,2)//,(k,v)=> k == 'y' ? v : undefined)","pinned":true,"hidden":false,"mode":"ojs"},{"id":0,"value":"string = \"[`+`]\"","pinned":false,"hidden":false,"mode":"ojs"},{"id":7,"value":"string.split(/(\\[`[\\+|\\#]`\\])/)","pinned":false,"hidden":false,"mode":"ojs"},{"id":488,"value":"fetch('https://cdn.skypack.dev/-/tufte-css@v1.7.2-g1wyqg4s9i8xXAct2gEy/dist=es2020,mode=raw/tufte.min.css')","pinned":true,"hidden":false,"mode":"ojs"},{"id":352,"value":"highlighter = new Highlighter()","pinned":true,"hidden":false,"mode":"ojs"},{"id":469,"value":"highlighter.cache.data","pinned":true,"hidden":false,"mode":"ojs"},{"id":354,"value":"Highlighter = (await import('https://cdn.skypack.dev/web-highlighter@0.7.4?min')).default;\n","pinned":true,"hidden":false,"mode":"ojs"},{"id":356,"value":"{ \n highlighter.on('selection:create', ({sources}) => {\n sources = sources.map(hs => {\n // save to backend\n \n\n let flat = [...paragraphs.querySelectorAll(`*`)];\n let last = flat.findIndex(el=> el.dataset.highlightId == hs.id);\n\n let page = flat.slice(0,last).findLastIndex((el) => el.tagName == 'H2');\n\n let h3 = flat.slice(0,last).findLastIndex((el) => el.tagName == 'H5');\n let h2 = flat.slice(0,h3 > 0 ? h3 : last).findLastIndex((el) => el.tagName == 'H4');\n let h1 = flat.slice(0,h2 > 0 ? h2 : last).findLastIndex((el) => el.tagName == 'H3');\n\n let {text} = hs;\n let out = {\n p:flat[page]?.textContent,\n h1:flat[h1]?.textContent,\n h2:flat[h2]?.textContent,\n h3:flat[h3]?.textContent,\n ts: Date.now()\n }\n \n\n \n return {...hs,out}\n \n })\n highlighter.cache.save(sources)\n });\n\n\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":363,"value":"// highlighter.run();","pinned":true,"hidden":false,"mode":"ojs"},{"id":494,"value":"{\n let range = new Range();\n\n range.setStart(paragraphs.children[1].firstChild, 2);\n range.setEnd(paragraphs.children[1].firstChild, 3);\n\n console.log(range.toString()); // ample: italic and bol\n\n // use this range for selection (explained later)\n window.getSelection().addRange(range);\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":657,"value":"","pinned":true,"hidden":false,"mode":"ojs"},{"id":588,"value":"{ let start = 0,end = 0; \n \n let spans = paragraphs.children[1].innerHTML.split(/\\b/)\n .map(d=> `${d}`)\n\n paragraphs.children[1].innerHTML = spans.join('');\n\n return paragraphs.children[1].outerHTML\n\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":520,"value":"{ \n //let clone = document.createElement('p');\n // clone.innerHTML = paragraphs.children[1].innerHTML.replace(/([^\\s]+)/g,\"$1\")\n //return [...clone.querySelectorAll('span')].map((d,{x,y})=> ({x,y,d} = {x:1,y:2}))\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":672,"value":"{ \n var selection = window.getSelection();\n selection.removeAllRanges();\n \n var range = document.createRange();\n range.setStart( paragraphs.querySelector(':nth-child(2)'), 0);\n range.setEnd( paragraphs.querySelector(':nth-child(3)'), 1);\n selection.addRange(range); \n\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":10586,"value":"{ \n let selection = window.getSelection()\n\n return [selection.anchorNode, selection.focusNode]\n\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":222,"value":"$35","pinned":true,"hidden":false,"mode":"ojs"},{"id":225,"value":"/^(\\d{1,2}\\.)+\\d{1,2}(\\s+)?[A-Z]/.test(str)","pinned":true,"hidden":false,"mode":"ojs"}],"files":"$W36","stdlib":"1","titling":"auto"}