Skip to content

Commit

Permalink
Various minor fixes
Browse files Browse the repository at this point in the history
  • Loading branch information
lkarlslund committed Nov 17, 2024
1 parent 4a7ba88 commit 98c946e
Show file tree
Hide file tree
Showing 6 changed files with 3 additions and 7 deletions.
1 change: 1 addition & 0 deletions adalanche/non-collector.go
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,7 @@
package main

import (
_ "github.com/lkarlslund/adalanche/modules/aql"
_ "github.com/lkarlslund/adalanche/modules/integrations/activedirectory/analyze"
_ "github.com/lkarlslund/adalanche/modules/integrations/activedirectory/collect"
_ "github.com/lkarlslund/adalanche/modules/integrations/localmachine/analyze"
Expand Down
2 changes: 1 addition & 1 deletion modules/frontend/html/custom.js
Original file line number Diff line number Diff line change
Expand Up @@ -516,7 +516,7 @@ $(function () {

// $('[data-toggle="tooltip"]').tooltip()

var aq1changetimer;
let aq1changetimer;
$("#aqlquerytext").on("input", function (e) {
clearTimeout(aqlchangetimer);
changetimer = setTimeout(function () {
Expand Down
2 changes: 0 additions & 2 deletions modules/frontend/html/external/jquery-3.6.0.min.js

This file was deleted.

1 change: 0 additions & 1 deletion modules/frontend/html/external/jquery-3.6.0.min.map

This file was deleted.

2 changes: 0 additions & 2 deletions modules/frontend/html/graph.js
Original file line number Diff line number Diff line change
Expand Up @@ -1000,8 +1000,6 @@ function initgraph(data) {
applyNodeStyles(cy);

getGraphlayout($("#graphlayout").val()).run()

$("#status").hide();
}

function applyEdgeStyles(cy) {
Expand Down
2 changes: 1 addition & 1 deletion modules/graph/graph.go
Original file line number Diff line number Diff line change
Expand Up @@ -355,7 +355,7 @@ func (pg Graph[NodeType, EdgeType]) TopologicalSort() ([]NodeType, error) {
pg.autoCleanupEdges()
predecessorMap := pg.PredecessorMap()

queue := deque.New[NodeType]()
var queue deque.Deque[NodeType]

for o, predecessors := range predecessorMap {
if len(predecessors) == 0 {
Expand Down

0 comments on commit 98c946e

Please sign in to comment.