Question: webpack then?

Asked By
safhac
Asked At
2018-04-03 14:02:11

Found 15 possible answers.

User Answered At Possible Answer
norpan 2018-04-03 14:09:07 Well, I’m not sure what automatic 404 routing would mean
safhac 2018-04-03 14:14:37 you can run WP dev server supressing auto routing i mean starting the app with routes other than index.html
jessta 2018-04-03 14:16:49 That's not exactly 'supressing' auto routing, but actually enabling auto routing of all routes to index.html
sporto 2018-04-03 22:35:25 I don't think is possible with Elm Reactor Have a look at https://github.com/architectcodes/elm-live that does this
gampleman 2018-04-04 08:36:47 I’m reading and trying to implement this paper: http://cglab.ca/%7Ebiniaz/papers/Sweep%20Circle.pdf For some context: the algorithm walks the triangles first in one direction but then walks them back in the opposite direction later I’m struggling to figure out how once can have a datastructure in elm that supports O(1) access to neighboring triangles. Any ideas? > The frontier can be implemented by any range searching data structure such as a heap, or balanced binary search trees (e.g. AVL tree, B-tree, Read-Black tree [13]). In our case, a simple hash-table on a circular double linked list is used. It says:> The frontier data structure must support O(1) time access to a triangle from a neighboring triangle. Almost all commonly used data structures storing planar triangulations support this operation: DCEL (Doubly Connected Edge List) or simply a linked list of triangles with all the necessary local information (three vertices, three edges, and three pointers pointing to its neighboring triangles). […]
ilias 2018-04-04 08:41:18 If you have an Array.Hamt and store the indices of the "neighbours", you get O(log32 n) which is effectively constant time
gampleman 2018-04-04 08:59:31 Also, is elm-community int-dict still faster than the regular dict? Which also seems to be missing For using array for this though, I would really need a good insert/splice function
norpan 2018-04-04 11:08:34 If you have a zipper you have constant access to neighbors @gampleman it does sound like a zipper would do nicely But then you only have access to one element at a time
gampleman 2018-04-04 11:14:31 That might be a good shout
sturgman 2018-04-04 11:15:36 Zipper?
gampleman 2018-04-04 11:15:52 Is there a particularly good one?
norpan 2018-04-04 11:17:28 If you want one that supports splicing I’m not sure
gampleman 2018-04-04 11:17:37 Actually might have to make my own
norpan 2018-04-04 11:18:26 Actually, http://package.elm-lang.org/packages/yotamDvir/elm-pivot/2.0.0/Pivot seems to have that too lots of functions :slightly_smiling_face:
gampleman 2018-04-04 11:24:02 Although the naming convention they use is … odd Thinking about it, since the neighborhood is circular, a zipper won’t have constant time access either (although if the “edges” are accessed with uniform probability, it should amortize nicely)

Related Questions