javascript - Opening 500+ nodes at once in d3.js -

-

currently trying expand d3.js tree contains on 100,000 nodes. many leafs exist under multiple parents, fit multiple sections/items/regions. searches performed user results in tree opening leafs node id. can result in graph trying open up, on rare occasions, 2000 leaf nodes @ once. currently, have found way without crashing chrome use following setinterval code.

var timeout = setinterval(function(){     for(var j = i; j < + 10 ; j++){         makeel(d[j]);         search.rules += (j+1) + ") " + graph.findnode(d[j]) + "<br><br>";         highlightpathto(d[j].id);         if(j >= d.length - 1){             //when of elements have been itterated through.             clearinterval(timeout);             highlight.selected = d;              $('#highlights').removeclass('empty');              break;         }     }     i+=10; }, 500);

however, takes minutes , laggy. there other way accomplish opening number of nodes in 1 go result in quicker completion?

not likely. javascript , browsers can't magically transcend limits of physics (or computer). browsers have come long way handling huge documents. there limits. don't know sure how memory each tree node needs if each of them needs 1 kb, we're talking 100 mb raw data needs rendered on screen. if each nodes takes 10 ms render, drawing page take 1000 seconds.

so guess without looking more closely @ problem can't it. , shouldn't: human brain isn't able process information nor there computer screen display all. think harder want achieve , find better representation.

you can dump ton of data on poor user drown them. find way present important bits, few gems under ton of garbage.


Comments

Post a Comment

Popular posts from this blog

java - Custom OutputStreamAppender not run: LOGBACK: No context given for <MYAPPENDER> -

-
i wish write custom appender on basis of outputstreamappender . wrote following class package tests; import java.io.ioexception; import java.io.outputstream; import ch.qos.logback.core.outputstreamappender; public class myappender<e> extends outputstreamappender<e> { public myappender() { system.out.println("myappender created"); setoutputstream(new outputstream() { @override public void write(int b) throws ioexception { throw new unsupportedoperationexception(); } }); } } then wrote following runner: package tests; import org.slf4j.loggerfactory; import ch.qos.logback.classic.logger; public class runner { private static final logger log = (logger) loggerfactory.getlogger(runner.class); public static void main(string[] args) { //log.addappender(new myappender<iloggingevent>()); log.info("hello world"); } } finall...
Read more

java - UML - How would you draw a try catch in a sequence diagram? -

-
Image
is there standard way of drawing try catch sequence diagrams? i've made attempt based on this feel end result doesn't feel right. code diagram based around: public static void save () { try { filehandle filehandle = gdx.files.external(file); filehandle.writestring(boolean.tostring(constantshandler.soundenabled)+"\n", false); (int = 0; < 5; i++) { filehandle.writestring(integer.tostring(constantshandler.highscores[i])+"\n", true); } } catch (throwable e) { } } my attempt note: know still need add loop. that's ok. fragments meant show conditional control flow in sequence diagram. superstructures puts limitations on use of fragments (see pp. 467 of ss2.1.1). should use critical region try part above. , option catch . however, keep telling can take quite freedom in using uml. it's language , such changes in life time. long reader ge...
Read more

c++ - No viable overloaded operator for references a map -

-
i trying use map can make tag names reference number. when try , use it, in code error (6 in total every time reference map): src/main.cpp:25:45: error: no viable overloaded operator[] type 'std::map<std::string, std::string>' const char* idcs = node.child_value(tagmap[3]); this code: #include "pugi/pugixml.hpp" #include <iostream> #include <string> #include <map> int main() { pugi::xml_document doca, docb; std::map<std::string, pugi::xml_node> mapa, mapb; std::map<std::string, std::string> tagmap {{"1", "data"}, {"2", "entry"}, {"3", "id"}, {"4", "content"}}; if (!doca.load_file("a.xml") || !docb.load_file("b.xml")) { std::cout << "can't find input files"; return 1; } (auto& node: doca.child(tagmap[1]).children(tagmap[2])) { co...
Read more