extracted from stones

bower.json

@@ -0,0 +1,34 @@
+{
+  "name": "purescript-pray",
+  "version": "0.0.1",
+  "homepage": "https://github.com/cryogenian/purescript-pray",
+  "authors": [
+    "Maxim Zimaliev <zimaliev@gmail.com>"
+  ],
+  "description": "reactjs purescript binding prototype",
+  "keywords": [
+    "purescript",
+    "reactjs",
+    "dsl"
+  ],
+  "license": "MIT",
+  "ignore": [
+    "**/.*",
+    "node_modules",
+    "bower_components",
+    "test",
+    "tests"
+  ],
+  "dependencies": {
+    "purescript-datetime": "~0.1.2",
+    "purescript-arrays": "~0.3.0",
+    "purescript-transformers": "~0.3.2",
+    "purescript-exists": "~0.1.0",
+    "purescript-dom": "~0.1.1",
+    "purescript-free": "~0.1.6"
+  },
+  "devDependencies": {
+    "purescript-tuples": "~0.2.3",
+    "purescript-maybe": "~0.2.1"
+  }
+}

bower_components/purescript-arrays/.bower.json

@@ -0,0 +1,34 @@
+{
+  "name": "purescript-arrays",
+  "homepage": "https://github.com/purescript/purescript-arrays",
+  "description": "Array utility functions",
+  "keywords": [
+    "purescript"
+  ],
+  "license": "MIT",
+  "ignore": [
+    "**/.*",
+    "bower_components",
+    "node_modules",
+    "output",
+    "tests",
+    "tmp",
+    "bower.json",
+    "Gruntfile.js",
+    "package.json"
+  ],
+  "dependencies": {
+    "purescript-maybe": "~0.2.0",
+    "purescript-control": "~0.2.0"
+  },
+  "version": "0.3.0",
+  "_release": "0.3.0",
+  "_resolution": {
+    "type": "version",
+    "tag": "v0.3.0",
+    "commit": "0e73b8d778e568ea98ac38f48eec643ac5279465"
+  },
+  "_source": "git://github.com/purescript/purescript-arrays.git",
+  "_target": "~0.3.0",
+  "_originalSource": "purescript-arrays"
+}

bower_components/purescript-arrays/LICENSE

@@ -0,0 +1,20 @@
+The MIT License (MIT)
+
+Copyright (c) 2014 PureScript
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

bower_components/purescript-arrays/README.md

@@ -0,0 +1,145 @@
+# Module Documentation
+
+## Module Data.Array
+
+### Type Class Instances
+
+    instance altArray :: Alt Prim.Array
+
+    instance alternativeArray :: Alternative Prim.Array
+
+    instance applicativeArray :: Applicative Prim.Array
+
+    instance applyArray :: Apply Prim.Array
+
+    instance bindArray :: Bind Prim.Array
+
+    instance functorArray :: Functor Prim.Array
+
+    instance monadArray :: Monad Prim.Array
+
+    instance monadPlusArray :: MonadPlus Prim.Array
+
+    instance plusArray :: Plus Prim.Array
+
+    instance semigroupArray :: Semigroup [a]
+
+
+### Values
+
+    (!!) :: forall a. [a] -> Number -> Maybe a
+
+    (..) :: Number -> Number -> [Number]
+
+    (\\) :: forall a. (Eq a) => [a] -> [a] -> [a]
+
+    append :: forall a. [a] -> [a] -> [a]
+
+    catMaybes :: forall a. [Maybe a] -> [a]
+
+    concat :: forall a. [[a]] -> [a]
+
+    concatMap :: forall a b. (a -> [b]) -> [a] -> [b]
+
+    delete :: forall a. (Eq a) => a -> [a] -> [a]
+
+    deleteAt :: forall a. Number -> Number -> [a] -> [a]
+
+    deleteBy :: forall a. (a -> a -> Boolean) -> a -> [a] -> [a]
+
+    drop :: forall a. Number -> [a] -> [a]
+
+    elemIndex :: forall a. (Eq a) => a -> [a] -> Number
+
+    elemLastIndex :: forall a. (Eq a) => a -> [a] -> Number
+
+    filter :: forall a. (a -> Boolean) -> [a] -> [a]
+
+    findIndex :: forall a. (a -> Boolean) -> [a] -> Number
+
+    findLastIndex :: forall a. (a -> Boolean) -> [a] -> Number
+
+    group :: forall a. (Eq a) => [a] -> [[a]]
+
+    group' :: forall a. (Ord a) => [a] -> [[a]]
+
+    groupBy :: forall a. (a -> a -> Boolean) -> [a] -> [[a]]
+
+    head :: forall a. [a] -> Maybe a
+
+    init :: forall a. [a] -> Maybe [a]
+
+    insertAt :: forall a. Number -> a -> [a] -> [a]
+
+    intersect :: forall a. (Eq a) => [a] -> [a] -> [a]
+
+    intersectBy :: forall a. (a -> a -> Boolean) -> [a] -> [a] -> [a]
+
+    last :: forall a. [a] -> Maybe a
+
+    length :: forall a. [a] -> Number
+
+    map :: forall a b. (a -> b) -> [a] -> [b]
+
+    mapMaybe :: forall a b. (a -> Maybe b) -> [a] -> [b]
+
+    nub :: forall a. (Eq a) => [a] -> [a]
+
+    nubBy :: forall a. (a -> a -> Boolean) -> [a] -> [a]
+
+    null :: forall a. [a] -> Boolean
+
+    range :: Number -> Number -> [Number]
+
+    reverse :: forall a. [a] -> [a]
+
+    singleton :: forall a. a -> [a]
+
+    snoc :: forall a. [a] -> a -> [a]
+
+    sort :: forall a. (Ord a) => [a] -> [a]
+
+    sortBy :: forall a. (a -> a -> Ordering) -> [a] -> [a]
+
+    span :: forall a. (a -> Boolean) -> [a] -> { rest :: [a], init :: [a] }
+
+    tail :: forall a. [a] -> Maybe [a]
+
+    take :: forall a. Number -> [a] -> [a]
+
+    updateAt :: forall a. Number -> a -> [a] -> [a]
+
+    zipWith :: forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]
+
+
+## Module Data.Array.ST
+
+### Types
+
+    data STArray :: * -> * -> *
+
+
+### Values
+
+    emptySTArray :: forall a h r. Eff (st :: ST h | r) (STArray h a)
+
+    peekSTArray :: forall a h r. STArray h a -> Number -> Eff (st :: ST h | r) (Maybe a)
+
+    pokeSTArray :: forall a h r. STArray h a -> Number -> a -> Eff (st :: ST h | r) Boolean
+
+    pushSTArray :: forall a h r. STArray h a -> a -> Eff (st :: ST h | r) Unit
+
+    runSTArray :: forall a r. (forall h. Eff (st :: ST h | r) (STArray h a)) -> Eff r [a]
+
+
+## Module Data.Array.Unsafe
+
+### Values
+
+    head :: forall a. [a] -> a
+
+    init :: forall a. [a] -> [a]
+
+    last :: forall a. [a] -> a
+
+    tail :: forall a. [a] -> [a]