abstract class PType[P] extends AnyRef
a type class for a persistent object
- P
the persistent type
- Source
- PType.scala
- Alphabetic
- By Inheritance
- PType
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Instance Constructors
- new PType()(implicit arg0: TypeKey[P])
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (PType[P], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
emptyKeySet: Set[Key[P]]
an empty key set.
an empty key set. this is a convenience method for people using Scala 2.11 who wish to declare an empty key set. you can always do it by hand with
Set.empty, but you will have to declare the element type of the set yourself, like so:import longevity.model.ptype.Key @perstent(keySet = Set.empty[Key[Foo]])
- def ensuring(cond: (PType[P]) ⇒ Boolean, msg: ⇒ Any): PType[P]
- def ensuring(cond: (PType[P]) ⇒ Boolean): PType[P]
- def ensuring(cond: Boolean, msg: ⇒ Any): PType[P]
- def ensuring(cond: Boolean): PType[P]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
def
index(propsHead: Prop[P, _], propsTail: Prop[P, _]*): Index[P]
constructs an index for this persistent type based on the supplied set of index props
constructs an index for this persistent type based on the supplied set of index props
- propsHead
the first of the properties that define this index
- propsTail
any remaining properties that define this index
-
def
indexSet: Set[Index[P]]
the indexes for this persistent type.
the indexes for this persistent type. defaults to the empty set
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
key[V <: KeyVal[P]](keyValProp: Prop[P, V])(implicit arg0: TypeKey[V]): Key[P]
constructs a key for this persistent type
constructs a key for this persistent type
- V
the type of the key value
- keyValProp
a property for the key
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
val
pTypeKey: TypeKey[P]
the type key for the persistent type
-
def
partition(props: Prop[P, _]*): Partition[P]
a series of properties that determines the partitioning used by the underlying database to distribute data across multiple nodes.
a series of properties that determines the partitioning used by the underlying database to distribute data across multiple nodes. used to form a primary key
- props
the properties that determine the partition
-
def
primaryKey[V <: KeyVal[P]](keyValProp: Prop[P, V], partition: Partition[P])(implicit arg0: TypeKey[V]): Key[P]
constructs a primary key for this persistent type
constructs a primary key for this persistent type
- V
the type of the key value
- keyValProp
a property for the primary key
- partition
describes the portion of the key value to use to determine which node in the partition the data belongs to. this must form a prefix of the
keyValProp
-
def
primaryKey[V <: KeyVal[P]](keyValProp: Prop[P, V], hashed: Boolean = false)(implicit arg0: TypeKey[V]): Key[P]
constructs a primary key for this persistent type.
constructs a primary key for this persistent type. the full key value is used to determine the partition
- V
the type of the key value
- keyValProp
a property for the primary key
- hashed
if
true, then used a hashed partition (as opposed to a ranged partition) when possible. defaults tofalse.
-
lazy val
primaryKey: Option[PrimaryKey[P]]
the optional primary key for this persistent type
-
def
prop[A](path: String)(implicit arg0: TypeKey[A]): Prop[P, A]
constructs a Prop of type
Afrom the provided property path.constructs a Prop of type
Afrom the provided property path.the provided type
Ashould match the type of the actual member in the persistent class. typeAshould not contain any collections, or terminate with polymorphic component. violations will cause an exception to be thrown on DomainModel construction.- A
the type of the property
- path
the property path
-
lazy val
propSet: Set[Prop[P, _]]
the [Prop properties] for this persistent type
-
lazy val
queryDsl: QueryDsl[P]
contains implicit imports to make the query DSL work
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- PType → AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def →[B](y: B): (PType[P], B)