StructuredAccessControl

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def and[A, B](left: StructuredAccessControl[A], right: StructuredAccessControl[B]): StructuredAccessControl[(A, B)]

   

   Allows the request through iff both left and right allow it.

   Allows the request through iff both left and right allow it.

   Example usage:

   Nap.auth(
     StructuredAccessControl.and(Auth.superuser, Auth.admin)).get(ctx => ???)

   If there is only one error, it is ignored. If there are two, the left one masks the right one.

   Definition Classes

   StructuredAccessControlCombinators

5. def anyOf[A, B, C](first: StructuredAccessControl[A], second: StructuredAccessControl[B], third: StructuredAccessControl[C]): StructuredAccessControl[(Option[A], Option[B], Option[C])]

   

   Definition Classes

   StructuredAccessControlCombinators

6. def anyOf[A, B](left: StructuredAccessControl[A], right: StructuredAccessControl[B]): StructuredAccessControl[(Option[A], Option[B])]

   

   Allows the request through as long as at least one of Access Controllers would allow the request.

   Allows the request through as long as at least one of Access Controllers would allow the request.

   The parse results are exposed to user code as a tuple containing options. At least one of the options must be a Some.

   Definition Classes

   StructuredAccessControlCombinators

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. def either[A, B](left: StructuredAccessControl[A], right: StructuredAccessControl[B]): StructuredAccessControl[Either[A, B]]

   

   A left-biased combinator that allows the request if either the left or the right access control allow it.

   A left-biased combinator that allows the request if either the left or the right access control allow it.

   Example usage:

   Nap.auth(
     StructuredAccessControl.either(Auth.superuser, Auth.admin)).get(ctx => ???)

   If there is only one error, it is ignored. If there are two, the right one masks the left one.

   Definition Classes

   StructuredAccessControlCombinators

10. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

15. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

16. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

17. final def notify(): Unit

    

    Definition Classes

    AnyRef

18. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    AnyRef

20. def toString(): String

    

    Definition Classes

    AnyRef → Any

21. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

23. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )