Skip to content

Latest commit

 

History

History
48 lines (45 loc) · 2.65 KB

TODO.md

File metadata and controls

48 lines (45 loc) · 2.65 KB
Raw

Build

  • 0.7.0 works but not above... C:\Users\toshiba\WebstormProjects\state-transducer\node_modules \graph-adt\src\index.js: Property name expected type of string but got null
    • because I use generators??? ! change build for run build, 'babel' is not recognized as an internal or external command,..

Exotic searches

  • store : empty, add, takeAndRemoveOne, isEmpty
  • searches for path which satisfy a given content-based predicate
    • who have a given prefix
    • who have a given set of prefixes
  • searches with order following some rules (instead of picking the first one in store)
    • random picking (following a given distribution law)
    • specifying distribution law may require extra configuration, at store creation time, or included inside the vertex or edge (rather avoid for user-friendly API reason?)...
  • searches which exclude some paths
    • may require modifying isEmpty

Searches for path which satisfy a given content-based predicate

  • empty : could change depending on the container we choose
    • array
    • prefix tree, radix tree etc
  • add : only add those paths who satisfy a given predicate
    • filter :: Predicate -> Array -> Array (look it up in hoogle - curiosity)
    • add :: Array -> Store -> Store
  • takeAndRemoveOne : picking strategy ( :: Store

    -> {popped, newStore: Store

    } )

    • be careful that elements who will never be picked have to be removed, so empty works as intended
      • that should be already taken care of by add?
      • but edge case if we have distribution law with 0% probability!!
      • in that case we need a remove function too, or a filter function!! forbid 0% prob? or modify empty? tha would break law m + empty = m! modify add! so add membership policy to store
    • random(distribution law)
      • but distribution law based on what? length of paths? index of path in store? content of path?
      • for instance favor error paths? loops? control state?
        • requires a function to assign paths into categories and picking strategies between category, then within a category yet another picking strategy...
        • NO!! leave that to the picking function interface
      • any random picking strategy will require random generator
    • so interface is necessary
      • random generator<MIN, MAX> :: () -> RandomNumber between MIN and MAX
      • picking function :: RandomNumber -> Array -> Path
        • but actually does not have to be an array, could be a prefix tree, or any monoidal traversable container:
        • :: RandomNumber -> Store -> Path

refactor

as graph -> store iteration -> transducer -> output aggregation? in which case there may no longer be a need for generator!!