{-# language DeriveDataTypeable #-}
{-# LANGUAGE FlexibleContexts #-}
{-# language BangPatterns #-}
{-# options_ghc -Wno-unused-imports #-}
{-# options_ghc -Wno-unused-top-binds #-}
module Data.RPTree.Conduit
  (tree,
  forest
  -- ** helpers
  , dataSource
  , liftC
  )
where

import Control.Monad (replicateM)
import Data.Functor (void)
import GHC.Word (Word64)

-- conduit
import qualified Data.Conduit as C (ConduitT, runConduit, yield, await, transPipe)
import Data.Conduit ((.|))
import qualified Data.Conduit.Combinators as C (map, mapM, last, scanl, print, foldl)
import qualified Data.Conduit.List as C (chunksOf, unfold, unfoldM, mapAccum)
-- containers
import qualified Data.IntMap.Strict as IM (IntMap, fromList, insert, lookup, map, mapWithKey, traverseWithKey, foldlWithKey, foldrWithKey, intersectionWith)
-- exceptions
import Control.Monad.Catch (MonadThrow(..))
-- mtl
import Control.Monad.State (MonadState(..), modify)
-- splitmix-distributions
import System.Random.SplitMix.Distributions (Gen, sample, GenT, sampleT, normal, stdNormal, stdUniform, exponential, bernoulli, uniformR)
-- transformers
import Control.Monad.Trans.State (StateT(..), runStateT, evalStateT, State, runState, evalState)
import Control.Monad.Trans.Class (MonadTrans(..))
-- vector
import qualified Data.Vector as V (Vector, replicateM, fromList)
import qualified Data.Vector.Generic as VG (Vector(..), unfoldrM, length, replicateM, (!), map, freeze, thaw, take, drop, unzip)
import qualified Data.Vector.Unboxed as VU (Vector, Unbox, fromList)
import qualified Data.Vector.Storable as VS (Vector)

import Data.RPTree.Gen (sparse, dense)
import Data.RPTree.Internal (RPTree(..), RPForest, RPT(..), levels, points, Inner(..), innerSD, innerSS, metricSSL2, metricSDL2, SVector(..), fromListSv, DVector(..), fromListDv, partitionAtMedian, RPTError(..))


liftC :: (Monad m, MonadTrans t) => C.ConduitT i o m r -> C.ConduitT i o (t m) r
liftC :: ConduitT i o m r -> ConduitT i o (t m) r
liftC = (forall a. m a -> t m a)
-> ConduitT i o m r -> ConduitT i o (t m) r
forall (m :: * -> *) (n :: * -> *) i o r.
Monad m =>
(forall a. m a -> n a) -> ConduitT i o m r -> ConduitT i o n r
C.transPipe forall a. m a -> t m a
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift

-- | Populate a tree from a data stream
--
-- Assumptions on the data source:
--
-- * non-empty : contains at least one value
--
-- * stationary : each chunk is representative of the whole dataset
--
-- * bounded : we wait until the end of the stream to produce a result
--
-- Throws 'EmptyResult' if the conduit is empty
tree :: (Monad m, Inner SVector v) =>
        Word64 -- ^ random seed
     -> Int -- ^ max tree depth
     -> Int -- ^ min leaf size
     -> Int -- ^ data chunk size
     -> Double -- ^ nonzero density of projection vectors
     -> Int -- ^ dimension of projection vectors
     -> C.ConduitT () (v Double) m () -- ^ data source
     -> m (RPTree Double (V.Vector (v Double)))
tree :: Word64
-> Int
-> Int
-> Int
-> Double
-> Int
-> ConduitT () (v Double) m ()
-> m (RPTree Double (Vector (v Double)))
tree Word64
seed Int
maxDepth Int
minLeaf Int
n Double
pnz Int
dim ConduitT () (v Double) m ()
src = do
  let
    rvs :: Vector (SVector Double)
rvs = Word64 -> Gen (Vector (SVector Double)) -> Vector (SVector Double)
forall a. Word64 -> Gen a -> a
sample Word64
seed (Gen (Vector (SVector Double)) -> Vector (SVector Double))
-> Gen (Vector (SVector Double)) -> Vector (SVector Double)
forall a b. (a -> b) -> a -> b
$ Int
-> GenT Identity (SVector Double) -> Gen (Vector (SVector Double))
forall (m :: * -> *) a. Monad m => Int -> m a -> m (Vector a)
V.replicateM Int
maxDepth (Double
-> Int -> GenT Identity Double -> GenT Identity (SVector Double)
forall (m :: * -> *) a.
(Monad m, Unbox a) =>
Double -> Int -> GenT m a -> GenT m (SVector a)
sparse Double
pnz Int
dim GenT Identity Double
forall (m :: * -> *). Monad m => GenT m Double
stdNormal)
  RPT Double (Vector (v Double))
t <- ConduitT () Void m (RPT Double (Vector (v Double)))
-> m (RPT Double (Vector (v Double)))
forall (m :: * -> *) r. Monad m => ConduitT () Void m r -> m r
C.runConduit (ConduitT () Void m (RPT Double (Vector (v Double)))
 -> m (RPT Double (Vector (v Double))))
-> ConduitT () Void m (RPT Double (Vector (v Double)))
-> m (RPT Double (Vector (v Double)))
forall a b. (a -> b) -> a -> b
$ ConduitT () (v Double) m ()
src ConduitT () (v Double) m ()
-> ConduitM (v Double) Void m (RPT Double (Vector (v Double)))
-> ConduitT () Void m (RPT Double (Vector (v Double)))
forall (m :: * -> *) a b c r.
Monad m =>
ConduitM a b m () -> ConduitM b c m r -> ConduitM a c m r
.|
                      Int
-> Int
-> Int
-> Vector (SVector Double)
-> ConduitM (v Double) Void m (RPT Double (Vector (v Double)))
forall (m :: * -> *) (u :: * -> *) (v :: * -> *) d o.
(Monad m, Inner u v, Ord d, Unbox d, Fractional d) =>
Int
-> Int
-> Int
-> Vector (u d)
-> ConduitT (v d) o m (RPT d (Vector (v d)))
insertC Int
maxDepth Int
minLeaf Int
n Vector (SVector Double)
rvs
  RPTree Double (Vector (v Double))
-> m (RPTree Double (Vector (v Double)))
forall (f :: * -> *) a. Applicative f => a -> f a
pure (RPTree Double (Vector (v Double))
 -> m (RPTree Double (Vector (v Double))))
-> RPTree Double (Vector (v Double))
-> m (RPTree Double (Vector (v Double)))
forall a b. (a -> b) -> a -> b
$ Vector (SVector Double)
-> RPT Double (Vector (v Double))
-> RPTree Double (Vector (v Double))
forall d a. Vector (SVector d) -> RPT d a -> RPTree d a
RPTree Vector (SVector Double)
rvs RPT Double (Vector (v Double))
t





-- | Incrementally build a tree
insertC :: (Monad m, Inner u v, Ord d, VU.Unbox d, Fractional d) =>
           Int -- ^ max tree depth
        -> Int -- ^ min leaf size
        -> Int -- ^ data chunk size
        -> V.Vector (u d) -- ^ random projection vectors
        -> C.ConduitT (v d) o m (RPT d (V.Vector (v d))) 
insertC :: Int
-> Int
-> Int
-> Vector (u d)
-> ConduitT (v d) o m (RPT d (Vector (v d)))
insertC Int
maxDepth Int
minLeaf Int
n Vector (u d)
rvs = Int
-> RPT d (Vector (v d))
-> (RPT d (Vector (v d)) -> Vector (v d) -> RPT d (Vector (v d)))
-> ConduitT (v d) o m (RPT d (Vector (v d)))
forall (m :: * -> *) t a o.
Monad m =>
Int -> t -> (t -> Vector a -> t) -> ConduitT a o m t
chunkedAccum Int
n RPT d (Vector (v d))
forall d. RPT d (Vector (v d))
z (Int
-> Int
-> Vector (u d)
-> RPT d (Vector (v d))
-> Vector (v d)
-> RPT d (Vector (v d))
forall (v1 :: * -> *) (u :: * -> *) d (v :: * -> *).
(Vector v1 (u d), Ord d, Inner u v, Unbox d, Fractional d) =>
Int
-> Int
-> v1 (u d)
-> RPT d (Vector (v d))
-> Vector (v d)
-> RPT d (Vector (v d))
insert Int
maxDepth Int
minLeaf Vector (u d)
rvs)
  where
    z :: RPT d (Vector (v d))
z = Vector (v d) -> RPT d (Vector (v d))
forall d a. a -> RPT d a
Tip Vector (v d)
forall a. Monoid a => a
mempty



-- | Populate a forest from a data stream
--
-- Assumptions on the data source:
--
-- * non-empty : contains at least one value
--
-- * stationary : each chunk is representative of the whole dataset
--
-- * bounded : we wait until the end of the stream to produce a result
--
-- Throws 'EmptyResult' if the conduit is empty
forest :: (Monad m, Inner SVector v) =>
          Word64 -- ^ random seed
       -> Int -- ^ max tree depth
       -> Int -- ^ min leaf size
       -> Int -- ^ number of trees
       -> Int -- ^ data chunk size
       -> Double -- ^ nonzero density of projection vectors
       -> Int -- ^ dimension of projection vectors
       -> C.ConduitT () (v Double) m () -- ^ data source
       -> m (RPForest Double (V.Vector (v Double)))
forest :: Word64
-> Int
-> Int
-> Int
-> Int
-> Double
-> Int
-> ConduitT () (v Double) m ()
-> m (RPForest Double (Vector (v Double)))
forest Word64
seed Int
maxd Int
minl Int
ntrees Int
chunksize Double
pnz Int
dim ConduitT () (v Double) m ()
src = do
  let
    rvss :: IntMap (Vector (SVector Double))
rvss = Word64
-> Gen (IntMap (Vector (SVector Double)))
-> IntMap (Vector (SVector Double))
forall a. Word64 -> Gen a -> a
sample Word64
seed (Gen (IntMap (Vector (SVector Double)))
 -> IntMap (Vector (SVector Double)))
-> Gen (IntMap (Vector (SVector Double)))
-> IntMap (Vector (SVector Double))
forall a b. (a -> b) -> a -> b
$ do
      [Vector (SVector Double)]
rvs <- Int
-> Gen (Vector (SVector Double))
-> GenT Identity [Vector (SVector Double)]
forall (m :: * -> *) a. Applicative m => Int -> m a -> m [a]
replicateM Int
ntrees (Gen (Vector (SVector Double))
 -> GenT Identity [Vector (SVector Double)])
-> Gen (Vector (SVector Double))
-> GenT Identity [Vector (SVector Double)]
forall a b. (a -> b) -> a -> b
$ Int
-> GenT Identity (SVector Double) -> Gen (Vector (SVector Double))
forall (m :: * -> *) a. Monad m => Int -> m a -> m (Vector a)
V.replicateM Int
maxd (Double
-> Int -> GenT Identity Double -> GenT Identity (SVector Double)
forall (m :: * -> *) a.
(Monad m, Unbox a) =>
Double -> Int -> GenT m a -> GenT m (SVector a)
sparse Double
pnz Int
dim GenT Identity Double
forall (m :: * -> *). Monad m => GenT m Double
stdNormal)
      IntMap (Vector (SVector Double))
-> Gen (IntMap (Vector (SVector Double)))
forall (f :: * -> *) a. Applicative f => a -> f a
pure (IntMap (Vector (SVector Double))
 -> Gen (IntMap (Vector (SVector Double))))
-> IntMap (Vector (SVector Double))
-> Gen (IntMap (Vector (SVector Double)))
forall a b. (a -> b) -> a -> b
$ [(Int, Vector (SVector Double))]
-> IntMap (Vector (SVector Double))
forall a. [(Int, a)] -> IntMap a
IM.fromList ([(Int, Vector (SVector Double))]
 -> IntMap (Vector (SVector Double)))
-> [(Int, Vector (SVector Double))]
-> IntMap (Vector (SVector Double))
forall a b. (a -> b) -> a -> b
$ [Int]
-> [Vector (SVector Double)] -> [(Int, Vector (SVector Double))]
forall a b. [a] -> [b] -> [(a, b)]
zip [Int
0 .. ] [Vector (SVector Double)]
rvs
  IntMap (RPT Double (Vector (v Double)))
ts <- ConduitT () Void m (IntMap (RPT Double (Vector (v Double))))
-> m (IntMap (RPT Double (Vector (v Double))))
forall (m :: * -> *) r. Monad m => ConduitT () Void m r -> m r
C.runConduit (ConduitT () Void m (IntMap (RPT Double (Vector (v Double))))
 -> m (IntMap (RPT Double (Vector (v Double)))))
-> ConduitT () Void m (IntMap (RPT Double (Vector (v Double))))
-> m (IntMap (RPT Double (Vector (v Double))))
forall a b. (a -> b) -> a -> b
$ ConduitT () (v Double) m ()
src ConduitT () (v Double) m ()
-> ConduitM
     (v Double) Void m (IntMap (RPT Double (Vector (v Double))))
-> ConduitT () Void m (IntMap (RPT Double (Vector (v Double))))
forall (m :: * -> *) a b c r.
Monad m =>
ConduitM a b m () -> ConduitM b c m r -> ConduitM a c m r
.|
                       Int
-> Int
-> Int
-> IntMap (Vector (SVector Double))
-> ConduitM
     (v Double) Void m (IntMap (RPT Double (Vector (v Double))))
forall (m :: * -> *) d (u :: * -> *) (v :: * -> *) (v1 :: * -> *)
       o.
(Monad m, Ord d, Inner u v, Unbox d, Fractional d,
 Vector v1 (u d)) =>
Int
-> Int
-> Int
-> IntMap (v1 (u d))
-> ConduitT (v d) o m (IntMap (RPT d (Vector (v d))))
insertMultiC Int
maxd Int
minl Int
chunksize IntMap (Vector (SVector Double))
rvss
  RPForest Double (Vector (v Double))
-> m (RPForest Double (Vector (v Double)))
forall (f :: * -> *) a. Applicative f => a -> f a
pure (RPForest Double (Vector (v Double))
 -> m (RPForest Double (Vector (v Double))))
-> RPForest Double (Vector (v Double))
-> m (RPForest Double (Vector (v Double)))
forall a b. (a -> b) -> a -> b
$ (Vector (SVector Double)
 -> RPT Double (Vector (v Double))
 -> RPTree Double (Vector (v Double)))
-> IntMap (Vector (SVector Double))
-> IntMap (RPT Double (Vector (v Double)))
-> RPForest Double (Vector (v Double))
forall a b c. (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c
IM.intersectionWith Vector (SVector Double)
-> RPT Double (Vector (v Double))
-> RPTree Double (Vector (v Double))
forall d a. Vector (SVector d) -> RPT d a -> RPTree d a
RPTree IntMap (Vector (SVector Double))
rvss IntMap (RPT Double (Vector (v Double)))
ts






insertMultiC :: (Monad m, Ord d, Inner u v, VU.Unbox d, Fractional d, VG.Vector v1 (u d)) =>
                Int  -- ^ max tree depth
             -> Int -- ^ min leaf size
             -> Int -- ^ chunk size
             -> IM.IntMap (v1 (u d)) -- one entry per tree
             -> C.ConduitT
                (v d)
                o
                m
                (IM.IntMap (RPT d (V.Vector (v d))))
insertMultiC :: Int
-> Int
-> Int
-> IntMap (v1 (u d))
-> ConduitT (v d) o m (IntMap (RPT d (Vector (v d))))
insertMultiC Int
maxd Int
minl Int
n IntMap (v1 (u d))
rvss = Int
-> IntMap (RPT d (Vector (v d)))
-> (IntMap (RPT d (Vector (v d)))
    -> Vector (v d) -> IntMap (RPT d (Vector (v d))))
-> ConduitT (v d) o m (IntMap (RPT d (Vector (v d))))
forall (m :: * -> *) t a o.
Monad m =>
Int -> t -> (t -> Vector a -> t) -> ConduitT a o m t
chunkedAccum Int
n IntMap (RPT d (Vector (v d)))
forall d. IntMap (RPT d (Vector (v d)))
im0 (Int
-> Int
-> IntMap (v1 (u d))
-> IntMap (RPT d (Vector (v d)))
-> Vector (v d)
-> IntMap (RPT d (Vector (v d)))
forall d (u :: * -> *) (v :: * -> *) (v1 :: * -> *).
(Ord d, Inner u v, Unbox d, Fractional d, Vector v1 (u d)) =>
Int
-> Int
-> IntMap (v1 (u d))
-> IntMap (RPT d (Vector (v d)))
-> Vector (v d)
-> IntMap (RPT d (Vector (v d)))
insertMulti Int
maxd Int
minl IntMap (v1 (u d))
rvss)
  where
    im0 :: IntMap (RPT d (Vector (v d)))
im0 = (v1 (u d) -> RPT d (Vector (v d)))
-> IntMap (v1 (u d)) -> IntMap (RPT d (Vector (v d)))
forall a b. (a -> b) -> IntMap a -> IntMap b
IM.map (RPT d (Vector (v d)) -> v1 (u d) -> RPT d (Vector (v d))
forall a b. a -> b -> a
const RPT d (Vector (v d))
forall d. RPT d (Vector (v d))
z) IntMap (v1 (u d))
rvss
    z :: RPT d (Vector (v d))
z = Vector (v d) -> RPT d (Vector (v d))
forall d a. a -> RPT d a
Tip Vector (v d)
forall a. Monoid a => a
mempty


{-# SCC insertMulti #-}
insertMulti :: (Ord d, Inner u v, VU.Unbox d, Fractional d, VG.Vector v1 (u d)) =>
               Int
            -> Int
            -> IM.IntMap (v1 (u d)) -- ^ projection vectors
            -> IM.IntMap (RPT d (V.Vector (v d))) -- ^ accumulator of subtrees
            -> V.Vector (v d) -- ^ data chunk
            -> IM.IntMap (RPT d (V.Vector (v d)))
insertMulti :: Int
-> Int
-> IntMap (v1 (u d))
-> IntMap (RPT d (Vector (v d)))
-> Vector (v d)
-> IntMap (RPT d (Vector (v d)))
insertMulti Int
maxd Int
minl IntMap (v1 (u d))
rvss IntMap (RPT d (Vector (v d)))
tacc Vector (v d)
xs =
  ((Int -> RPT d (Vector (v d)) -> RPT d (Vector (v d)))
 -> IntMap (RPT d (Vector (v d))) -> IntMap (RPT d (Vector (v d))))
-> IntMap (RPT d (Vector (v d)))
-> (Int -> RPT d (Vector (v d)) -> RPT d (Vector (v d)))
-> IntMap (RPT d (Vector (v d)))
forall a b c. (a -> b -> c) -> b -> a -> c
flip (Int -> RPT d (Vector (v d)) -> RPT d (Vector (v d)))
-> IntMap (RPT d (Vector (v d))) -> IntMap (RPT d (Vector (v d)))
forall a b. (Int -> a -> b) -> IntMap a -> IntMap b
IM.mapWithKey IntMap (RPT d (Vector (v d)))
tacc ((Int -> RPT d (Vector (v d)) -> RPT d (Vector (v d)))
 -> IntMap (RPT d (Vector (v d))))
-> (Int -> RPT d (Vector (v d)) -> RPT d (Vector (v d)))
-> IntMap (RPT d (Vector (v d)))
forall a b. (a -> b) -> a -> b
$ \ !Int
i !RPT d (Vector (v d))
t -> case Int -> IntMap (v1 (u d)) -> Maybe (v1 (u d))
forall a. Int -> IntMap a -> Maybe a
IM.lookup Int
i IntMap (v1 (u d))
rvss of
                                      Just !v1 (u d)
rvs -> Int
-> Int
-> v1 (u d)
-> RPT d (Vector (v d))
-> Vector (v d)
-> RPT d (Vector (v d))
forall (v1 :: * -> *) (u :: * -> *) d (v :: * -> *).
(Vector v1 (u d), Ord d, Inner u v, Unbox d, Fractional d) =>
Int
-> Int
-> v1 (u d)
-> RPT d (Vector (v d))
-> Vector (v d)
-> RPT d (Vector (v d))
insert Int
maxd Int
minl v1 (u d)
rvs RPT d (Vector (v d))
t Vector (v d)
xs
                                      Maybe (v1 (u d))
_        -> RPT d (Vector (v d))
t

{-# SCC insert #-}
insert :: (VG.Vector v1 (u d), Ord d, Inner u v, VU.Unbox d, Fractional d) =>
          Int -- ^ max tree depth
       -> Int -- ^ min leaf size
       -> v1 (u d) -- ^ projection vectors
       -> RPT d (V.Vector (v d)) -- ^ accumulator
       -> V.Vector (v d) -- ^ data chunk
       -> RPT d (V.Vector (v d))
insert :: Int
-> Int
-> v1 (u d)
-> RPT d (Vector (v d))
-> Vector (v d)
-> RPT d (Vector (v d))
insert Int
maxDepth Int
minLeaf v1 (u d)
rvs = Int -> RPT d (Vector (v d)) -> Vector (v d) -> RPT d (Vector (v d))
loop Int
0
  where
    z :: RPT d (Vector (v d))
z = Vector (v d) -> RPT d (Vector (v d))
forall d a. a -> RPT d a
Tip Vector (v d)
forall a. Monoid a => a
mempty
    loop :: Int -> RPT d (Vector (v d)) -> Vector (v d) -> RPT d (Vector (v d))
loop Int
ixLev !RPT d (Vector (v d))
tt Vector (v d)
xs =
      let
        r :: u d
r = v1 (u d)
rvs v1 (u d) -> Int -> u d
forall (v :: * -> *) a. Vector v a => v a -> Int -> a
VG.! Int
ixLev
      in
        case RPT d (Vector (v d))
tt of

          b :: RPT d (Vector (v d))
b@(Bin d
thr0 Margin d
margin0 RPT d (Vector (v d))
tl0 RPT d (Vector (v d))
tr0) ->
            if Int
ixLev Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
>= Int
maxDepth Bool -> Bool -> Bool
|| Vector (v d) -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length Vector (v d)
xs Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
minLeaf
              then RPT d (Vector (v d))
b -- return current subtree
              else
                let
                  (d
thr, Margin d
margin, Vector (v d)
ll, Vector (v d)
rr) =
                    u d -> Vector (v d) -> (d, Margin d, Vector (v d), Vector (v d))
forall a (u :: * -> *) (v :: * -> *).
(Ord a, Inner u v, Unbox a, Fractional a) =>
u a -> Vector (v a) -> (a, Margin a, Vector (v a), Vector (v a))
partitionAtMedian u d
r Vector (v d)
xs
                  margin' :: Margin d
margin' = Margin d
margin0 Margin d -> Margin d -> Margin d
forall a. Semigroup a => a -> a -> a
<> Margin d
margin
                  thr' :: d
thr' = (d
thr0 d -> d -> d
forall a. Num a => a -> a -> a
+ d
thr) d -> d -> d
forall a. Fractional a => a -> a -> a
/ d
2
                  tl :: RPT d (Vector (v d))
tl = Int -> RPT d (Vector (v d)) -> Vector (v d) -> RPT d (Vector (v d))
loop (Int
ixLev Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) RPT d (Vector (v d))
tl0 Vector (v d)
ll
                  tr :: RPT d (Vector (v d))
tr = Int -> RPT d (Vector (v d)) -> Vector (v d) -> RPT d (Vector (v d))
loop (Int
ixLev Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) RPT d (Vector (v d))
tr0 Vector (v d)
rr
                in d
-> Margin d
-> RPT d (Vector (v d))
-> RPT d (Vector (v d))
-> RPT d (Vector (v d))
forall d a. d -> Margin d -> RPT d a -> RPT d a -> RPT d a
Bin d
thr' Margin d
margin' RPT d (Vector (v d))
tl RPT d (Vector (v d))
tr

          Tip Vector (v d)
xs0 -> do
            let xs' :: Vector (v d)
xs' = Vector (v d)
xs Vector (v d) -> Vector (v d) -> Vector (v d)
forall a. Semigroup a => a -> a -> a
<> Vector (v d)
xs0
            if Int
ixLev Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
>= Int
maxDepth Bool -> Bool -> Bool
|| Vector (v d) -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length Vector (v d)
xs Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
minLeaf
              then Vector (v d) -> RPT d (Vector (v d))
forall d a. a -> RPT d a
Tip Vector (v d)
xs' -- concat data in leaf
              else
                let
                  (d
thr, Margin d
margin, Vector (v d)
ll, Vector (v d)
rr) = u d -> Vector (v d) -> (d, Margin d, Vector (v d), Vector (v d))
forall a (u :: * -> *) (v :: * -> *).
(Ord a, Inner u v, Unbox a, Fractional a) =>
u a -> Vector (v a) -> (a, Margin a, Vector (v a), Vector (v a))
partitionAtMedian u d
r Vector (v d)
xs'
                  tl :: RPT d (Vector (v d))
tl = Int -> RPT d (Vector (v d)) -> Vector (v d) -> RPT d (Vector (v d))
loop (Int
ixLev Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) RPT d (Vector (v d))
forall d. RPT d (Vector (v d))
z Vector (v d)
ll
                  tr :: RPT d (Vector (v d))
tr = Int -> RPT d (Vector (v d)) -> Vector (v d) -> RPT d (Vector (v d))
loop (Int
ixLev Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) RPT d (Vector (v d))
forall d. RPT d (Vector (v d))
z Vector (v d)
rr
                in d
-> Margin d
-> RPT d (Vector (v d))
-> RPT d (Vector (v d))
-> RPT d (Vector (v d))
forall d a. d -> Margin d -> RPT d a -> RPT d a -> RPT d a
Bin d
thr Margin d
margin RPT d (Vector (v d))
tl RPT d (Vector (v d))
tr


-- | Aggregate the input stream in chunks of a given size (semantics of 'C.chunksOf'), and fold over the resulting stream building up an accumulator structure (e.g. a tree)
chunkedAccum :: (Monad m) =>
                Int -- ^ chunk size
             -> t -- ^ initial accumulator state
             -> (t -> V.Vector a -> t)
             -> C.ConduitT a o m t
chunkedAccum :: Int -> t -> (t -> Vector a -> t) -> ConduitT a o m t
chunkedAccum Int
n t
z t -> Vector a -> t
f = Int -> ConduitT a [a] m ()
forall (m :: * -> *) a. Monad m => Int -> ConduitT a [a] m ()
C.chunksOf Int
n ConduitT a [a] m () -> ConduitM [a] o m t -> ConduitT a o m t
forall (m :: * -> *) a b c r.
Monad m =>
ConduitM a b m () -> ConduitM b c m r -> ConduitM a c m r
.|
                     ([a] -> Vector a) -> ConduitT [a] (Vector a) m ()
forall (m :: * -> *) a b. Monad m => (a -> b) -> ConduitT a b m ()
C.map [a] -> Vector a
forall a. [a] -> Vector a
V.fromList ConduitT [a] (Vector a) m ()
-> ConduitM (Vector a) o m t -> ConduitM [a] o m t
forall (m :: * -> *) a b c r.
Monad m =>
ConduitM a b m () -> ConduitM b c m r -> ConduitM a c m r
.|
                     (t -> Vector a -> t) -> t -> ConduitM (Vector a) o m t
forall (m :: * -> *) a b o.
Monad m =>
(a -> b -> a) -> a -> ConduitT b o m a
C.foldl t -> Vector a -> t
f t
z

-- | Source of random data points
dataSource :: (Monad m) =>
              Int -- ^ number of vectors to generate
           -> GenT m a -- ^ random generator for the vector components
           -> C.ConduitT i a (GenT m) ()
dataSource :: Int -> GenT m a -> ConduitT i a (GenT m) ()
dataSource Int
n GenT m a
gg = ((Int -> GenT m (Maybe (a, Int)))
 -> Int -> ConduitT i a (GenT m) ())
-> Int
-> (Int -> GenT m (Maybe (a, Int)))
-> ConduitT i a (GenT m) ()
forall a b c. (a -> b -> c) -> b -> a -> c
flip (Int -> GenT m (Maybe (a, Int))) -> Int -> ConduitT i a (GenT m) ()
forall (m :: * -> *) b a i.
Monad m =>
(b -> m (Maybe (a, b))) -> b -> ConduitT i a m ()
C.unfoldM Int
0 ((Int -> GenT m (Maybe (a, Int))) -> ConduitT i a (GenT m) ())
-> (Int -> GenT m (Maybe (a, Int))) -> ConduitT i a (GenT m) ()
forall a b. (a -> b) -> a -> b
$ \Int
i -> do
  if Int
i Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
n
    then Maybe (a, Int) -> GenT m (Maybe (a, Int))
forall (f :: * -> *) a. Applicative f => a -> f a
pure Maybe (a, Int)
forall a. Maybe a
Nothing
    else do
      a
x <- GenT m a
gg
      Maybe (a, Int) -> GenT m (Maybe (a, Int))
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Maybe (a, Int) -> GenT m (Maybe (a, Int)))
-> Maybe (a, Int) -> GenT m (Maybe (a, Int))
forall a b. (a -> b) -> a -> b
$ (a, Int) -> Maybe (a, Int)
forall a. a -> Maybe a
Just (a
x, Int
i Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1)




-- -- sinks

-- tree' :: (Monad m, Inner SVector v) =>
--         Word64 -- ^ random seed
--      -> Int -- ^ max tree depth
--      -> Int -- ^ min leaf size
--      -> Int -- ^ data chunk size
--      -> Double -- ^ nonzero density of projection vectors
--      -> Int -- ^ dimension of projection vectors
--       -> C.ConduitT (v Double) o m (RPTree Double (V.Vector (v Double)))
-- tree' seed maxDepth minLeaf n pnz dim = do
--   let
--     rvs = sample seed $ V.replicateM maxDepth (sparse pnz dim stdNormal)
--   t <- insertC maxDepth minLeaf n rvs
--   pure $ RPTree rvs t

-- forest' :: (Monad m, Inner SVector v) =>
--            Word64 -- ^ random seed
--         -> Int -- ^ max tree depth
--         -> Int -- ^ min leaf size
--         -> Int -- ^ number of trees
--         -> Int -- ^ data chunk size
--         -> Double -- ^ nonzero density of projection vectors
--         -> Int -- ^ dimension of projection vectors
--         -> C.ConduitT (v Double) o m (IM.IntMap (RPTree Double (V.Vector (v Double))))
-- forest' seed maxd minl ntrees chunksize pnz dim = do
--   let
--     rvss = sample seed $ do
--       rvs <- replicateM ntrees $ V.replicateM maxd (sparse pnz dim stdNormal)
--       pure $ IM.fromList $ zip [0 .. ] rvs
--   ts <- insertMultiC maxd minl chunksize rvss
--   pure $ IM.intersectionWith RPTree rvss ts