object DansV0Bag
- Alphabetic
- By Inheritance
- DansV0Bag
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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
- val CREATED_KEY: String
- val EASY_USER_ACCOUNT_KEY: String
- val IS_VERSION_OF_KEY: String
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
createFromData(payloadDir: File, algorithms: Set[ChecksumAlgorithm] = Set(ChecksumAlgorithm.SHA1), bagInfo: Map[String, Seq[String]] = Map.empty): Try[DansV0Bag]
Create a bag based on the payload that is inside
payloadDir
.Create a bag based on the payload that is inside
payloadDir
. The payload is moved to a subdirectorydata/
and from there the bag is created around it. Based on the givenalgorithms
,manifest-<alg>.txt
andtagmanifest-<alg>.txt
files are created. Themanifest-<alg>.txt
contain the checksums of the payload files indata/
. Thetagmanifest-<alg>.txt
contain the checksums forbagit.txt
,bag-info.txt
and all manifest files.The resulting bag also a
bag-info.txt
file withPayload-Oxum
,Bagging-Date
and all givenbagInfo
key-value(s) pairs.There are no restrictions on the amount of
bagInfo
entries, apart from the limitations listed in thehttps://tools.ietf.org/html/draft-kunze-bagit-16 BagIt Spec
. There must be at least one algorithm given for the checksums.- payloadDir
The directory containing the payload files and in which the bag is created
- algorithms
The algorithms with which the checksums for the (payload/tag) files are calculated
- bagInfo
The entries to be added to
bag-info.txt
- returns
if successful, returns a
nl.knaw.dans.bag.v0.Bag
object representing the bag located atpayloadDir
else returns an exception
- val dateTimeFormatter: DateTimeFormatter
-
def
empty(baseDir: File, algorithms: Set[ChecksumAlgorithm] = Set(ChecksumAlgorithm.SHA1), bagInfo: Map[String, Seq[String]] = Map.empty): Try[DansV0Bag]
Create an empty bag at the given
baseDir
.Create an empty bag at the given
baseDir
. Based on the givenalgorithms
, (empty)manifest-<alg>.txt
and (non-empty)tagmanifest-<alg>.txt
files are created. Thetagmanifest-<alg>.txt
contain the checksums forbagit.txt
,bag-info.txt
and all manifest files. The resulting bag also abag-info.txt
file withPayload-Oxum
,Bagging-Date
and all givenbagInfo
key-value(s) pairs.There are no restrictions on the amount of
bagInfo
entries, apart from the limitations listed in thehttps://tools.ietf.org/html/draft-kunze-bagit-16 BagIt Spec
. There must be at least one algorithm given for the checksums.- baseDir
The directory in which the bag is created
- algorithms
The algorithms with which the checksums for the (payload/tag) files are calculated
- bagInfo
The entries to be added to
bag-info.txt
- returns
if successful, returns a
nl.knaw.dans.bag.v0.Bag
object representing the bag located atbaseDir
else returns an exception
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
read(baseDir: File): Try[DansV0Bag]
Reads a bag located at
baseDir
and return anl.knaw.dans.bag.v0.Bag
when successful.Reads a bag located at
baseDir
and return anl.knaw.dans.bag.v0.Bag
when successful.- baseDir
The directory containing the bag
- returns
if successful, returns a
nl.knaw.dans.bag.v0.Bag
object representing the bag located atbaseDir
else return an exception
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- 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( ... ) @native()