hiro/tridactyl
1
0
Fork 0
mirror of https://github.com/vale981/tridactyl synced 2025-03-06 10:01:39 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

wip: tree visualization and indicies

Browse source
This commit is contained in:
ivcz 2021-10-26 04:15:45 +03:00
parent 7bbeba74ae
commit 1c6a471dc3
1 changed files with 43 additions and 20 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

63
src/completions/TabHistory.ts
View file

@ -17,7 +17,7 @@ class TabHistoryCompletionOption
this.html = html`<tr class="TabHistoryCompletionOption option"> this.html = html`<tr class="TabHistoryCompletionOption option">
<td class="prefix">${index}</td> <td class="prefix">${index}</td>
<td class="container"></td> <td class="container"></td>
<td class="title">${tab.title}</td> <td class="title">${tab.prefix}${tab.title}</td>
<td class="content"> <td class="content">
<a class="url" href="${tab.href}">${tab.href}</a> <a class="url" href="${tab.href}">${tab.href}</a>
</td> </td>
@ -44,29 +44,39 @@ export class TabHistoryCompletionSource extends Completions.CompletionSourceFuse
return this.updateOptions(exstr) return this.updateOptions(exstr)
} }
private traverseChildren(tree, node, startDistance) { private traverseChildren(tree, node) {
for (const child of node["children"]) { for (const child of node["children"]) {
const newNode = tree[child] const newNode = tree[child]
this.traverseChildren(tree, newNode, startDistance) this.traverseChildren(tree, newNode)
this.addIndex( this.addIndex(tree, newNode)
newNode,
this.distanceToStart(tree, newNode) - startDistance,
)
} }
} }
private addIndex(node, prefix: number) { private addIndex(tree, node) {
node["index"] = `${prefix}` const parentCount = this.countParents(tree, node)
node["index"] = parentCount
let string = ""
for (let i = 0; i <= parentCount; ++i) {
if (i === parentCount) {
string += "├─"
} else if (i === 0) {
string += "| "
} else {
string += "| "
}
}
node["prefix"] = string
} }
private distanceToStart(tree, end): number { private countParents(tree, node): number {
let node = tree[end["parent"]] let prev = null
if (tree[node["parent"]]) prev = tree[node["parent"]]
let counter = 0 let counter = 0
while (node) { while (prev) {
node = tree[node["parent"]] prev = tree[prev["parent"]]
counter += 1 counter += 1
} }
return counter return counter - 1
} }
private async updateOptions(exstr = "") { private async updateOptions(exstr = "") {
@ -81,19 +91,19 @@ export class TabHistoryCompletionSource extends Completions.CompletionSourceFuse
let jump = history["list"][history["current"]] let jump = history["list"][history["current"]]
let counter = 0 let counter = 0
if (jump) history["list"][history["current"]]["index"] = "%" if (jump) {
history["list"][history["current"]]["index"] = "%"
history["list"][history["current"]]["prefix"] = "|"
}
while (jump && history["list"][jump["parent"]]) { while (jump && history["list"][jump["parent"]]) {
counter -= 1 counter -= 1
history["list"][jump["parent"]]["index"] = counter history["list"][jump["parent"]]["index"] = counter
history["list"][jump["parent"]]["prefix"] = "|"
jump = history["list"][jump["parent"]] jump = history["list"][jump["parent"]]
} }
jump = history["list"][history["current"]] jump = history["list"][history["current"]]
this.traverseChildren( this.traverseChildren(history["list"], jump)
history["list"],
jump,
this.distanceToStart(history["list"], jump),
)
history["list"] = history["list"].filter(el => history["list"] = history["list"].filter(el =>
Object.prototype.hasOwnProperty.call(el, "index"), Object.prototype.hasOwnProperty.call(el, "index"),
@ -106,6 +116,8 @@ export class TabHistoryCompletionSource extends Completions.CompletionSourceFuse
href: item.href, href: item.href,
id: item.index, id: item.index,
title: item.title, title: item.title,
prefix: item.prefix,
index: item.index,
}), }),
), ),
) )
@ -113,6 +125,17 @@ export class TabHistoryCompletionSource extends Completions.CompletionSourceFuse
} }
private scoreOptions(options: TabHistoryCompletionOption[]) { private scoreOptions(options: TabHistoryCompletionOption[]) {
options.sort((el1, el2) => {
if (el1["index"] && el2["index"] && el1["index"] < el2["index"])
return -1
if (el1["index"] && el2["index"] && el1["index"] > el2["index"])
return 1
if (el1["parent"] && el2["parent"] && el1["parent"] < el2["parent"])
return -1
if (el1["parent"] && el2["parent"] && el1["parent"] > el2["parent"])
return 1
return 0
})
return options return options
} }
} }