BlockS

Type Members

trait FieldOps extends AnyRef

Definition Classes
FieldUtils
case class Gradient(algorithm: (Boolean, () ⇒ Double) ⇒ Double, source: Boolean = false, metric: (StdLib_Gradients.this)#Metric = nbrRange) extends Product with Serializable

Definition Classes
Gradients

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def BisGradient(commRadius: Double = 0.2, lagMetric: ⇒ Double = nbrLag().toMillis): (BlockS.this)#Gradient

Definition Classes
Gradients
val ClassicGradient: (BlockS.this)#Gradient

Definition Classes
Gradients
val ClassicHopGradient: (BlockS.this)#Gradient

Definition Classes
Gradients
def CrfGradient(raisingSpeed: Double = 5, lagMetric: ⇒ Double = nbrLag().toMillis): (BlockS.this)#Gradient

Definition Classes
Gradients
def FlexGradient(epsilon: Double = 0.5, delta: Double = 1.0, communicationRadius: Double = 1.0): (BlockS.this)#Gradient

Definition Classes
Gradients
def G[V](source: Boolean, field: V, acc: (V) ⇒ V, metric: () ⇒ Double): V

Definition Classes
BlockG
def Gcurried[V](source: Boolean)(field: V)(acc: (V) ⇒ V)(metric: (StdLib_BlockS.this)#Metric = nbrRange): V

Curried version of G
Curried version of G

Definition Classes
BlockG
def S(grain: Double, metric: (StdLib_BlockS.this)#Metric): Boolean
def S2(grain: Double): Boolean
def SvdGradient(lagMetric: ⇒ Double = nbrLag().toMillis): (BlockS.this)#Gradient

Definition Classes
Gradients
def UltGradient(radius: Double = 0.2, factor: Double = 0.1): (BlockS.this)#Gradient

Definition Classes
Gradients
final def asInstanceOf[T0]: T0

Definition Classes
Any
def bisGradient(commRadius: Double = 0.2, lagMetric: ⇒ Double = nbrLag().toMillis)(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

Definition Classes
Gradients
def breakUsingUids(uid: (Double, (StdLib_BlockS.this)#ID), grain: Double, metric: (StdLib_BlockS.this)#Metric): Boolean

Breaks simmetry using UIDs.
Breaks simmetry using UIDs. UIDs are used to break symmetry by a competition between devices for leadership.
def broadcast[V](source: Boolean, field: V, metric: (StdLib_BlockS.this)#Metric = nbrRange): V

Broadcast information outward from a source field.
Broadcast information outward from a source field.
V
Type of the value to be broadcast
source
The source of the broadcast
field
Field denoting (1) at the source, the value to be broadcast; and (2) in other places, the default value of the broadcast field.
metric
Metric that parameterises the gradient-based construction of the the propagation structure
returns
A broadcast field.

Definition Classes
BlockG
def captureChange[T](x: T, initially: Boolean = true): Boolean

returns
true only when a discontinuity (i.e., a change) is observed on x (you may choose how to handle the first observation)

Definition Classes
StateManagement
def channel(source: Boolean, target: Boolean, width: Double): Boolean

A channel from a source to a target with width width.
A channel from a source to a target with width width. A channel is a boolean field which is true in correspondence of the device positioned along the minimum path from source to target.

Definition Classes
BlockG
def classicGradient(source: Boolean, metric: () ⇒ Double = nbrRange): Double

Definition Classes
Gradients
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
def constant[T](value: ⇒ T): T

Alias for remember()
Alias for remember()

Definition Classes
StateManagement
def countChanges[T](x: T, initially: Boolean = true): (Long, Boolean)

Definition Classes
StateManagement
def crfGradient(raisingSpeed: Double = 5, lagMetric: ⇒ Double = nbrLag().toMillis)(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

Definition Classes
Gradients
def delay[T](value: T): T

It is a simple building block which returns the same values it receives in input delayed by one computation round.
It is a simple building block which returns the same values it receives in input delayed by one computation round.

Definition Classes
StateManagement
def distanceBetween(source: Boolean, target: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

Distance between source to target based on metric
Distance between source to target based on metric

Definition Classes
BlockG
def distanceCompetition(d: Double, lead: (Double, (StdLib_BlockS.this)#ID), uid: (Double, (StdLib_BlockS.this)#ID), grain: Double, metric: (StdLib_BlockS.this)#Metric): (Double, (StdLib_BlockS.this)#ID)

Candidate leader devices surrender leadership to the lowest nearby UID.
def distanceTo(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

A field of distance (i.e., a gradient) from a source, based on a given metric
A field of distance (i.e., a gradient) from a source, based on a given metric

Definition Classes
BlockG
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
object excludingSelf extends (FieldUtils.this)#FieldOps

Definition Classes
FieldUtils
def flexGradient(epsilon: Double = 0.5, delta: Double = 1.0, communicationRadius: Double = 1.0)(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

Idea: a device should change its estimate only for significant errors.
Idea: a device should change its estimate only for significant errors. Useful when devices far from the source need only coarse estimates. Flex gradient provides tunable trade-off between precision and communication cost.
epsilon
Parameter expressing tolerance wrt changes
delta
Distortion into the distance measure, such that neighbor distance is never considered to be less than delta * communicationRadius.
source
Source fields of devices from which the gradient is calculated

Definition Classes
Gradients
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def goesDown(value: Boolean): Boolean

returns
true when the given parameter goes from true to false (starting from false); false otherwise

Definition Classes
StateManagement
def goesUp(value: Boolean): Boolean

returns
true when the given parameter goes from false to true (starting from false); false otherwise

Definition Classes
StateManagement
def hashCode(): Int

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def hopDistance(source: Boolean): Double

Hop distance
Hop distance

Definition Classes
BlockG
def hopGradient(source: Boolean): Double

Definition Classes
Gradients
object includingSelf extends (FieldUtils.this)#FieldOps

Definition Classes
FieldUtils
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def keep(expr: ⇒ Boolean): Boolean

Remembers the occurrence of some condition or event
Remembers the occurrence of some condition or event

Definition Classes
StateManagement
def keep[T](expr: ⇒ Option[T]): Option[T]

Remembers the provided optional value, unless empty
Remembers the provided optional value, unless empty

Definition Classes
StateManagement
def meanCounter(value: Double, frequency: Long): Double

Definition Classes
GenericUtils
def minId(): (StdLib_BlockS.this)#ID
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
def once[T](expr: ⇒ T): Option[T]

Returns a non-empty optional with the provided value just once, then None
Returns a non-empty optional with the provided value just once, then None

Definition Classes
StateManagement
def randomUid: (Double, (StdLib_BlockS.this)#ID)

Generates a field of random unique identifiers.
Generates a field of random unique identifiers.
returns
a tuple where the first element is a random number, end the second element is the device identifier to ensure uniqueness of the field elements.
def remember[T](value: ⇒ T): T

Remembers the provided value
Remembers the provided value

Definition Classes
StateManagement
def roundCounter(): Long

Counts the number of rounds, refreshing each time the computation is re-entered.
Counts the number of rounds, refreshing each time the computation is re-entered. TODO: consider boundedness as a limitation for long-lived/eternal systems
returns
the number of the round

Definition Classes
StateManagement
def svdGradient(lagMetric: ⇒ Double = nbrLag().toMillis)(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

Definition Classes
Gradients
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def ultGradient(radius: Double = 0.2, factor: Double = 0.1)(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

Definition Classes
Gradients
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def G_along[V](g: Double, metric: (StdLib_BlockS.this)#Metric, field: V, acc: (V) ⇒ V): V

Version of G (Gradient-Cast) that takes a potential field g as input
Version of G (Gradient-Cast) that takes a potential field g as input
V
type of the value to be accumulated
g
potential field
metric
metric to use for the "last step"
field
value of the field for sources
acc
aggregator
returns
a field that locally provides the value of the gradient-cast (field at sources, and an accumulation value along the way)

Definition Classes
BlockG
Deprecated
As it seems buggy.
def Gg[V](gradient: (BlockS.this)#Gradient, field: V, acc: (V) ⇒ V): V

Version of G (Gradient-Cast) that takes a Gradient algorithm as input.
Version of G (Gradient-Cast) that takes a Gradient algorithm as input. This is motivated by the desire of speeding G up by using
gradient
The gradient algorithm to use -- notice that this encapsulates details about the gradient field (e.g., the sources)

Definition Classes
BlockG
Deprecated
As it seems buggy: see G_along method.
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Doc: package StdLib_BlockS

trait BlockS extends (StdLib_BlockS.this)#BlockG

Type Members

trait FieldOps extends AnyRef

case class Gradient(algorithm: (Boolean, () ⇒ Double) ⇒ Double, source: Boolean = false, metric: (StdLib_Gradients.this)#Metric = nbrRange) extends Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def BisGradient(commRadius: Double = 0.2, lagMetric: ⇒ Double = nbrLag().toMillis): (BlockS.this)#Gradient

val ClassicGradient: (BlockS.this)#Gradient

val ClassicHopGradient: (BlockS.this)#Gradient

def CrfGradient(raisingSpeed: Double = 5, lagMetric: ⇒ Double = nbrLag().toMillis): (BlockS.this)#Gradient

def FlexGradient(epsilon: Double = 0.5, delta: Double = 1.0, communicationRadius: Double = 1.0): (BlockS.this)#Gradient

def G[V](source: Boolean, field: V, acc: (V) ⇒ V, metric: () ⇒ Double): V

def Gcurried[V](source: Boolean)(field: V)(acc: (V) ⇒ V)(metric: (StdLib_BlockS.this)#Metric = nbrRange): V

def S(grain: Double, metric: (StdLib_BlockS.this)#Metric): Boolean

def S2(grain: Double): Boolean

def SvdGradient(lagMetric: ⇒ Double = nbrLag().toMillis): (BlockS.this)#Gradient

def UltGradient(radius: Double = 0.2, factor: Double = 0.1): (BlockS.this)#Gradient

final def asInstanceOf[T0]: T0

def bisGradient(commRadius: Double = 0.2, lagMetric: ⇒ Double = nbrLag().toMillis)(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

def breakUsingUids(uid: (Double, (StdLib_BlockS.this)#ID), grain: Double, metric: (StdLib_BlockS.this)#Metric): Boolean

def broadcast[V](source: Boolean, field: V, metric: (StdLib_BlockS.this)#Metric = nbrRange): V

def captureChange[T](x: T, initially: Boolean = true): Boolean

def channel(source: Boolean, target: Boolean, width: Double): Boolean

def classicGradient(source: Boolean, metric: () ⇒ Double = nbrRange): Double

def clone(): AnyRef

def constant[T](value: ⇒ T): T

def countChanges[T](x: T, initially: Boolean = true): (Long, Boolean)

def crfGradient(raisingSpeed: Double = 5, lagMetric: ⇒ Double = nbrLag().toMillis)(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

def delay[T](value: T): T

def distanceBetween(source: Boolean, target: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

def distanceCompetition(d: Double, lead: (Double, (StdLib_BlockS.this)#ID), uid: (Double, (StdLib_BlockS.this)#ID), grain: Double, metric: (StdLib_BlockS.this)#Metric): (Double, (StdLib_BlockS.this)#ID)

def distanceTo(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

object excludingSelf extends (FieldUtils.this)#FieldOps

def flexGradient(epsilon: Double = 0.5, delta: Double = 1.0, communicationRadius: Double = 1.0)(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

final def getClass(): Class[_]

def goesDown(value: Boolean): Boolean

def goesUp(value: Boolean): Boolean

def hashCode(): Int

def hopDistance(source: Boolean): Double

def hopGradient(source: Boolean): Double

object includingSelf extends (FieldUtils.this)#FieldOps

final def isInstanceOf[T0]: Boolean

def keep(expr: ⇒ Boolean): Boolean

def keep[T](expr: ⇒ Option[T]): Option[T]

def meanCounter(value: Double, frequency: Long): Double

def minId(): (StdLib_BlockS.this)#ID

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def once[T](expr: ⇒ T): Option[T]

def randomUid: (Double, (StdLib_BlockS.this)#ID)

def remember[T](value: ⇒ T): T

def roundCounter(): Long

def svdGradient(lagMetric: ⇒ Double = nbrLag().toMillis)(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def ultGradient(radius: Double = 0.2, factor: Double = 0.1)(source: Boolean, metric: (StdLib_BlockS.this)#Metric = nbrRange): Double

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

Deprecated Value Members

def G_along[V](g: Double, metric: (StdLib_BlockS.this)#Metric, field: V, acc: (V) ⇒ V): V

def Gg[V](gradient: (BlockS.this)#Gradient, field: V, acc: (V) ⇒ V): V

def finalize(): Unit

Inherited from (StdLib_BlockS.this)#BlockG

Inherited from (StdLib_BlockS.this)#FieldUtils

Inherited from (StdLib_BlockS.this)#Gradients

Inherited from (StdLib_BlockS.this)#StateManagement

Inherited from (StdLib_BlockS.this)#GenericUtils

Inherited from AnyRef

Inherited from Any

Ungrouped