Maintainer | Toshio Ito <debug.ito@gmail.com> |
---|---|
Safe Haskell | None |
Language | Haskell2010 |
Synopsis
- data Query n na fla sla
- defQuery :: (Eq n, Show n) => [n] -> Query n na fla fla
- startsFrom :: Query n na fla sla -> [n]
- unifyLinkSamples :: Query n na fla sla -> LinkSampleUnifier n na fla sla
- timeInterval :: Query n na fla sla -> Interval Timestamp
- foundNodePolicy :: Query n na fla sla -> FoundNodePolicy n na
- data FoundNodePolicy n na
- policyOverwrite :: FoundNodePolicy n na
- policyAppend :: FoundNodePolicy n na
- secUpTo :: Int64 -> Timestamp -> Interval Timestamp
- data Interval r
- (<=..<=) :: Ord r => Extended r -> Extended r -> Interval r
- (<..<=) :: Ord r => Extended r -> Extended r -> Interval r
- (<=..<) :: Ord r => Extended r -> Extended r -> Interval r
- (<..<) :: Ord r => Extended r -> Extended r -> Interval r
- data Extended r
Query
data Query n na fla sla Source #
Query for snapshot graph. You can get the default Query
by
defQuery
function, and customize its fields by the accessor
functions.
- Type
n
: node ID - Type
na
: node attributes - Type
fla
: attributes of found links. - Type
sla
: attributes of snapshot links. Converted fromfla
byunifyLinkSamples
.
accessor functions
startsFrom :: Query n na fla sla -> [n] Source #
Nodes from which the Spider starts traversing the history graph.
unifyLinkSamples :: Query n na fla sla -> LinkSampleUnifier n na fla sla Source #
See the document of LinkSampleUnifier
.
Default: unifyToOne
.
timeInterval :: Query n na fla sla -> Interval Timestamp Source #
Time interval to query. Only the local findings observed during this interval are used to make the snapshot graph.
Default: (-infinity, +infinity)
Since: 0.2.0.0
foundNodePolicy :: Query n na fla sla -> FoundNodePolicy n na Source #
FoundNodePolicy
data FoundNodePolicy n na Source #
Policy to treat FoundNode
s (local findings) when the spider
creates the snapshot graph.
Eq
instance was added in version 0.3.2.0
Since: 0.2.0.0
Instances
Eq (FoundNodePolicy n na) Source # | |
Defined in NetSpider.Query.Internal (==) :: FoundNodePolicy n na -> FoundNodePolicy n na -> Bool # (/=) :: FoundNodePolicy n na -> FoundNodePolicy n na -> Bool # | |
Show (FoundNodePolicy n na) Source # | |
Defined in NetSpider.Query.Internal showsPrec :: Int -> FoundNodePolicy n na -> ShowS # show :: FoundNodePolicy n na -> String # showList :: [FoundNodePolicy n na] -> ShowS # |
policyOverwrite :: FoundNodePolicy n na Source #
A FoundNode
always overwrites old FoundNode
s, so only the
latest one is valid.
This policy is appropriate when you can always get the complete neighbor information of a given node at once.
Since: 0.2.0.0
policyAppend :: FoundNodePolicy n na Source #
A FoundNode
appends neighbor information to old
FoundNode
s. When the spider makes the snapshot graph, it
aggregates all FoundNode
s in the query range.
This policy is appropriate when you can only get part of neighbor information of a given node at once.
Since: 0.2.0.0
Utilities
secUpTo :: Int64 -> Timestamp -> Interval Timestamp Source #
s
returns the time interval of length secUpTo
tss
(in
seconds) and up to ts
. The interval is inclusive for both ends.
Since: 0.2.0.0
Re-exports
The intervals (i.e. connected and convex subsets) over real numbers R.
Instances
Eq r => Eq (Interval r) | |
(Ord r, Data r) => Data (Interval r) | |
Defined in Data.Interval.Internal gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Interval r -> c (Interval r) # gunfold :: (forall b r0. Data b => c (b -> r0) -> c r0) -> (forall r1. r1 -> c r1) -> Constr -> c (Interval r) # toConstr :: Interval r -> Constr # dataTypeOf :: Interval r -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Interval r)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Interval r)) # gmapT :: (forall b. Data b => b -> b) -> Interval r -> Interval r # gmapQl :: (r0 -> r' -> r0) -> r0 -> (forall d. Data d => d -> r') -> Interval r -> r0 # gmapQr :: (r' -> r0 -> r0) -> r0 -> (forall d. Data d => d -> r') -> Interval r -> r0 # gmapQ :: (forall d. Data d => d -> u) -> Interval r -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Interval r -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Interval r -> m (Interval r) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Interval r -> m (Interval r) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Interval r -> m (Interval r) # | |
Hashable r => Hashable (Interval r) | |
Defined in Data.Interval.Internal | |
NFData r => NFData (Interval r) | |
Defined in Data.Interval.Internal |
closed interval [l
,u
]
left-open right-closed interval (l
,u
]
left-closed right-open interval [l
, u
)
open interval (l
, u
)
Extended r
is an extension of r with positive/negative infinity (±∞).
Instances
Functor Extended | |
Bounded (Extended r) | |
Eq r => Eq (Extended r) | |
(Fractional r, Ord r) => Fractional (Extended r) | Note that |
Data r => Data (Extended r) | |
Defined in Data.ExtendedReal gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Extended r -> c (Extended r) # gunfold :: (forall b r0. Data b => c (b -> r0) -> c r0) -> (forall r1. r1 -> c r1) -> Constr -> c (Extended r) # toConstr :: Extended r -> Constr # dataTypeOf :: Extended r -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Extended r)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Extended r)) # gmapT :: (forall b. Data b => b -> b) -> Extended r -> Extended r # gmapQl :: (r0 -> r' -> r0) -> r0 -> (forall d. Data d => d -> r') -> Extended r -> r0 # gmapQr :: (r' -> r0 -> r0) -> r0 -> (forall d. Data d => d -> r') -> Extended r -> r0 # gmapQ :: (forall d. Data d => d -> u) -> Extended r -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Extended r -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Extended r -> m (Extended r) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Extended r -> m (Extended r) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Extended r -> m (Extended r) # | |
(Num r, Ord r) => Num (Extended r) | Note that
|
Defined in Data.ExtendedReal | |
Ord r => Ord (Extended r) | |
Read r => Read (Extended r) | |
Show r => Show (Extended r) | |
Hashable r => Hashable (Extended r) | |
Defined in Data.ExtendedReal | |
NFData r => NFData (Extended r) | |
Defined in Data.ExtendedReal |