nodes store lists
This commit is contained in:
parent
9837ae1773
commit
1b2a2040bb
28
index.html
28
index.html
@ -356,18 +356,12 @@ var App = {
|
|||||||
let topics = App.State.Topics;
|
let topics = App.State.Topics;
|
||||||
let items = App.State.Items;
|
let items = App.State.Items;
|
||||||
|
|
||||||
if(topics.Active.length == 0 || !topics.Active[0].Parent )
|
|
||||||
{
|
|
||||||
items.Active = [...items.All];
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
items.Active = [];
|
items.Active = [];
|
||||||
for(let i=0; i<topics.Active.length; i++)
|
for(let i=0; i<topics.Active.length; i++)
|
||||||
{
|
{
|
||||||
items.Active = items.Active.concat( topics.Active[i].Leaves );
|
items.Active = items.Active.concat( topics.Active[i].Leaves );
|
||||||
}
|
}
|
||||||
}
|
|
||||||
App.State.Pages.All = _.chunk(items.Active, 10);
|
App.State.Pages.All = _.chunk(items.Active, 10);
|
||||||
App.State.Pages.Active = 0;
|
App.State.Pages.Active = 0;
|
||||||
},
|
},
|
||||||
@ -378,7 +372,7 @@ var App = {
|
|||||||
{
|
{
|
||||||
if(!n.Children)
|
if(!n.Children)
|
||||||
{
|
{
|
||||||
output[n.ID] = n.Leaves;
|
output[n.ID] = n;
|
||||||
}
|
}
|
||||||
});
|
});
|
||||||
return output;
|
return output;
|
||||||
@ -438,7 +432,6 @@ var App = {
|
|||||||
},
|
},
|
||||||
Load:(file)=>
|
Load:(file)=>
|
||||||
{
|
{
|
||||||
|
|
||||||
let structTopics = App.LeafStructure(App.State.Topics);
|
let structTopics = App.LeafStructure(App.State.Topics);
|
||||||
|
|
||||||
fetch(file)
|
fetch(file)
|
||||||
@ -464,20 +457,33 @@ var App = {
|
|||||||
let match = structTopics[t];
|
let match = structTopics[t];
|
||||||
if(match)
|
if(match)
|
||||||
{
|
{
|
||||||
match.push(output);
|
match.Leaves.push(output);
|
||||||
}
|
}
|
||||||
});
|
});
|
||||||
|
|
||||||
App.State.Items.All[Math.floor(i/4)] = output;
|
App.State.Items.All[Math.floor(i/4)] = output;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Object.values(structTopics).forEach( inLeaf=>
|
||||||
|
{
|
||||||
|
Node.IterateUp(inLeaf, inBranch=>
|
||||||
|
{
|
||||||
|
inBranch.Leaves = inBranch.Leaves.concat(inLeaf.Leaves);
|
||||||
|
}
|
||||||
|
);
|
||||||
|
}
|
||||||
|
);
|
||||||
|
|
||||||
})
|
})
|
||||||
.then(inAccept=>
|
.then(inAccept=>
|
||||||
{
|
{
|
||||||
App.ApplyFilters();
|
App.ApplyFilters();
|
||||||
App.Render();
|
App.Render();
|
||||||
});
|
|
||||||
|
|
||||||
console.log(structTopics);
|
console.log(structTopics);
|
||||||
|
});
|
||||||
|
|
||||||
|
|
||||||
},
|
},
|
||||||
Topic:(topic)=>
|
Topic:(topic)=>
|
||||||
{
|
{
|
||||||
|
Loading…
Reference in New Issue
Block a user