diff --git a/docs/content/contact/index.md b/docs/content/contact/index.md
index 15300bd..61d3358 100644
--- a/docs/content/contact/index.md
+++ b/docs/content/contact/index.md
@@ -3,6 +3,8 @@ title = "Contact"
aliases = ["/contact"]
+++
-- Please use [discuss.dgraph.io](https://discuss.dgraph.io) for questions, feature requests and discussions.
-- Please use [Github issue tracker](https://github.com/dgraph-io/badger/issues) for filing bugs or feature requests.
+- Please use [discuss.dgraph.io](https://discuss.dgraph.io) for questions, feature requests and
+ discussions.
+- Please use [Github issue tracker](https://github.com/dgraph-io/badger/issues) for filing bugs or
+ feature requests.
- Follow us on Twitter [@dgraphlabs](https://twitter.com/dgraphlabs).
diff --git a/docs/content/design/index.md b/docs/content/design/index.md
index 25880b4..e0a510f 100644
--- a/docs/content/design/index.md
+++ b/docs/content/design/index.md
@@ -9,42 +9,43 @@ Badger was written with these design goals in mind:
- Use latest research to build the fastest KV database for data sets spanning terabytes.
- Optimize for SSDs.
-Badger’s design is based on a paper titled _[WiscKey: Separating Keys from
-Values in SSD-conscious Storage][wisckey]_.
+Badger’s design is based on a paper titled _[WiscKey: Separating Keys from Values in SSD-conscious
+Storage][wisckey]_.
[wisckey]: https://www.usenix.org/system/files/conference/fast16/fast16-papers-lu.pdf
## Comparisons
-| Feature | Badger | RocksDB | BoltDB |
-| ------- | ------ | ------- | ------ |
-| Design | LSM tree with value log | LSM tree only | B+ tree |
-| High Read throughput | Yes | No | Yes |
-| High Write throughput | Yes | Yes | No |
-| Designed for SSDs | Yes (with latest research
1) | Not specifically
2 | No |
-| Embeddable | Yes | Yes | Yes |
-| Sorted KV access | Yes | Yes | Yes |
-| Pure Go (no Cgo) | Yes | No | Yes |
-| Transactions | Yes, ACID, concurrent with SSI
3 | Yes (but non-ACID) | Yes, ACID |
-| Snapshots | Yes | Yes | Yes |
-| TTL support | Yes | Yes | No |
-| 3D access (key-value-version) | Yes
4 | No | No |
-
1 The [WISCKEY paper][wisckey] (on which Badger is based) saw big
-wins with separating values from keys, significantly reducing the write
-amplification compared to a typical LSM tree.
+| Feature | Badger | RocksDB | BoltDB |
+| ----------------------------- | ------------------------------------------ | ----------------------------- | --------- |
+| Design | LSM tree with value log | LSM tree only | B+ tree |
+| High Read throughput | Yes | No | Yes |
+| High Write throughput | Yes | Yes | No |
+| Designed for SSDs | Yes (with latest research
1) | Not specifically
2 | No |
+| Embeddable | Yes | Yes | Yes |
+| Sorted KV access | Yes | Yes | Yes |
+| Pure Go (no Cgo) | Yes | No | Yes |
+| Transactions | Yes, ACID, concurrent with SSI
3 | Yes (but non-ACID) | Yes, ACID |
+| Snapshots | Yes | Yes | Yes |
+| TTL support | Yes | Yes | No |
+| 3D access (key-value-version) | Yes
4 | No | No |
-
2 RocksDB is an SSD optimized version of LevelDB, which was designed specifically for rotating disks.
-As such RocksDB's design isn't aimed at SSDs.
+
1 The [WISCKEY paper][wisckey] (on which Badger is based) saw big wins with separating
+values from keys, significantly reducing the write amplification compared to a typical LSM tree.
-
3 SSI: Serializable Snapshot Isolation. For more details, see the blog post [Concurrent ACID Transactions in Badger](https://blog.dgraph.io/post/badger-txn/)
+
2 RocksDB is an SSD optimized version of LevelDB, which was designed specifically for
+rotating disks. As such RocksDB's design isn't aimed at SSDs.
-
4 Badger provides direct access to value versions via its Iterator API.
-Users can also specify how many versions to keep per key via Options.
+
3 SSI: Serializable Snapshot Isolation. For more details, see the blog post
+[Concurrent ACID Transactions in Badger](https://blog.dgraph.io/post/badger-txn/)
+
+
4 Badger provides direct access to value versions via its Iterator API. Users can also
+specify how many versions to keep per key via Options.
## Benchmarks
-We have run comprehensive benchmarks against RocksDB, Bolt and LMDB. The
-benchmarking code, and the detailed logs for the benchmarks can be found in the
-[badger-bench] repo. More explanation, including graphs can be found the blog posts (linked
-above).
+
+We have run comprehensive benchmarks against RocksDB, Bolt and LMDB. The benchmarking code, and the
+detailed logs for the benchmarks can be found in the [badger-bench] repo. More explanation,
+including graphs can be found the blog posts (linked above).
[badger-bench]: https://github.com/dgraph-io/badger-bench
diff --git a/docs/content/faq/index.md b/docs/content/faq/index.md
index 599ec24..ec99413 100644
--- a/docs/content/faq/index.md
+++ b/docs/content/faq/index.md
@@ -5,39 +5,35 @@ aliases = ["/faq"]
## My writes are getting stuck. Why?
-**Update: With the new `Value(func(v []byte))` API, this deadlock can no longer
-happen.**
+**Update: With the new `Value(func(v []byte))` API, this deadlock can no longer happen.**
The following is true for users on Badger v1.x.
-This can happen if a long running iteration with `Prefetch` is set to false, but
-a `Item::Value` call is made internally in the loop. That causes Badger to
-acquire read locks over the value log files to avoid value log GC removing the
-file from underneath. As a side effect, this also blocks a new value log GC
-file from being created, when the value log file boundary is hit.
+This can happen if a long running iteration with `Prefetch` is set to false, but a `Item::Value`
+call is made internally in the loop. That causes Badger to acquire read locks over the value log
+files to avoid value log GC removing the file from underneath. As a side effect, this also blocks a
+new value log GC file from being created, when the value log file boundary is hit.
-Please see Github issues [#293](https://github.com/dgraph-io/badger/issues/293)
-and [#315](https://github.com/dgraph-io/badger/issues/315).
+Please see Github issues [#293](https://github.com/dgraph-io/badger/issues/293) and
+[#315](https://github.com/dgraph-io/badger/issues/315).
There are multiple workarounds during iteration:
1. Use `Item::ValueCopy` instead of `Item::Value` when retrieving value.
-1. Set `Prefetch` to true. Badger would then copy over the value and release the
- file lock immediately.
-1. When `Prefetch` is false, don't call `Item::Value` and do a pure key-only
- iteration. This might be useful if you just want to delete a lot of keys.
+1. Set `Prefetch` to true. Badger would then copy over the value and release the file lock
+ immediately.
+1. When `Prefetch` is false, don't call `Item::Value` and do a pure key-only iteration. This might
+ be useful if you just want to delete a lot of keys.
1. Do the writes in a separate transaction after the reads.
## My writes are really slow. Why?
-Are you creating a new transaction for every single key update, and waiting for
-it to `Commit` fully before creating a new one? This will lead to very low
-throughput.
+Are you creating a new transaction for every single key update, and waiting for it to `Commit` fully
+before creating a new one? This will lead to very low throughput.
-We have created `WriteBatch` API which provides a way to batch up
-many updates into a single transaction and `Commit` that transaction using
-callbacks to avoid blocking. This amortizes the cost of a transaction really
-well, and provides the most efficient way to do bulk writes.
+We have created `WriteBatch` API which provides a way to batch up many updates into a single
+transaction and `Commit` that transaction using callbacks to avoid blocking. This amortizes the cost
+of a transaction really well, and provides the most efficient way to do bulk writes.
```go
wb := db.NewWriteBatch()
@@ -50,26 +46,31 @@ for i := 0; i < N; i++ {
handle(wb.Flush()) // Wait for all txns to finish.
```
-Note that `WriteBatch` API does not allow any reads. For read-modify-write
-workloads, you should be using the `Transaction` API.
+Note that `WriteBatch` API does not allow any reads. For read-modify-write workloads, you should be
+using the `Transaction` API.
## I don't see any disk writes. Why?
If you're using Badger with `SyncWrites=false`, then your writes might not be written to value log
and won't get synced to disk immediately. Writes to LSM tree are done inmemory first, before they
-get compacted to disk. The compaction would only happen once `BaseTableSize` has been reached. So, if
-you're doing a few writes and then checking, you might not see anything on disk. Once you `Close`
+get compacted to disk. The compaction would only happen once `BaseTableSize` has been reached. So,
+if you're doing a few writes and then checking, you might not see anything on disk. Once you `Close`
the database, you'll see these writes on disk.
## Reverse iteration doesn't give me the right results.
-Just like forward iteration goes to the first key which is equal or greater than the SEEK key, reverse iteration goes to the first key which is equal or lesser than the SEEK key. Therefore, SEEK key would not be part of the results. You can typically add a `0xff` byte as a suffix to the SEEK key to include it in the results. See the following issues: [#436](https://github.com/dgraph-io/badger/issues/436) and [#347](https://github.com/dgraph-io/badger/issues/347).
+Just like forward iteration goes to the first key which is equal or greater than the SEEK key,
+reverse iteration goes to the first key which is equal or lesser than the SEEK key. Therefore, SEEK
+key would not be part of the results. You can typically add a `0xff` byte as a suffix to the SEEK
+key to include it in the results. See the following issues:
+[#436](https://github.com/dgraph-io/badger/issues/436) and
+[#347](https://github.com/dgraph-io/badger/issues/347).
## Which instances should I use for Badger?
-We recommend using instances which provide local SSD storage, without any limit
-on the maximum IOPS. In AWS, these are storage optimized instances like i3. They
-provide local SSDs which clock 100K IOPS over 4KB blocks easily.
+We recommend using instances which provide local SSD storage, without any limit on the maximum IOPS.
+In AWS, these are storage optimized instances like i3. They provide local SSDs which clock 100K IOPS
+over 4KB blocks easily.
## I'm getting a closed channel error. Why?
@@ -78,65 +79,71 @@ panic: close of closed channel
panic: send on closed channel
```
-If you're seeing panics like above, this would be because you're operating on a closed DB. This can happen, if you call `Close()` before sending a write, or multiple times. You should ensure that you only call `Close()` once, and all your read/write operations finish before closing.
+If you're seeing panics like above, this would be because you're operating on a closed DB. This can
+happen, if you call `Close()` before sending a write, or multiple times. You should ensure that you
+only call `Close()` once, and all your read/write operations finish before closing.
## Are there any Go specific settings that I should use?
-We *highly* recommend setting a high number for `GOMAXPROCS`, which allows Go to
-observe the full IOPS throughput provided by modern SSDs. In Dgraph, we have set
-it to 128. For more details, [see this
-thread](https://groups.google.com/d/topic/golang-nuts/jPb_h3TvlKE/discussion).
+We _highly_ recommend setting a high number for `GOMAXPROCS`, which allows Go to observe the full
+IOPS throughput provided by modern SSDs. In Dgraph, we have set it to 128. For more details,
+[see this thread](https://groups.google.com/d/topic/golang-nuts/jPb_h3TvlKE/discussion).
## Are there any Linux specific settings that I should use?
We recommend setting `max file descriptors` to a high number depending upon the expected size of
your data. On Linux and Mac, you can check the file descriptor limit with `ulimit -n -H` for the
-hard limit and `ulimit -n -S` for the soft limit. A soft limit of `65535` is a good lower bound.
-You can adjust the limit as needed.
+hard limit and `ulimit -n -S` for the soft limit. A soft limit of `65535` is a good lower bound. You
+can adjust the limit as needed.
## I see "manifest has unsupported version: X (we support Y)" error.
This error means you have a badger directory which was created by an older version of badger and
you're trying to open in a newer version of badger. The underlying data format can change across
-badger versions and users will have to migrate their data directory.
-Badger data can be migrated from version X of badger to version Y of badger by following the steps
-listed below.
-Assume you were on badger v1.6.0 and you wish to migrate to v2.0.0 version.
+badger versions and users will have to migrate their data directory. Badger data can be migrated
+from version X of badger to version Y of badger by following the steps listed below. Assume you were
+on badger v1.6.0 and you wish to migrate to v2.0.0 version.
+
1. Install badger version v1.6.0
- - `cd $GOPATH/src/github.com/dgraph-io/badger`
- - `git checkout v1.6.0`
- - `cd badger && go install`
- This should install the old badger binary in your $GOBIN.
+ - `cd $GOPATH/src/github.com/dgraph-io/badger`
+ - `git checkout v1.6.0`
+ - `cd badger && go install`
+
+ This should install the old badger binary in your $GOBIN.
+
2. Create Backup
- - `badger backup --dir path/to/badger/directory -f badger.backup`
+ - `badger backup --dir path/to/badger/directory -f badger.backup`
3. Install badger version v2.0.0
- - `cd $GOPATH/src/github.com/dgraph-io/badger`
- - `git checkout v2.0.0`
- - `cd badger && go install`
- This should install new badger binary in your $GOBIN
+ - `cd $GOPATH/src/github.com/dgraph-io/badger`
+ - `git checkout v2.0.0`
+ - `cd badger && go install`
+
+ This should install new badger binary in your $GOBIN
+
4. Restore data from backup
- - `badger restore --dir path/to/new/badger/directory -f badger.backup`
- This will create a new directory on `path/to/new/badger/directory` and add badger data in
- newer format to it.
+ - `badger restore --dir path/to/new/badger/directory -f badger.backup`
+
+ This will create a new directory on `path/to/new/badger/directory` and add badger data in newer
+ format to it.
NOTE - The above steps shouldn't cause any data loss but please ensure the new data is valid before
deleting the old badger directory.
## Why do I need gcc to build badger? Does badger need CGO?
-Badger does not directly use CGO but it relies on https://github.com/DataDog/zstd library for
-zstd compression and the library requires `gcc/cgo`. You can build badger without cgo by running
+Badger does not directly use CGO but it relies on https://github.com/DataDog/zstd library for zstd
+compression and the library requires `gcc/cgo`. You can build badger without cgo by running
`CGO_ENABLED=0 go build`. This will build badger without the support for ZSTD compression algorithm.
As of Badger versions [v2.2007.4](https://github.com/dgraph-io/badger/releases/tag/v2.2007.4) and
-[v3.2103.1](https://github.com/dgraph-io/badger/releases/tag/v3.2103.1) the DataDog ZSTD library
-was replaced by pure Golang version and CGO is no longer required. The new library is
+[v3.2103.1](https://github.com/dgraph-io/badger/releases/tag/v3.2103.1) the DataDog ZSTD library was
+replaced by pure Golang version and CGO is no longer required. The new library is
[backwards compatible in nearly all cases](https://discuss.dgraph.io/t/use-pure-go-zstd-implementation/8670/10):
- > Yes they are compatible both ways. The only exception is 0 bytes of input which will give
- > 0 bytes output with the Go zstd. But you already have the zstd.WithZeroFrames(true) which
- > will wrap 0 bytes in a header so it can be fed to DD zstd. This will of course only be relevant
- > when downgrading.
+ > Yes they are compatible both ways. The only exception is 0 bytes of input which will give
+ > 0 bytes output with the Go zstd. But you already have the zstd.WithZeroFrames(true) which
+ > will wrap 0 bytes in a header so it can be fed to DD zstd. This will of course only be relevant
+ > when downgrading.
diff --git a/docs/content/get-started/index.md b/docs/content/get-started/index.md
index d73379d..7a2d0e4 100644
--- a/docs/content/get-started/index.md
+++ b/docs/content/get-started/index.md
@@ -3,13 +3,14 @@ title = "Get Started - Quickstart Guide"
aliases = ["/get-started"]
+++
-
## Installing
+
To start using Badger, install Go 1.23 or above. Run the following command to retrieve the library.
```sh
$ go get github.com/dgraph-io/badger/v4
```
+
This will retrieve the library.
### Installing Badger Command Line Tool
@@ -17,15 +18,17 @@ This will retrieve the library.
```sh
$ go install github.com/dgraph-io/badger/v4/badger@latest
```
+
This will install the badger command line utility into your $GOBIN path.
## Opening a database
-The top-level object in Badger is a `DB`. It represents multiple files on disk
-in specific directories, which contain the data for a single database.
-To open your database, use the `badger.Open()` function, with the appropriate
-options. The `Dir` and `ValueDir` options are mandatory and must be
-specified by the client. They can be set to the same value to simplify things.
+The top-level object in Badger is a `DB`. It represents multiple files on disk in specific
+directories, which contain the data for a single database.
+
+To open your database, use the `badger.Open()` function, with the appropriate options. The `Dir` and
+`ValueDir` options are mandatory and must be specified by the client. They can be set to the same
+value to simplify things.
```go
package main
@@ -48,14 +51,15 @@ func main() {
}
```
-Please note that Badger obtains a lock on the directories so multiple processes
-cannot open the same database at the same time.
+Please note that Badger obtains a lock on the directories so multiple processes cannot open the same
+database at the same time.
### In-Memory Mode/Diskless Mode
-By default, Badger ensures all the data is persisted to the disk. It also supports a pure
-in-memory mode. When Badger is running in in-memory mode, all the data is stored in the memory.
-Reads and writes are much faster in in-memory mode, but all the data stored in Badger will be lost
-in case of a crash or close. To open badger in in-memory mode, set the `InMemory` option.
+
+By default, Badger ensures all the data is persisted to the disk. It also supports a pure in-memory
+mode. When Badger is running in in-memory mode, all the data is stored in the memory. Reads and
+writes are much faster in in-memory mode, but all the data stored in Badger will be lost in case of
+a crash or close. To open badger in in-memory mode, set the `InMemory` option.
```go
opt := badger.DefaultOptions("").WithInMemory(true)
@@ -65,9 +69,8 @@ opt := badger.DefaultOptions("").WithInMemory(true)
If you enable encryption on Badger, you also need to set the index cache size.
-{{% notice "tip" %}}
-Having a cache improves the performance. Otherwise, your reads would be very slow while encryption is enabled.
-{{% /notice %}}
+{{% notice "tip" %}} Having a cache improves the performance. Otherwise, your reads would be very
+slow while encryption is enabled. {{% /notice %}}
For example, to set a `100 Mb` cache:
@@ -78,6 +81,7 @@ opts.IndexCache = 100 << 20 // 100 mb or some other size based on the amount of
## Transactions
### Read-only transactions
+
To start a read-only transaction, you can use the `DB.View()` method:
```go
@@ -87,12 +91,12 @@ err := db.View(func(txn *badger.Txn) error {
})
```
-You cannot perform any writes or deletes within this transaction. Badger
-ensures that you get a consistent view of the database within this closure. Any
-writes that happen elsewhere after the transaction has started, will not be
-seen by calls made within the closure.
+You cannot perform any writes or deletes within this transaction. Badger ensures that you get a
+consistent view of the database within this closure. Any writes that happen elsewhere after the
+transaction has started, will not be seen by calls made within the closure.
### Read-write transactions
+
To start a read-write transaction, you can use the `DB.Update()` method:
```go
@@ -104,17 +108,16 @@ err := db.Update(func(txn *badger.Txn) error {
All database operations are allowed inside a read-write transaction.
-Always check the returned error value. If you return an error
-within your closure it will be passed through.
+Always check the returned error value. If you return an error within your closure it will be passed
+through.
-An `ErrConflict` error will be reported in case of a conflict. Depending on the state
-of your application, you have the option to retry the operation if you receive
-this error.
+An `ErrConflict` error will be reported in case of a conflict. Depending on the state of your
+application, you have the option to retry the operation if you receive this error.
-An `ErrTxnTooBig` will be reported in case the number of pending writes/deletes in
-the transaction exceeds a certain limit. In that case, it is best to commit the
-transaction and start a new transaction immediately. Here is an example (we are
-not checking for errors in some places for simplicity):
+An `ErrTxnTooBig` will be reported in case the number of pending writes/deletes in the transaction
+exceeds a certain limit. In that case, it is best to commit the transaction and start a new
+transaction immediately. Here is an example (we are not checking for errors in some places for
+simplicity):
```go
updates := make(map[string]string)
@@ -130,23 +133,20 @@ _ = txn.Commit()
```
### Managing transactions manually
-The `DB.View()` and `DB.Update()` methods are wrappers around the
-`DB.NewTransaction()` and `Txn.Commit()` methods (or `Txn.Discard()` in case of
-read-only transactions). These helper methods will start the transaction,
-execute a function, and then safely discard your transaction if an error is
-returned. This is the recommended way to use Badger transactions.
-However, sometimes you may want to manually create and commit your
-transactions. You can use the `DB.NewTransaction()` function directly, which
-takes in a boolean argument to specify whether a read-write transaction is
-required. For read-write transactions, it is necessary to call `Txn.Commit()`
-to ensure the transaction is committed. For read-only transactions, calling
-`Txn.Discard()` is sufficient. `Txn.Commit()` also calls `Txn.Discard()`
-internally to cleanup the transaction, so just calling `Txn.Commit()` is
-sufficient for read-write transaction. However, if your code doesn’t call
-`Txn.Commit()` for some reason (for e.g it returns prematurely with an error),
-then please make sure you call `Txn.Discard()` in a `defer` block. Refer to the
-code below.
+The `DB.View()` and `DB.Update()` methods are wrappers around the `DB.NewTransaction()` and
+`Txn.Commit()` methods (or `Txn.Discard()` in case of read-only transactions). These helper methods
+will start the transaction, execute a function, and then safely discard your transaction if an error
+is returned. This is the recommended way to use Badger transactions.
+
+However, sometimes you may want to manually create and commit your transactions. You can use the
+`DB.NewTransaction()` function directly, which takes in a boolean argument to specify whether a
+read-write transaction is required. For read-write transactions, it is necessary to call
+`Txn.Commit()` to ensure the transaction is committed. For read-only transactions, calling
+`Txn.Discard()` is sufficient. `Txn.Commit()` also calls `Txn.Discard()` internally to cleanup the
+transaction, so just calling `Txn.Commit()` is sufficient for read-write transaction. However, if
+your code doesn’t call `Txn.Commit()` for some reason (for e.g it returns prematurely with an
+error), then please make sure you call `Txn.Discard()` in a `defer` block. Refer to the code below.
```go
// Start a writable transaction.
@@ -165,19 +165,19 @@ if err := txn.Commit(); err != nil {
}
```
-The first argument to `DB.NewTransaction()` is a boolean stating if the transaction
-should be writable.
+The first argument to `DB.NewTransaction()` is a boolean stating if the transaction should be
+writable.
-Badger allows an optional callback to the `Txn.Commit()` method. Normally, the
-callback can be set to `nil`, and the method will return after all the writes
-have succeeded. However, if this callback is provided, the `Txn.Commit()`
-method returns as soon as it has checked for any conflicts. The actual writing
-to the disk happens asynchronously, and the callback is invoked once the
-writing has finished, or an error has occurred. This can improve the throughput
-of the application in some cases. But it also means that a transaction is not
-durable until the callback has been invoked with a `nil` error value.
+Badger allows an optional callback to the `Txn.Commit()` method. Normally, the callback can be set
+to `nil`, and the method will return after all the writes have succeeded. However, if this callback
+is provided, the `Txn.Commit()` method returns as soon as it has checked for any conflicts. The
+actual writing to the disk happens asynchronously, and the callback is invoked once the writing has
+finished, or an error has occurred. This can improve the throughput of the application in some
+cases. But it also means that a transaction is not durable until the callback has been invoked with
+a `nil` error value.
## Using key/value pairs
+
To save a key/value pair, use the `Txn.Set()` method:
```go
@@ -187,9 +187,8 @@ err := db.Update(func(txn *badger.Txn) error {
})
```
-Key/Value pair can also be saved by first creating `Entry`, then setting this
-`Entry` using `Txn.SetEntry()`. `Entry` also exposes methods to set properties
-on it.
+Key/Value pair can also be saved by first creating `Entry`, then setting this `Entry` using
+`Txn.SetEntry()`. `Entry` also exposes methods to set properties on it.
```go
err := db.Update(func(txn *badger.Txn) error {
@@ -199,8 +198,8 @@ err := db.Update(func(txn *badger.Txn) error {
})
```
-This will set the value of the `"answer"` key to `"42"`. To retrieve this
-value, we can use the `Txn.Get()` method:
+This will set the value of the `"answer"` key to `"42"`. To retrieve this value, we can use the
+`Txn.Get()` method:
```go
err := db.View(func(txn *badger.Txn) error {
@@ -240,24 +239,23 @@ err := db.View(func(txn *badger.Txn) error {
`Txn.Get()` returns `ErrKeyNotFound` if the value is not found.
-Please note that values returned from `Get()` are only valid while the
-transaction is open. If you need to use a value outside of the transaction
-then you must use `copy()` to copy it to another byte slice.
+Please note that values returned from `Get()` are only valid while the transaction is open. If you
+need to use a value outside of the transaction then you must use `copy()` to copy it to another byte
+slice.
Use the `Txn.Delete()` method to delete a key.
## Monotonically increasing integers
-To get unique monotonically increasing integers with strong durability, you can
-use the `DB.GetSequence` method. This method returns a `Sequence` object, which
-is thread-safe and can be used concurrently via various goroutines.
+To get unique monotonically increasing integers with strong durability, you can use the
+`DB.GetSequence` method. This method returns a `Sequence` object, which is thread-safe and can be
+used concurrently via various goroutines.
-Badger would lease a range of integers to hand out from memory, with the
-bandwidth provided to `DB.GetSequence`. The frequency at which disk writes are
-done is determined by this lease bandwidth and the frequency of `Next`
-invocations. Setting a bandwidth too low would do more disk writes, setting it
-too high would result in wasted integers if Badger is closed or crashes.
-To avoid wasted integers, call `Release` before closing Badger.
+Badger would lease a range of integers to hand out from memory, with the bandwidth provided to
+`DB.GetSequence`. The frequency at which disk writes are done is determined by this lease bandwidth
+and the frequency of `Next` invocations. Setting a bandwidth too low would do more disk writes,
+setting it too high would result in wasted integers if Badger is closed or crashes. To avoid wasted
+integers, call `Release` before closing Badger.
```go
seq, err := db.GetSequence(key, 1000)
@@ -268,11 +266,11 @@ for {
```
## Merge Operations
-Badger provides support for ordered merge operations. You can define a func
-of type `MergeFunc` which takes in an existing value, and a value to be
-_merged_ with it. It returns a new value which is the result of the _merge_
-operation. All values are specified in byte arrays. For e.g., here is a merge
-function (`add`) which appends a `[]byte` value to an existing `[]byte` value.
+
+Badger provides support for ordered merge operations. You can define a func of type `MergeFunc`
+which takes in an existing value, and a value to be _merged_ with it. It returns a new value which
+is the result of the _merge_ operation. All values are specified in byte arrays. For e.g., here is a
+merge function (`add`) which appends a `[]byte` value to an existing `[]byte` value.
```go
// Merge function to append one byte slice to another
@@ -281,13 +279,12 @@ func add(originalValue, newValue []byte) []byte {
}
```
-This function can then be passed to the `DB.GetMergeOperator()` method, along
-with a key, and a duration value. The duration specifies how often the merge
-function is run on values that have been added using the `MergeOperator.Add()`
-method.
+This function can then be passed to the `DB.GetMergeOperator()` method, along with a key, and a
+duration value. The duration specifies how often the merge function is run on values that have been
+added using the `MergeOperator.Add()` method.
-`MergeOperator.Get()` method can be used to retrieve the cumulative value of the key
-associated with the merge operation.
+`MergeOperator.Get()` method can be used to retrieve the cumulative value of the key associated with
+the merge operation.
```go
key := []byte("merge")
@@ -320,7 +317,9 @@ func add(existing, new []byte) []byte {
return uint64ToBytes(bytesToUint64(existing) + bytesToUint64(new))
}
```
+
It can be used as
+
```
key := []byte("merge")
@@ -335,10 +334,10 @@ res, _ := m.Get() // res should have value 6 encoded
```
## Setting Time To Live(TTL) and User Metadata on Keys
-Badger allows setting an optional Time to Live (TTL) value on keys. Once the TTL has
-elapsed, the key will no longer be retrievable and will be eligible for garbage
-collection. A TTL can be set as a `time.Duration` value using the `Entry.WithTTL()`
-and `Txn.SetEntry()` API methods.
+
+Badger allows setting an optional Time to Live (TTL) value on keys. Once the TTL has elapsed, the
+key will no longer be retrievable and will be eligible for garbage collection. A TTL can be set as a
+`time.Duration` value using the `Entry.WithTTL()` and `Txn.SetEntry()` API methods.
```go
err := db.Update(func(txn *badger.Txn) error {
@@ -348,10 +347,10 @@ err := db.Update(func(txn *badger.Txn) error {
})
```
-An optional user metadata value can be set on each key. A user metadata value
-is represented by a single byte. It can be used to set certain bits along
-with the key to aid in interpreting or decoding the key-value pair. User
-metadata can be set using `Entry.WithMeta()` and `Txn.SetEntry()` API methods.
+An optional user metadata value can be set on each key. A user metadata value is represented by a
+single byte. It can be used to set certain bits along with the key to aid in interpreting or
+decoding the key-value pair. User metadata can be set using `Entry.WithMeta()` and `Txn.SetEntry()`
+API methods.
```go
err := db.Update(func(txn *badger.Txn) error {
@@ -361,8 +360,8 @@ err := db.Update(func(txn *badger.Txn) error {
})
```
-`Entry` APIs can be used to add the user metadata and TTL for same key. This `Entry`
-then can be set using `Txn.SetEntry()`.
+`Entry` APIs can be used to add the user metadata and TTL for same key. This `Entry` then can be set
+using `Txn.SetEntry()`.
```go
err := db.Update(func(txn *badger.Txn) error {
@@ -373,10 +372,9 @@ err := db.Update(func(txn *badger.Txn) error {
```
## Iterating over keys
-To iterate over keys, we can use an `Iterator`, which can be obtained using the
-`Txn.NewIterator()` method. Iteration happens in byte-wise lexicographical sorting
-order.
+To iterate over keys, we can use an `Iterator`, which can be obtained using the `Txn.NewIterator()`
+method. Iteration happens in byte-wise lexicographical sorting order.
```go
err := db.View(func(txn *badger.Txn) error {
@@ -399,16 +397,16 @@ err := db.View(func(txn *badger.Txn) error {
})
```
-The iterator allows you to move to a specific point in the list of keys and move
-forward or backward through the keys one at a time.
+The iterator allows you to move to a specific point in the list of keys and move forward or backward
+through the keys one at a time.
-By default, Badger prefetches the values of the next 100 items. You can adjust
-that with the `IteratorOptions.PrefetchSize` field. However, setting it to
-a value higher than `GOMAXPROCS` (which we recommend to be 128 or higher)
-shouldn’t give any additional benefits. You can also turn off the fetching of
-values altogether. See section below on key-only iteration.
+By default, Badger prefetches the values of the next 100 items. You can adjust that with the
+`IteratorOptions.PrefetchSize` field. However, setting it to a value higher than `GOMAXPROCS` (which
+we recommend to be 128 or higher) shouldn’t give any additional benefits. You can also turn off the
+fetching of values altogether. See section below on key-only iteration.
### Prefix scans
+
To iterate over a key prefix, you can combine `Seek()` and `ValidForPrefix()`:
```go
@@ -433,36 +431,34 @@ db.View(func(txn *badger.Txn) error {
### Possible pagination implementation using Prefix scans
-Considering that iteration happens in **byte-wise lexicographical sorting** order,
-it's possible to create a sorting-sensitive key. For example, a simple blog post
-key might look like:`feed:userUuid:timestamp:postUuid`. Here, the `timestamp` part
-of the key is treated as an attribute, and items will be stored in the corresponding order:
+Considering that iteration happens in **byte-wise lexicographical sorting** order, it's possible to
+create a sorting-sensitive key. For example, a simple blog post key might look
+like:`feed:userUuid:timestamp:postUuid`. Here, the `timestamp` part of the key is treated as an
+attribute, and items will be stored in the corresponding order:
-| Order ASC | Key |
-|:-----------:|:-------------------------------------------------------------|
-| 1 | feed:tQpnEDVRoCxTFQDvyQEzdo:1733127889:tQpnEDVRoCxTFQDvyQEzdo |
-| 2 | feed:tQpnEDVRoCxTFQDvyQEzdo:1733127533:1Mryrou1xoekEaxzrFiHwL |
-| 3 | feed:tQpnEDVRoCxTFQDvyQEzdo:1733127486:pprRrNL2WP4yfVXsSNBSx6 |
+| Order ASC | Key |
+| :-------: | :------------------------------------------------------------ |
+| 1 | feed:tQpnEDVRoCxTFQDvyQEzdo:1733127889:tQpnEDVRoCxTFQDvyQEzdo |
+| 2 | feed:tQpnEDVRoCxTFQDvyQEzdo:1733127533:1Mryrou1xoekEaxzrFiHwL |
+| 3 | feed:tQpnEDVRoCxTFQDvyQEzdo:1733127486:pprRrNL2WP4yfVXsSNBSx6 |
-It is important to properly configure keys for lexicographical sorting to avoid
-incorrect ordering.
+It is important to properly configure keys for lexicographical sorting to avoid incorrect ordering.
-A **prefix scan** through the keys above can be achieved using the prefix
+A **prefix scan** through the keys above can be achieved using the prefix
`feed:tQpnEDVRoCxTFQDvyQEzdo`. All matching keys will be returned, sorted by `timestamp`.
-For the example above, sorting can be done in ascending or descending order based on
-`timestamp` or `reversed timestamp` as needed:
+For the example above, sorting can be done in ascending or descending order based on `timestamp` or
+`reversed timestamp` as needed:
```go
reversedTimestamp := math.MaxInt64-time.Now().Unix()
```
-This makes it possible to implement simple pagination by using a limit for
-the number of keys and a cursor (the last key from the previous iteration) to
-identify where to resume.
+This makes it possible to implement simple pagination by using a limit for the number of keys and a
+cursor (the last key from the previous iteration) to identify where to resume.
```go
-// startCursor may look like 'feed:tQpnEDVRoCxTFQDvyQEzdo:1733127486'.
-// A prefix scan with this cursor will locate the specific key where
+// startCursor may look like 'feed:tQpnEDVRoCxTFQDvyQEzdo:1733127486'.
+// A prefix scan with this cursor will locate the specific key where
// the previous iteration stopped.
err = db.badger.View(func(txn *badger.Txn) error {
it := txn.NewIterator(opts)
@@ -471,22 +467,22 @@ err = db.badger.View(func(txn *badger.Txn) error {
// Prefix example 'feed:tQpnEDVRoCxTFQDvyQEzdo'
// if no cursor provided prefix scan starts from the beginning
p := prefix
- if startCursor != nil {
+ if startCursor != nil {
p = startCursor
}
iterNum := 0 // Tracks the number of iterations to enforce the limit.
for it.Seek(p); it.ValidForPrefix(p); it.Next() {
- // The method it.ValidForPrefix ensures that iteration continues
- // as long as keys match the prefix.
- // For example, if p = 'feed:tQpnEDVRoCxTFQDvyQEzdo:1733127486',
- // it matches keys like
+ // The method it.ValidForPrefix ensures that iteration continues
+ // as long as keys match the prefix.
+ // For example, if p = 'feed:tQpnEDVRoCxTFQDvyQEzdo:1733127486',
+ // it matches keys like
// 'feed:tQpnEDVRoCxTFQDvyQEzdo:1733127889:pprRrNL2WP4yfVXsSNBSx6'.
-
- // Once the starting point for iteration is found, revert the prefix
+
+ // Once the starting point for iteration is found, revert the prefix
// back to 'feed:tQpnEDVRoCxTFQDvyQEzdo' to continue iterating sequentially.
// Otherwise, iteration would stop after a single prefix-key match.
- p = prefix
-
+ p = prefix
+
item := it.Item()
key := string(item.Key())
@@ -504,7 +500,7 @@ err = db.badger.View(func(txn *badger.Txn) error {
return err
}
}
- // If the number of iterations is less than the limit,
+ // If the number of iterations is less than the limit,
// it means there are no more items for the prefix.
if iterNum < limit {
nextCursor = ""
@@ -515,12 +511,12 @@ return nextCursor, err
```
### Key-only iteration
-Badger supports a unique mode of iteration called _key-only_ iteration. It is
-several order of magnitudes faster than regular iteration, because it involves
-access to the LSM-tree only, which is usually resident entirely in RAM. To
-enable key-only iteration, you need to set the `IteratorOptions.PrefetchValues`
-field to `false`. This can also be used to do sparse reads for selected keys
-during an iteration, by calling `item.Value()` only when required.
+
+Badger supports a unique mode of iteration called _key-only_ iteration. It is several order of
+magnitudes faster than regular iteration, because it involves access to the LSM-tree only, which is
+usually resident entirely in RAM. To enable key-only iteration, you need to set the
+`IteratorOptions.PrefetchValues` field to `false`. This can also be used to do sparse reads for
+selected keys during an iteration, by calling `item.Value()` only when required.
```go
err := db.View(func(txn *badger.Txn) error {
@@ -538,28 +534,25 @@ err := db.View(func(txn *badger.Txn) error {
```
## Stream
-Badger provides a Stream framework, which concurrently iterates over all or a
-portion of the DB, converting data into custom key-values, and streams it out
-serially to be sent over network, written to disk, or even written back to
-Badger. This is a lot faster way to iterate over Badger than using a single
-Iterator. Stream supports Badger in both managed and normal mode.
-Stream uses the natural boundaries created by SSTables within the LSM tree, to
-quickly generate key ranges. Each goroutine then picks a range and runs an
-iterator to iterate over it. Each iterator iterates over all versions of values
-and is created from the same transaction, thus working over a snapshot of the
-DB. Every time a new key is encountered, it calls `ChooseKey(item)`, followed
-by `KeyToList(key, itr)`. This allows a user to select or reject that key, and
-if selected, convert the value versions into custom key-values. The goroutine
-batches up 4MB worth of key-values, before sending it over to a channel.
-Another goroutine further batches up data from this channel using *smart
-batching* algorithm and calls `Send` serially.
+Badger provides a Stream framework, which concurrently iterates over all or a portion of the DB,
+converting data into custom key-values, and streams it out serially to be sent over network, written
+to disk, or even written back to Badger. This is a lot faster way to iterate over Badger than using
+a single Iterator. Stream supports Badger in both managed and normal mode.
-This framework is designed for high throughput key-value iteration, spreading
-the work of iteration across many goroutines. `DB.Backup` uses this framework to
-provide full and incremental backups quickly. Dgraph is a heavy user of this
-framework. In fact, this framework was developed and used within Dgraph, before
-getting ported over to Badger.
+Stream uses the natural boundaries created by SSTables within the LSM tree, to quickly generate key
+ranges. Each goroutine then picks a range and runs an iterator to iterate over it. Each iterator
+iterates over all versions of values and is created from the same transaction, thus working over a
+snapshot of the DB. Every time a new key is encountered, it calls `ChooseKey(item)`, followed by
+`KeyToList(key, itr)`. This allows a user to select or reject that key, and if selected, convert the
+value versions into custom key-values. The goroutine batches up 4MB worth of key-values, before
+sending it over to a channel. Another goroutine further batches up data from this channel using
+_smart batching_ algorithm and calls `Send` serially.
+
+This framework is designed for high throughput key-value iteration, spreading the work of iteration
+across many goroutines. `DB.Backup` uses this framework to provide full and incremental backups
+quickly. Dgraph is a heavy user of this framework. In fact, this framework was developed and used
+within Dgraph, before getting ported over to Badger.
```go
stream := db.NewStream()
@@ -595,51 +588,52 @@ if err := stream.Orchestrate(context.Background()); err != nil {
```
## Garbage Collection
+
Badger values need to be garbage collected, because of two reasons:
-* Badger keeps values separately from the LSM tree. This means that the compaction operations
-that clean up the LSM tree do not touch the values at all. Values need to be cleaned up
-separately.
+- Badger keeps values separately from the LSM tree. This means that the compaction operations that
+ clean up the LSM tree do not touch the values at all. Values need to be cleaned up separately.
-* Concurrent read/write transactions could leave behind multiple values for a single key, because they
-are stored with different versions. These could accumulate, and take up unneeded space beyond the
-time these older versions are needed.
+- Concurrent read/write transactions could leave behind multiple values for a single key, because
+ they are stored with different versions. These could accumulate, and take up unneeded space beyond
+ the time these older versions are needed.
Badger relies on the client to perform garbage collection at a time of their choosing. It provides
the following method, which can be invoked at an appropriate time:
-* `DB.RunValueLogGC()`: This method is designed to do garbage collection while
- Badger is online. Along with randomly picking a file, it uses statistics generated by the
- LSM-tree compactions to pick files that are likely to lead to maximum space
- reclamation. It is recommended to be called during periods of low activity in
- your system, or periodically. One call would only result in removal of at max
- one log file. As an optimization, you could also immediately re-run it whenever
+- `DB.RunValueLogGC()`: This method is designed to do garbage collection while Badger is online.
+ Along with randomly picking a file, it uses statistics generated by the LSM-tree compactions to
+ pick files that are likely to lead to maximum space reclamation. It is recommended to be called
+ during periods of low activity in your system, or periodically. One call would only result in
+ removal of at max one log file. As an optimization, you could also immediately re-run it whenever
it returns nil error (indicating a successful value log GC), as shown below.
- ```go
- ticker := time.NewTicker(5 * time.Minute)
- defer ticker.Stop()
- for range ticker.C {
- again:
- err := db.RunValueLogGC(0.7)
- if err == nil {
- goto again
- }
- }
- ```
+ ```go
+ ticker := time.NewTicker(5 * time.Minute)
+ defer ticker.Stop()
+ for range ticker.C {
+ again:
+ err := db.RunValueLogGC(0.7)
+ if err == nil {
+ goto again
+ }
+ }
+ ```
-* `DB.PurgeOlderVersions()`: This method is **DEPRECATED** since v1.5.0. Now, Badger's LSM tree automatically discards older/invalid versions of keys.
+- `DB.PurgeOlderVersions()`: This method is **DEPRECATED** since v1.5.0. Now, Badger's LSM tree
+ automatically discards older/invalid versions of keys.
-{{% notice "note" %}} The RunValueLogGC method would not garbage collect the latest value log.{{% /notice %}}
+{{% notice "note" %}} The RunValueLogGC method would not garbage collect the latest value
+log.{{% /notice %}}
## Database backup
-There are two public API methods `DB.Backup()` and `DB.Load()` which can be
-used to do online backups and restores. Badger v0.9 provides a CLI tool
-`badger`, which can do offline backup/restore. Make sure you have `$GOPATH/bin`
-in your PATH to use this tool.
-The command below will create a version-agnostic backup of the database, to a
-file `badger.bak` in the current working directory
+There are two public API methods `DB.Backup()` and `DB.Load()` which can be used to do online
+backups and restores. Badger v0.9 provides a CLI tool `badger`, which can do offline backup/restore.
+Make sure you have `$GOPATH/bin` in your PATH to use this tool.
+
+The command below will create a version-agnostic backup of the database, to a file `badger.bak` in
+the current working directory
```sh
badger backup --dir
@@ -653,19 +647,19 @@ badger restore --dir
See `badger --help` for more details.
-If you have a Badger database that was created using v0.8 (or below), you can
-use the `badger_backup` tool provided in v0.8.1, and then restore it using the
-command above to upgrade your database to work with the latest version.
+If you have a Badger database that was created using v0.8 (or below), you can use the
+`badger_backup` tool provided in v0.8.1, and then restore it using the command above to upgrade your
+database to work with the latest version.
```sh
badger_backup --dir --backup-file badger.bak
```
-We recommend all users to use the `Backup` and `Restore` APIs and tools. However,
-Badger is also rsync-friendly because all files are immutable, barring the
-latest value log which is append-only. So, rsync can be used as rudimentary way
-to perform a backup. In the following script, we repeat rsync to ensure that the
-LSM tree remains consistent with the MANIFEST file while doing a full backup.
+We recommend all users to use the `Backup` and `Restore` APIs and tools. However, Badger is also
+rsync-friendly because all files are immutable, barring the latest value log which is append-only.
+So, rsync can be used as rudimentary way to perform a backup. In the following script, we repeat
+rsync to ensure that the LSM tree remains consistent with the MANIFEST file while doing a full
+backup.
```sh
#!/bin/bash
@@ -678,17 +672,16 @@ while !! | grep -q "(MANIFEST\|\.sst)$"; do :; done
```
## Memory usage
-Badger's memory usage can be managed by tweaking several options available in
-the `Options` struct that is passed in when opening the database using
-`DB.Open`.
+
+Badger's memory usage can be managed by tweaking several options available in the `Options` struct
+that is passed in when opening the database using `DB.Open`.
- Number of memtables (`Options.NumMemtables`)
- If you modify `Options.NumMemtables`, also adjust `Options.NumLevelZeroTables` and
- `Options.NumLevelZeroTablesStall` accordingly.
+ `Options.NumLevelZeroTablesStall` accordingly.
- Number of concurrent compactions (`Options.NumCompactors`)
- Size of table (`Options.BaseTableSize`)
- Size of value log file (`Options.ValueLogFileSize`)
-If you want to decrease the memory usage of Badger instance, tweak these
-options (ideally one at a time) until you achieve the desired
-memory usage.
+If you want to decrease the memory usage of Badger instance, tweak these options (ideally one at a
+time) until you achieve the desired memory usage.
diff --git a/docs/content/projects-using-badger/index.md b/docs/content/projects-using-badger/index.md
index c13954d..cbb9191 100644
--- a/docs/content/projects-using-badger/index.md
+++ b/docs/content/projects-using-badger/index.md
@@ -5,60 +5,105 @@ aliases = ["/project-using-badger"]
Below is a list of known projects that use Badger:
-* [Dgraph](https://github.com/dgraph-io/dgraph) - Distributed graph database.
-* [Jaeger](https://github.com/jaegertracing/jaeger) - Distributed tracing platform.
-* [go-ipfs](https://github.com/ipfs/go-ipfs) - Go client for the InterPlanetary File System (IPFS), a new hypermedia distribution protocol.
-* [Riot](https://github.com/go-ego/riot) - An open-source, distributed search engine.
-* [emitter](https://github.com/emitter-io/emitter) - Scalable, low latency, distributed pub/sub broker with message storage, uses MQTT, gossip and badger.
-* [OctoSQL](https://github.com/cube2222/octosql) - Query tool that allows you to join, analyse and transform data from multiple databases using SQL.
-* [Dkron](https://dkron.io/) - Distributed, fault tolerant job scheduling system.
-* [smallstep/certificates](https://github.com/smallstep/certificates) - Step-ca is an online certificate authority for secure, automated certificate management.
-* [Sandglass](https://github.com/celrenheit/sandglass) - distributed, horizontally scalable, persistent, time sorted message queue.
-* [TalariaDB](https://github.com/grab/talaria) - Grab's Distributed, low latency time-series database.
-* [Sloop](https://github.com/salesforce/sloop) - Salesforce's Kubernetes History Visualization Project.
-* [Usenet Express](https://usenetexpress.com/) - Serving over 300TB of data with Badger.
-* [gorush](https://github.com/appleboy/gorush) - A push notification server written in Go.
-* [0-stor](https://github.com/zero-os/0-stor) - Single device object store.
-* [Dispatch Protocol](https://github.com/dispatchlabs/disgo) - Blockchain protocol for distributed application data analytics.
-* [GarageMQ](https://github.com/valinurovam/garagemq) - AMQP server written in Go.
-* [RedixDB](https://alash3al.github.io/redix/) - A real-time persistent key-value store with the same redis protocol.
-* [BBVA](https://github.com/BBVA/raft-badger) - Raft backend implementation using BadgerDB for Hashicorp raft.
-* [Fantom](https://github.com/Fantom-foundation/go-lachesis) - aBFT Consensus platform for distributed applications.
-* [decred](https://github.com/decred/dcrdata) - An open, progressive, and self-funding cryptocurrency with a system of community-based governance integrated into its blockchain.
-* [OpenNetSys](https://github.com/opennetsys/c3-go) - Create useful dApps in any software language.
-* [HoneyTrap](https://github.com/honeytrap/honeytrap) - An extensible and opensource system for running, monitoring and managing honeypots.
-* [Insolar](https://github.com/insolar/insolar) - Enterprise-ready blockchain platform.
-* [IoTeX](https://github.com/iotexproject/iotex-core) - The next generation of the decentralized network for IoT powered by scalability- and privacy-centric blockchains.
-* [go-sessions](https://github.com/kataras/go-sessions) - The sessions manager for Go net/http and fasthttp.
-* [Babble](https://github.com/mosaicnetworks/babble) - BFT Consensus platform for distributed applications.
-* [Tormenta](https://github.com/jpincas/tormenta) - Embedded object-persistence layer / simple JSON database for Go projects.
-* [BadgerHold](https://github.com/timshannon/badgerhold) - An embeddable NoSQL store for querying Go types built on Badger
-* [Goblero](https://github.com/didil/goblero) - Pure Go embedded persistent job queue backed by BadgerDB
-* [Surfline](https://www.surfline.com) - Serving global wave and weather forecast data with Badger.
-* [Cete](https://github.com/mosuka/cete) - Simple and highly available distributed key-value store built on Badger. Makes it easy bringing up a cluster of Badger with Raft consensus algorithm by hashicorp/raft.
-* [Volument](https://volument.com/) - A new take on website analytics backed by Badger.
-* [KVdb](https://kvdb.io/) - Hosted key-value store and serverless platform built on top of Badger.
-* [Terminotes](https://gitlab.com/asad-awadia/terminotes) - Self hosted notes storage and search server - storage powered by BadgerDB
-* [Pyroscope](https://github.com/pyroscope-io/pyroscope) - Open source continuous profiling platform built with BadgerDB
-* [Veri](https://github.com/bgokden/veri) - A distributed feature store optimized for Search and Recommendation tasks.
-* [bIter](https://github.com/MikkelHJuul/bIter) - A library and Iterator interface for working with the `badger.Iterator`, simplifying from-to, and prefix mechanics.
-* [ld](https://github.com/MikkelHJuul/ld) - (Lean Database) A very simple gRPC-only key-value database, exposing BadgerDB with key-range scanning semantics.
-* [Souin](https://github.com/darkweak/Souin) - A RFC compliant HTTP cache with lot of other features based on Badger for the storage. Compatible with all existing reverse-proxies.
-* [Xuperchain](https://github.com/xuperchain/xupercore) - A highly flexible blockchain architecture with great transaction performance.
-* [m2](https://github.com/qichengzx/m2) - A simple http key/value store based on the raft protocol.
-* [chaindb](https://github.com/ChainSafe/chaindb) - A blockchain storage layer used by [Gossamer](https://chainsafe.github.io/gossamer/), a Go client for the [Polkadot Network](https://polkadot.network/).
-* [vxdb](https://github.com/vitalvas/vxdb) - Simple schema-less Key-Value NoSQL database with simplest API interface.
-* [Opacity](https://github.com/opacity/storage-node) - Backend implementation for the Opacity storage project
-* [Vephar](https://github.com/vaccovecrana/vephar) - A minimal key/value store using hashicorp-raft for cluster coordination and Badger for data storage.
-* [gowarcserver](https://github.com/nlnwa/gowarcserver) - Open-source server for warc files. Can be used in conjunction with pywb
-* [flow-go](https://github.com/onflow/flow-go) - A fast, secure, and developer-friendly blockchain built to support the next generation of games, apps and the digital assets that power them.
-* [Wrgl](https://www.wrgl.co) - A data version control system that works like Git but specialized to store and diff CSV.
-* [Loggie](https://github.com/loggie-io/loggie) - A lightweight, cloud-native data transfer agent and aggregator.
-* [raft-badger](https://github.com/rfyiamcool/raft-badger) - raft-badger implements LogStore and StableStore Interface of hashcorp/raft. it is used to store raft log and metadata of hashcorp/raft.
-* [DVID](https://github.com/janelia-flyem/dvid) - A dataservice for branched versioning of a variety of data types. Originally created for large-scale brain reconstructions in Connectomics.
-* [KVS](https://github.com/tauraamui/kvs) - A library for making it easy to persist, load and query full structs into BadgerDB, using an ownership hierarchy model.
-* [LLS](https://github.com/Boc-chi-no/LLS) - LLS is an efficient URL Shortener that can be used to shorten links and track link usage. Support for BadgerDB and MongoDB. Improved performance by more than 30% when using BadgerDB
-* [ActionManager](https://mftlabs.io/actionmanager) - A dynamic entity manager based on rjsf schema and badger db
-* [MightyMap](https://github.com/thisisdevelopment/mightymap) - Mightymap: Conveys both robustness and high capability, fitting for a powerful concurrent map.
+- [Dgraph](https://github.com/dgraph-io/dgraph) - Distributed graph database.
+- [Jaeger](https://github.com/jaegertracing/jaeger) - Distributed tracing platform.
+- [go-ipfs](https://github.com/ipfs/go-ipfs) - Go client for the InterPlanetary File System (IPFS),
+ a new hypermedia distribution protocol.
+- [Riot](https://github.com/go-ego/riot) - An open-source, distributed search engine.
+- [emitter](https://github.com/emitter-io/emitter) - Scalable, low latency, distributed pub/sub
+ broker with message storage, uses MQTT, gossip and badger.
+- [OctoSQL](https://github.com/cube2222/octosql) - Query tool that allows you to join, analyse and
+ transform data from multiple databases using SQL.
+- [Dkron](https://dkron.io/) - Distributed, fault tolerant job scheduling system.
+- [smallstep/certificates](https://github.com/smallstep/certificates) - Step-ca is an online
+ certificate authority for secure, automated certificate management.
+- [Sandglass](https://github.com/celrenheit/sandglass) - distributed, horizontally scalable,
+ persistent, time sorted message queue.
+- [TalariaDB](https://github.com/grab/talaria) - Grab's Distributed, low latency time-series
+ database.
+- [Sloop](https://github.com/salesforce/sloop) - Salesforce's Kubernetes History Visualization
+ Project.
+- [Usenet Express](https://usenetexpress.com/) - Serving over 300TB of data with Badger.
+- [gorush](https://github.com/appleboy/gorush) - A push notification server written in Go.
+- [0-stor](https://github.com/zero-os/0-stor) - Single device object store.
+- [Dispatch Protocol](https://github.com/dispatchlabs/disgo) - Blockchain protocol for distributed
+ application data analytics.
+- [GarageMQ](https://github.com/valinurovam/garagemq) - AMQP server written in Go.
+- [RedixDB](https://alash3al.github.io/redix/) - A real-time persistent key-value store with the
+ same redis protocol.
+- [BBVA](https://github.com/BBVA/raft-badger) - Raft backend implementation using BadgerDB for
+ Hashicorp raft.
+- [Fantom](https://github.com/Fantom-foundation/go-lachesis) - aBFT Consensus platform for
+ distributed applications.
+- [decred](https://github.com/decred/dcrdata) - An open, progressive, and self-funding
+ cryptocurrency with a system of community-based governance integrated into its blockchain.
+- [OpenNetSys](https://github.com/opennetsys/c3-go) - Create useful dApps in any software language.
+- [HoneyTrap](https://github.com/honeytrap/honeytrap) - An extensible and opensource system for
+ running, monitoring and managing honeypots.
+- [Insolar](https://github.com/insolar/insolar) - Enterprise-ready blockchain platform.
+- [IoTeX](https://github.com/iotexproject/iotex-core) - The next generation of the decentralized
+ network for IoT powered by scalability- and privacy-centric blockchains.
+- [go-sessions](https://github.com/kataras/go-sessions) - The sessions manager for Go net/http and
+ fasthttp.
+- [Babble](https://github.com/mosaicnetworks/babble) - BFT Consensus platform for distributed
+ applications.
+- [Tormenta](https://github.com/jpincas/tormenta) - Embedded object-persistence layer / simple JSON
+ database for Go projects.
+- [BadgerHold](https://github.com/timshannon/badgerhold) - An embeddable NoSQL store for querying Go
+ types built on Badger
+- [Goblero](https://github.com/didil/goblero) - Pure Go embedded persistent job queue backed by
+ BadgerDB
+- [Surfline](https://www.surfline.com) - Serving global wave and weather forecast data with Badger.
+- [Cete](https://github.com/mosuka/cete) - Simple and highly available distributed key-value store
+ built on Badger. Makes it easy bringing up a cluster of Badger with Raft consensus algorithm by
+ hashicorp/raft.
+- [Volument](https://volument.com/) - A new take on website analytics backed by Badger.
+- [KVdb](https://kvdb.io/) - Hosted key-value store and serverless platform built on top of Badger.
+- [Terminotes](https://gitlab.com/asad-awadia/terminotes) - Self hosted notes storage and search
+ server - storage powered by BadgerDB
+- [Pyroscope](https://github.com/pyroscope-io/pyroscope) - Open source continuous profiling platform
+ built with BadgerDB
+- [Veri](https://github.com/bgokden/veri) - A distributed feature store optimized for Search and
+ Recommendation tasks.
+- [bIter](https://github.com/MikkelHJuul/bIter) - A library and Iterator interface for working with
+ the `badger.Iterator`, simplifying from-to, and prefix mechanics.
+- [ld](https://github.com/MikkelHJuul/ld) - (Lean Database) A very simple gRPC-only key-value
+ database, exposing BadgerDB with key-range scanning semantics.
+- [Souin](https://github.com/darkweak/Souin) - A RFC compliant HTTP cache with lot of other features
+ based on Badger for the storage. Compatible with all existing reverse-proxies.
+- [Xuperchain](https://github.com/xuperchain/xupercore) - A highly flexible blockchain architecture
+ with great transaction performance.
+- [m2](https://github.com/qichengzx/m2) - A simple http key/value store based on the raft protocol.
+- [chaindb](https://github.com/ChainSafe/chaindb) - A blockchain storage layer used by
+ [Gossamer](https://chainsafe.github.io/gossamer/), a Go client for the
+ [Polkadot Network](https://polkadot.network/).
+- [vxdb](https://github.com/vitalvas/vxdb) - Simple schema-less Key-Value NoSQL database with
+ simplest API interface.
+- [Opacity](https://github.com/opacity/storage-node) - Backend implementation for the Opacity
+ storage project
+- [Vephar](https://github.com/vaccovecrana/vephar) - A minimal key/value store using hashicorp-raft
+ for cluster coordination and Badger for data storage.
+- [gowarcserver](https://github.com/nlnwa/gowarcserver) - Open-source server for warc files. Can be
+ used in conjunction with pywb
+- [flow-go](https://github.com/onflow/flow-go) - A fast, secure, and developer-friendly blockchain
+ built to support the next generation of games, apps and the digital assets that power them.
+- [Wrgl](https://www.wrgl.co) - A data version control system that works like Git but specialized to
+ store and diff CSV.
+- [Loggie](https://github.com/loggie-io/loggie) - A lightweight, cloud-native data transfer agent
+ and aggregator.
+- [raft-badger](https://github.com/rfyiamcool/raft-badger) - raft-badger implements LogStore and
+ StableStore Interface of hashcorp/raft. it is used to store raft log and metadata of
+ hashcorp/raft.
+- [DVID](https://github.com/janelia-flyem/dvid) - A dataservice for branched versioning of a variety
+ of data types. Originally created for large-scale brain reconstructions in Connectomics.
+- [KVS](https://github.com/tauraamui/kvs) - A library for making it easy to persist, load and query
+ full structs into BadgerDB, using an ownership hierarchy model.
+- [LLS](https://github.com/Boc-chi-no/LLS) - LLS is an efficient URL Shortener that can be used to
+ shorten links and track link usage. Support for BadgerDB and MongoDB. Improved performance by more
+ than 30% when using BadgerDB
+- [ActionManager](https://mftlabs.io/actionmanager) - A dynamic entity manager based on rjsf schema
+ and badger db
+- [MightyMap](https://github.com/thisisdevelopment/mightymap) - Mightymap: Conveys both robustness
+ and high capability, fitting for a powerful concurrent map.
If you are using Badger in a project please send a pull request to add it to the list.
diff --git a/docs/content/resources/index.md b/docs/content/resources/index.md
index b7ec20d..7e270f2 100644
--- a/docs/content/resources/index.md
+++ b/docs/content/resources/index.md
@@ -3,18 +3,20 @@ title = "Resources"
aliases = ["/resouces"]
+++
-
## Blog Posts
-1. [Introducing Badger: A fast key-value store written natively in
-Go](https://open.dgraph.io/post/badger/)
+
+1. [Introducing Badger: A fast key-value store written natively in Go](https://open.dgraph.io/post/badger/)
2. [Make Badger crash resilient with ALICE](https://blog.dgraph.io/post/alice/)
3. [Badger vs LMDB vs BoltDB: Benchmarking key-value databases in Go](https://blog.dgraph.io/post/badger-lmdb-boltdb/)
4. [Concurrent ACID Transactions in Badger](https://blog.dgraph.io/post/badger-txn/)
## Contact
-- Please use [discuss.dgraph.io](https://discuss.dgraph.io) for questions, bugs, feature requests, and discussions.
+
+- Please use [discuss.dgraph.io](https://discuss.dgraph.io) for questions, bugs, feature requests,
+ and discussions.
- Follow us on Twitter [@dgraphlabs](https://twitter.com/dgraphlabs).
## Contributing
-If you're interested in contributing to Badger see [CONTRIBUTING.md](https://github.com/dgraph-io/badger/blob/main/CONTRIBUTING.md).
+If you're interested in contributing to Badger see
+[CONTRIBUTING.md](https://github.com/dgraph-io/badger/blob/main/CONTRIBUTING.md).
diff --git a/docs/scripts/build.sh b/docs/scripts/build.sh
index f6b9a81..19da588 100755
--- a/docs/scripts/build.sh
+++ b/docs/scripts/build.sh
@@ -38,7 +38,7 @@ joinVersions() {
function version { echo "$@" | gawk -F. '{ printf("%03d%03d%03d\n", $1,$2,$3); }'; }
rebuild() {
- echo -e "$(date) $GREEN Updating docs for branch: $1.$RESET"
+ echo -e "$(date) ${GREEN} Updating docs for branch: $1.${RESET}"
# The latest documentation is generated in the root of /public dir
# Older documentations are generated in their respective `/public/vx.x.x` dirs
@@ -52,32 +52,30 @@ rebuild() {
export CURRENT_BRANCH=${1}
export CURRENT_VERSION=${2}
export VERSIONS=${VERSION_STRING}
-
- HUGO_TITLE="Badger Doc ${2}"\
- VERSIONS=${VERSION_STRING}\
- CURRENT_BRANCH=${1}\
+
+ HUGO_TITLE="Badger Doc ${2}" \
+ VERSIONS=${VERSION_STRING} \
+ CURRENT_BRANCH=${1} \
CURRENT_VERSION=${2} ${HUGO} \
- --destination="${PUBLIC}"/"$dir"\
- --baseURL="$HOST"/"$dir" 1> /dev/null
+ --destination="${PUBLIC}"/"${dir}" \
+ --baseURL="${HOST}"/"${dir}" 1>/dev/null
}
-branchUpdated()
-{
+branchUpdated() {
local branch="$1"
git checkout -q "$1"
UPSTREAM=$(git rev-parse "@{u}")
LOCAL=$(git rev-parse "@")
- if [ "$LOCAL" != "$UPSTREAM" ] ; then
- git merge -q origin/"$branch"
+ if [[ ${LOCAL} != "${UPSTREAM}" ]]; then
+ git merge -q origin/"${branch}"
return 0
else
return 1
fi
}
-publicFolder()
-{
+publicFolder() {
dir=''
if [[ $1 == "${VERSIONS_ARRAY[0]}" ]]; then
echo "${PUBLIC}"
@@ -86,63 +84,60 @@ publicFolder()
fi
}
-checkAndUpdate()
-{
+checkAndUpdate() {
local version="$1"
local branch=""
- if [[ $version == "master" ]]; then
+ if [[ ${version} == "master" ]]; then
branch="master"
else
- branch="release/$version"
+ branch="release/${version}"
fi
- if branchUpdated "$branch" ; then
- git merge -q origin/"$branch"
- rebuild "$branch" "$version"
+ if branchUpdated "${branch}"; then
+ git merge -q origin/"${branch}"
+ rebuild "${branch}" "${version}"
fi
- folder=$(publicFolder "$version")
- if [ "$firstRun" = 1 ] || [ "$themeUpdated" = 0 ] || [ ! -d "$folder" ] ; then
- rebuild "$branch" "$version"
+ folder=$(publicFolder "${version}")
+ if [[ ${firstRun} == 1 ]] || [[ ${themeUpdated} == 0 ]] || [[ ! -d ${folder} ]]; then
+ rebuild "${branch}" "${version}"
fi
}
-
firstRun=1
while true; do
# Lets move to the docs directory.
- pushd "$(dirname "$0")/.." > /dev/null
+ pushd "$(dirname "$0")/.." >/dev/null
currentBranch=$(git rev-parse --abbrev-ref HEAD)
# Lets check if the theme was updated.
- pushd themes/hugo-docs > /dev/null
- git remote update > /dev/null
+ pushd themes/hugo-docs >/dev/null
+ git remote update >/dev/null
themeUpdated=1
- if branchUpdated "master" ; then
- echo -e "$(date) $GREEN Theme has been updated. Now will update the docs.$RESET"
+ if branchUpdated "master"; then
+ echo -e "$(date) ${GREEN} Theme has been updated. Now will update the docs.${RESET}"
themeUpdated=0
fi
- popd > /dev/null
+ popd >/dev/null
# Now lets check the theme.
echo -e "$(date) Starting to check branches."
- git remote update > /dev/null
+ git remote update >/dev/null
- for version in "${VERSIONS_ARRAY[@]}"
- do
- checkAndUpdate "$version"
+ for version in "${VERSIONS_ARRAY[@]}"; do
+ checkAndUpdate "${version}"
done
echo -e "$(date) Done checking branches.\n"
- git checkout -q "$currentBranch"
- popd > /dev/null
+ git checkout -q "${currentBranch}"
+ popd >/dev/null
firstRun=0
- if ! $LOOP; then
- exit
- fi
+ if ! ${LOOP}; then
+ exit
+ fi
sleep 60
-done
\ No newline at end of file
+done
diff --git a/docs/scripts/local.sh b/docs/scripts/local.sh
index cdadc1d..5ede5f5 100755
--- a/docs/scripts/local.sh
+++ b/docs/scripts/local.sh
@@ -6,7 +6,7 @@ GREEN='\033[32;1m'
RESET='\033[0m'
VERSIONS_ARRAY=(
- 'preview'
+ 'preview'
)
joinVersions() {
@@ -16,40 +16,39 @@ joinVersions() {
VERSION_STRING=$(joinVersions)
-run() {
- export CURRENT_BRANCH="master"
- export CURRENT_VERSION=${VERSIONS_ARRAY[0]}
- export VERSIONS=${VERSION_STRING}
- export DGRAPH_ENDPOINT=${DGRAPH_ENDPOINT:-"https://play.dgraph.io/query?latency=true"}
+run() {
+ export CURRENT_BRANCH="master"
+ export CURRENT_VERSION=${VERSIONS_ARRAY[0]}
+ export VERSIONS=${VERSION_STRING}
+ export DGRAPH_ENDPOINT=${DGRAPH_ENDPOINT:-"https://play.dgraph.io/query?latency=true"}
+ export HUGO_TITLE="Badger Doc - Preview" \
+ export VERSIONS=${VERSION_STRING} \
+ export CURRENT_BRANCH="master" \
+ export CURRENT_VERSION=${CURRENT_VERSION}
- export HUGO_TITLE="Badger Doc - Preview" \
- export VERSIONS=${VERSION_STRING} \
- export CURRENT_BRANCH="master" \
- export CURRENT_VERSION=${CURRENT_VERSION}
+ pushd "$(dirname "$0")/.." >/dev/null
+ pushd themes >/dev/null
- pushd "$(dirname "$0")/.." > /dev/null
- pushd themes > /dev/null
+ if [[ ! -d "hugo-docs" ]]; then
+ echo -e "$(date) ${GREEN} Hugo-docs repository not found. Cloning the repo. ${RESET}"
+ git clone https://github.com/dgraph-io/hugo-docs.git
+ else
+ echo -e "$(date) ${GREEN} Hugo-docs repository found. Pulling the latest version from master. ${RESET}"
+ pushd hugo-docs >/dev/null
+ git pull
+ popd >/dev/null
+ fi
+ popd >/dev/null
- if [ ! -d "hugo-docs" ]; then
- echo -e "$(date) $GREEN Hugo-docs repository not found. Cloning the repo. $RESET"
- git clone https://github.com/dgraph-io/hugo-docs.git
- else
- echo -e "$(date) $GREEN Hugo-docs repository found. Pulling the latest version from master. $RESET"
- pushd hugo-docs > /dev/null
- git pull
- popd > /dev/null
- fi
- popd > /dev/null
-
- if [[ $1 == "-p" || $1 == "--preview" ]]; then
- echo -e "$(date) $GREEN Generating documentation static pages in the public folder. $RESET"
- hugo --destination=public --baseURL="$2" 1> /dev/null
- echo -e "$(date) $GREEN Done building. $RESET"
- else
- hugo server -w --baseURL=http://localhost:1313
- fi
- popd > /dev/null
+ if [[ $1 == "-p" || $1 == "--preview" ]]; then
+ echo -e "$(date) ${GREEN} Generating documentation static pages in the public folder. ${RESET}"
+ hugo --destination=public --baseURL="$2" 1>/dev/null
+ echo -e "$(date) ${GREEN} Done building. ${RESET}"
+ else
+ hugo server -w --baseURL=http://localhost:1313
+ fi
+ popd >/dev/null
}
-run "$1" "$2"
\ No newline at end of file
+run "$1" "$2"
diff --git a/docs/static/images/diggy-shadow.png b/docs/static/images/diggy-shadow.png
index 19ba3f2..d0e9b70 100644
Binary files a/docs/static/images/diggy-shadow.png and b/docs/static/images/diggy-shadow.png differ
diff --git a/docs/themes/hugo-docs/LICENSE.md b/docs/themes/hugo-docs/LICENSE.md
index bab5bbb..1336985 100644
--- a/docs/themes/hugo-docs/LICENSE.md
+++ b/docs/themes/hugo-docs/LICENSE.md
@@ -1,21 +1,18 @@
The MIT License (MIT)
-Copyright (c) 2014 Grav
-Copyright (c) 2016 MATHIEU CORNIC
+Copyright (c) 2014 Grav Copyright (c) 2016 MATHIEU CORNIC
-Permission is hereby granted, free of charge, to any person obtaining a copy of
-this software and associated documentation files (the "Software"), to deal in
-the Software without restriction, including without limitation the rights to
-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
-the Software, and to permit persons to whom the Software is furnished to do so,
-subject to the following conditions:
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
+associated documentation files (the "Software"), to deal in the Software without restriction,
+including without limitation the rights to use, copy, modify, merge, publish, distribute,
+sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
+The above copyright notice and this permission notice shall be included in all copies or substantial
+portions of the Software.
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
-FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
-COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
-IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT
+NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES
+OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/docs/themes/hugo-docs/images/screenshot.png b/docs/themes/hugo-docs/images/screenshot.png
index 292d578..e4bfb96 100644
Binary files a/docs/themes/hugo-docs/images/screenshot.png and b/docs/themes/hugo-docs/images/screenshot.png differ
diff --git a/docs/themes/hugo-docs/images/tn.png b/docs/themes/hugo-docs/images/tn.png
index 158c8be..2ccc485 100644
Binary files a/docs/themes/hugo-docs/images/tn.png and b/docs/themes/hugo-docs/images/tn.png differ
diff --git a/docs/themes/hugo-docs/static/css/theme.css b/docs/themes/hugo-docs/static/css/theme.css
index 9d77ab4..a98670a 100644
--- a/docs/themes/hugo-docs/static/css/theme.css
+++ b/docs/themes/hugo-docs/static/css/theme.css
@@ -191,19 +191,11 @@ pre.collapsed .showmore {
padding-bottom: 5px;
padding-top: 26px;
cursor: pointer;
- background: linear-gradient(
- 180deg,
- hsla(0, 0%, 100%, 0.1),
- rgba(226, 226, 226, 0.72)
- );
+ background: linear-gradient(180deg, hsla(0, 0%, 100%, 0.1), rgba(226, 226, 226, 0.72));
color: #5a5a5a;
}
pre.collapsed .showmore:hover {
- background: linear-gradient(
- 180deg,
- hsla(0, 0%, 100%, 0.1),
- rgba(226, 226, 226, 0.91)
- );
+ background: linear-gradient(180deg, hsla(0, 0%, 100%, 0.1), rgba(226, 226, 226, 0.91));
font-weight: 600;
}
pre.collapsed .showmore span {
@@ -695,7 +687,8 @@ section.toc .section-item {
font-size: 1rem;
font-weight: bold;
}
-.landing .item h3:hover, .landing .item .cta:hover {
+.landing .item h3:hover,
+.landing .item .cta:hover {
text-decoration: underline;
}
diff --git a/docs/themes/hugo-docs/static/fonts/Inconsolata.svg b/docs/themes/hugo-docs/static/fonts/Inconsolata.svg
index b7f97c8..925c825 100644
--- a/docs/themes/hugo-docs/static/fonts/Inconsolata.svg
+++ b/docs/themes/hugo-docs/static/fonts/Inconsolata.svg
@@ -1,359 +1 @@
-
-
-
+
\ No newline at end of file
diff --git a/docs/themes/hugo-docs/static/fonts/Novecentosanswide-Normal-webfont.svg b/docs/themes/hugo-docs/static/fonts/Novecentosanswide-Normal-webfont.svg
index c412ea8..d7faba5 100644
--- a/docs/themes/hugo-docs/static/fonts/Novecentosanswide-Normal-webfont.svg
+++ b/docs/themes/hugo-docs/static/fonts/Novecentosanswide-Normal-webfont.svg
@@ -1,1019 +1 @@
-
-
-
\ No newline at end of file
+
\ No newline at end of file
diff --git a/docs/themes/hugo-docs/static/fonts/Novecentosanswide-UltraLight-webfont.svg b/docs/themes/hugo-docs/static/fonts/Novecentosanswide-UltraLight-webfont.svg
index e642ab0..a9f412f 100644
--- a/docs/themes/hugo-docs/static/fonts/Novecentosanswide-UltraLight-webfont.svg
+++ b/docs/themes/hugo-docs/static/fonts/Novecentosanswide-UltraLight-webfont.svg
@@ -1,918 +1 @@
-
-
-
\ No newline at end of file
+
\ No newline at end of file
diff --git a/docs/themes/hugo-docs/static/fonts/Work_Sans_200.svg b/docs/themes/hugo-docs/static/fonts/Work_Sans_200.svg
index 58ab4ba..8e426cf 100644
--- a/docs/themes/hugo-docs/static/fonts/Work_Sans_200.svg
+++ b/docs/themes/hugo-docs/static/fonts/Work_Sans_200.svg
@@ -1,332 +1 @@
-
-
-
+
\ No newline at end of file
diff --git a/docs/themes/hugo-docs/static/fonts/Work_Sans_300.svg b/docs/themes/hugo-docs/static/fonts/Work_Sans_300.svg
index f29d0c8..50620ae 100644
--- a/docs/themes/hugo-docs/static/fonts/Work_Sans_300.svg
+++ b/docs/themes/hugo-docs/static/fonts/Work_Sans_300.svg
@@ -1,331 +1 @@
-
-
-
+
\ No newline at end of file
diff --git a/docs/themes/hugo-docs/static/fonts/Work_Sans_500.svg b/docs/themes/hugo-docs/static/fonts/Work_Sans_500.svg
index 4b030b7..1bd4f27 100644
--- a/docs/themes/hugo-docs/static/fonts/Work_Sans_500.svg
+++ b/docs/themes/hugo-docs/static/fonts/Work_Sans_500.svg
@@ -1,333 +1 @@
-
-
-
+
\ No newline at end of file
diff --git a/docs/themes/hugo-docs/static/images/Screenshot from 2020-07-07 19-14-26.png b/docs/themes/hugo-docs/static/images/Screenshot from 2020-07-07 19-14-26.png
index aa45993..669ff00 100644
Binary files a/docs/themes/hugo-docs/static/images/Screenshot from 2020-07-07 19-14-26.png and b/docs/themes/hugo-docs/static/images/Screenshot from 2020-07-07 19-14-26.png differ
diff --git a/docs/themes/hugo-docs/static/images/badger.png b/docs/themes/hugo-docs/static/images/badger.png
index d6ca702..18780a4 100644
Binary files a/docs/themes/hugo-docs/static/images/badger.png and b/docs/themes/hugo-docs/static/images/badger.png differ
diff --git a/docs/themes/hugo-docs/static/images/badger.svg b/docs/themes/hugo-docs/static/images/badger.svg
index 68747cd..2a25f5b 100644
--- a/docs/themes/hugo-docs/static/images/badger.svg
+++ b/docs/themes/hugo-docs/static/images/badger.svg
@@ -1,15 +1 @@
-
\ No newline at end of file
+
\ No newline at end of file
diff --git a/docs/themes/hugo-docs/static/images/dgraph-black.png b/docs/themes/hugo-docs/static/images/dgraph-black.png
index 79c6487..51a0493 100644
Binary files a/docs/themes/hugo-docs/static/images/dgraph-black.png and b/docs/themes/hugo-docs/static/images/dgraph-black.png differ
diff --git a/docs/themes/hugo-docs/static/images/diggy-shadow.png b/docs/themes/hugo-docs/static/images/diggy-shadow.png
index 19ba3f2..d0e9b70 100644
Binary files a/docs/themes/hugo-docs/static/images/diggy-shadow.png and b/docs/themes/hugo-docs/static/images/diggy-shadow.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/android-chrome-144x144.png b/docs/themes/hugo-docs/static/images/favicons/android-chrome-144x144.png
index 89ee956..7193ebc 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/android-chrome-144x144.png and b/docs/themes/hugo-docs/static/images/favicons/android-chrome-144x144.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/android-chrome-192x192.png b/docs/themes/hugo-docs/static/images/favicons/android-chrome-192x192.png
index eaea408..26c006a 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/android-chrome-192x192.png and b/docs/themes/hugo-docs/static/images/favicons/android-chrome-192x192.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/android-chrome-36x36.png b/docs/themes/hugo-docs/static/images/favicons/android-chrome-36x36.png
index 2d7578e..4dd81f6 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/android-chrome-36x36.png and b/docs/themes/hugo-docs/static/images/favicons/android-chrome-36x36.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/android-chrome-48x48.png b/docs/themes/hugo-docs/static/images/favicons/android-chrome-48x48.png
index c75228a..81ed194 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/android-chrome-48x48.png and b/docs/themes/hugo-docs/static/images/favicons/android-chrome-48x48.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/android-chrome-72x72.png b/docs/themes/hugo-docs/static/images/favicons/android-chrome-72x72.png
index 563485c..154d413 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/android-chrome-72x72.png and b/docs/themes/hugo-docs/static/images/favicons/android-chrome-72x72.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/android-chrome-96x96.png b/docs/themes/hugo-docs/static/images/favicons/android-chrome-96x96.png
index 0cd6ca3..6728967 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/android-chrome-96x96.png and b/docs/themes/hugo-docs/static/images/favicons/android-chrome-96x96.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-114x114.png b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-114x114.png
index 1b50be8..2e14bef 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-114x114.png and b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-114x114.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-120x120.png b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-120x120.png
index 0bc8215..db9eda1 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-120x120.png and b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-120x120.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-144x144.png b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-144x144.png
index c8b5f9a..60999b9 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-144x144.png and b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-144x144.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-152x152.png b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-152x152.png
index 19ad539..50ef521 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-152x152.png and b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-152x152.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-180x180.png b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-180x180.png
index 4af2ddb..c4add71 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-180x180.png and b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-180x180.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-57x57.png b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-57x57.png
index f3c919d..41edf36 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-57x57.png and b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-57x57.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-60x60.png b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-60x60.png
index 6f7c03c..a53c799 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-60x60.png and b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-60x60.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-72x72.png b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-72x72.png
index 206695f..4412dfa 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-72x72.png and b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-72x72.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-76x76.png b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-76x76.png
index b9bfc49..25d1a9e 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-76x76.png and b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon-76x76.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon.png b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon.png
index 4af2ddb..c4add71 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon.png and b/docs/themes/hugo-docs/static/images/favicons/apple-touch-icon.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/favicon-16x16.png b/docs/themes/hugo-docs/static/images/favicons/favicon-16x16.png
index 7282864..616137f 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/favicon-16x16.png and b/docs/themes/hugo-docs/static/images/favicons/favicon-16x16.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/favicon-194x194.png b/docs/themes/hugo-docs/static/images/favicons/favicon-194x194.png
index 3667ce2..f1e788d 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/favicon-194x194.png and b/docs/themes/hugo-docs/static/images/favicons/favicon-194x194.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/favicon-32x32.png b/docs/themes/hugo-docs/static/images/favicons/favicon-32x32.png
index b4c9f90..d982031 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/favicon-32x32.png and b/docs/themes/hugo-docs/static/images/favicons/favicon-32x32.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/favicon-96x96.png b/docs/themes/hugo-docs/static/images/favicons/favicon-96x96.png
index a033e1a..dd1f772 100644
Binary files a/docs/themes/hugo-docs/static/images/favicons/favicon-96x96.png and b/docs/themes/hugo-docs/static/images/favicons/favicon-96x96.png differ
diff --git a/docs/themes/hugo-docs/static/images/favicons/manifest.json b/docs/themes/hugo-docs/static/images/favicons/manifest.json
index 355a75b..90cc790 100644
--- a/docs/themes/hugo-docs/static/images/favicons/manifest.json
+++ b/docs/themes/hugo-docs/static/images/favicons/manifest.json
@@ -1,41 +1,41 @@
{
- "name": "Dgraph",
- "icons": [
- {
- "src": "\/images\/favicons\/android-chrome-36x36.png",
- "sizes": "36x36",
- "type": "image\/png",
- "density": 0.75
- },
- {
- "src": "\/images\/favicons\/android-chrome-48x48.png",
- "sizes": "48x48",
- "type": "image\/png",
- "density": 1
- },
- {
- "src": "\/images\/favicons\/android-chrome-72x72.png",
- "sizes": "72x72",
- "type": "image\/png",
- "density": 1.5
- },
- {
- "src": "\/images\/favicons\/android-chrome-96x96.png",
- "sizes": "96x96",
- "type": "image\/png",
- "density": 2
- },
- {
- "src": "\/images\/favicons\/android-chrome-144x144.png",
- "sizes": "144x144",
- "type": "image\/png",
- "density": 3
- },
- {
- "src": "\/images\/favicons\/android-chrome-192x192.png",
- "sizes": "192x192",
- "type": "image\/png",
- "density": 4
- }
- ]
+ "name": "Dgraph",
+ "icons": [
+ {
+ "src": "\/images\/favicons\/android-chrome-36x36.png",
+ "sizes": "36x36",
+ "type": "image\/png",
+ "density": 0.75
+ },
+ {
+ "src": "\/images\/favicons\/android-chrome-48x48.png",
+ "sizes": "48x48",
+ "type": "image\/png",
+ "density": 1
+ },
+ {
+ "src": "\/images\/favicons\/android-chrome-72x72.png",
+ "sizes": "72x72",
+ "type": "image\/png",
+ "density": 1.5
+ },
+ {
+ "src": "\/images\/favicons\/android-chrome-96x96.png",
+ "sizes": "96x96",
+ "type": "image\/png",
+ "density": 2
+ },
+ {
+ "src": "\/images\/favicons\/android-chrome-144x144.png",
+ "sizes": "144x144",
+ "type": "image\/png",
+ "density": 3
+ },
+ {
+ "src": "\/images\/favicons\/android-chrome-192x192.png",
+ "sizes": "192x192",
+ "type": "image\/png",
+ "density": 4
+ }
+ ]
}
diff --git a/docs/themes/hugo-docs/static/images/favicons/safari-pinned-tab.svg b/docs/themes/hugo-docs/static/images/favicons/safari-pinned-tab.svg
index 1b044c3..b1116db 100644
--- a/docs/themes/hugo-docs/static/images/favicons/safari-pinned-tab.svg
+++ b/docs/themes/hugo-docs/static/images/favicons/safari-pinned-tab.svg
@@ -1,32 +1 @@
-
-
-
+
\ No newline at end of file
diff --git a/docs/themes/hugo-docs/static/js/clipboard.min.js b/docs/themes/hugo-docs/static/js/clipboard.min.js
index 000e4b4..812246d 100644
--- a/docs/themes/hugo-docs/static/js/clipboard.min.js
+++ b/docs/themes/hugo-docs/static/js/clipboard.min.js
@@ -4,4 +4,455 @@
*
* Licensed MIT © Zeno Rocha
*/
-!function(t){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=t();else if("function"==typeof define&&define.amd)define([],t);else{var e;e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:this,e.Clipboard=t()}}(function(){var t,e,n;return function t(e,n,r){function o(a,c){if(!n[a]){if(!e[a]){var s="function"==typeof require&&require;if(!c&&s)return s(a,!0);if(i)return i(a,!0);var u=new Error("Cannot find module '"+a+"'");throw u.code="MODULE_NOT_FOUND",u}var l=n[a]={exports:{}};e[a][0].call(l.exports,function(t){var n=e[a][1][t];return o(n?n:t)},l,l.exports,t,e,n,r)}return n[a].exports}for(var i="function"==typeof require&&require,a=0;ar;r++)n[r].fn.apply(n[r].ctx,e);return this},off:function(t,e){var n=this.e||(this.e={}),r=n[t],o=[];if(r&&e)for(var i=0,a=r.length;a>i;i++)r[i].fn!==e&&r[i].fn._!==e&&o.push(r[i]);return o.length?n[t]=o:delete n[t],this}},e.exports=r},{}],8:[function(t,e,n){"use strict";function r(t){return t&&t.__esModule?t:{"default":t}}function o(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}n.__esModule=!0;var i=function(){function t(t,e){for(var n=0;n r; r++) n[r].fn.apply(n[r].ctx, e)
+ return this
+ },
+ off: function (t, e) {
+ var n = this.e || (this.e = {}),
+ r = n[t],
+ o = []
+ if (r && e)
+ for (var i = 0, a = r.length; a > i; i++)
+ r[i].fn !== e && r[i].fn._ !== e && o.push(r[i])
+ return o.length ? (n[t] = o) : delete n[t], this
+ },
+ }),
+ (e.exports = r)
+ },
+ {},
+ ],
+ 8: [
+ function (t, e, n) {
+ "use strict"
+ function r(t) {
+ return t && t.__esModule ? t : { default: t }
+ }
+ function o(t, e) {
+ if (!(t instanceof e)) throw new TypeError("Cannot call a class as a function")
+ }
+ n.__esModule = !0
+ var i = (function () {
+ function t(t, e) {
+ for (var n = 0; n < e.length; n++) {
+ var r = e[n]
+ ;(r.enumerable = r.enumerable || !1),
+ (r.configurable = !0),
+ "value" in r && (r.writable = !0),
+ Object.defineProperty(t, r.key, r)
+ }
+ }
+ return function (e, n, r) {
+ return n && t(e.prototype, n), r && t(e, r), e
+ }
+ })(),
+ a = t("select"),
+ c = r(a),
+ s = (function () {
+ function t(e) {
+ o(this, t), this.resolveOptions(e), this.initSelection()
+ }
+ return (
+ (t.prototype.resolveOptions = function t() {
+ var e = arguments.length <= 0 || void 0 === arguments[0] ? {} : arguments[0]
+ ;(this.action = e.action),
+ (this.emitter = e.emitter),
+ (this.target = e.target),
+ (this.text = e.text),
+ (this.trigger = e.trigger),
+ (this.selectedText = "")
+ }),
+ (t.prototype.initSelection = function t() {
+ if (this.text && this.target)
+ throw new Error('Multiple attributes declared, use either "target" or "text"')
+ if (this.text) this.selectFake()
+ else {
+ if (!this.target)
+ throw new Error('Missing required attributes, use either "target" or "text"')
+ this.selectTarget()
+ }
+ }),
+ (t.prototype.selectFake = function t() {
+ var e = this
+ this.removeFake(),
+ (this.fakeHandler = document.body.addEventListener("click", function () {
+ return e.removeFake()
+ })),
+ (this.fakeElem = document.createElement("textarea")),
+ (this.fakeElem.style.position = "absolute"),
+ (this.fakeElem.style.left = "-9999px"),
+ (this.fakeElem.style.top =
+ (window.pageYOffset || document.documentElement.scrollTop) + "px"),
+ this.fakeElem.setAttribute("readonly", ""),
+ (this.fakeElem.value = this.text),
+ document.body.appendChild(this.fakeElem),
+ (this.selectedText = c.default(this.fakeElem)),
+ this.copyText()
+ }),
+ (t.prototype.removeFake = function t() {
+ this.fakeHandler &&
+ (document.body.removeEventListener("click"), (this.fakeHandler = null)),
+ this.fakeElem &&
+ (document.body.removeChild(this.fakeElem), (this.fakeElem = null))
+ }),
+ (t.prototype.selectTarget = function t() {
+ ;(this.selectedText = c.default(this.target)), this.copyText()
+ }),
+ (t.prototype.copyText = function t() {
+ var e = void 0
+ try {
+ e = document.execCommand(this.action)
+ } catch (n) {
+ e = !1
+ }
+ this.handleResult(e)
+ }),
+ (t.prototype.handleResult = function t(e) {
+ e
+ ? this.emitter.emit("success", {
+ action: this.action,
+ text: this.selectedText,
+ trigger: this.trigger,
+ clearSelection: this.clearSelection.bind(this),
+ })
+ : this.emitter.emit("error", {
+ action: this.action,
+ trigger: this.trigger,
+ clearSelection: this.clearSelection.bind(this),
+ })
+ }),
+ (t.prototype.clearSelection = function t() {
+ this.target && this.target.blur(), window.getSelection().removeAllRanges()
+ }),
+ (t.prototype.destroy = function t() {
+ this.removeFake()
+ }),
+ i(t, [
+ {
+ key: "action",
+ set: function t() {
+ var e =
+ arguments.length <= 0 || void 0 === arguments[0] ? "copy" : arguments[0]
+ if (((this._action = e), "copy" !== this._action && "cut" !== this._action))
+ throw new Error('Invalid "action" value, use either "copy" or "cut"')
+ },
+ get: function t() {
+ return this._action
+ },
+ },
+ {
+ key: "target",
+ set: function t(e) {
+ if (void 0 !== e) {
+ if (!e || "object" != typeof e || 1 !== e.nodeType)
+ throw new Error('Invalid "target" value, use a valid Element')
+ this._target = e
+ }
+ },
+ get: function t() {
+ return this._target
+ },
+ },
+ ]),
+ t
+ )
+ })()
+ ;(n.default = s), (e.exports = n.default)
+ },
+ { select: 6 },
+ ],
+ 9: [
+ function (t, e, n) {
+ "use strict"
+ function r(t) {
+ return t && t.__esModule ? t : { default: t }
+ }
+ function o(t, e) {
+ if (!(t instanceof e)) throw new TypeError("Cannot call a class as a function")
+ }
+ function i(t, e) {
+ if ("function" != typeof e && null !== e)
+ throw new TypeError(
+ "Super expression must either be null or a function, not " + typeof e,
+ )
+ ;(t.prototype = Object.create(e && e.prototype, {
+ constructor: { value: t, enumerable: !1, writable: !0, configurable: !0 },
+ })),
+ e && (Object.setPrototypeOf ? Object.setPrototypeOf(t, e) : (t.__proto__ = e))
+ }
+ function a(t, e) {
+ var n = "data-clipboard-" + t
+ if (e.hasAttribute(n)) return e.getAttribute(n)
+ }
+ n.__esModule = !0
+ var c = t("./clipboard-action"),
+ s = r(c),
+ u = t("tiny-emitter"),
+ l = r(u),
+ f = t("good-listener"),
+ d = r(f),
+ h = (function (t) {
+ function e(n, r) {
+ o(this, e), t.call(this), this.resolveOptions(r), this.listenClick(n)
+ }
+ return (
+ i(e, t),
+ (e.prototype.resolveOptions = function t() {
+ var e = arguments.length <= 0 || void 0 === arguments[0] ? {} : arguments[0]
+ ;(this.action = "function" == typeof e.action ? e.action : this.defaultAction),
+ (this.target = "function" == typeof e.target ? e.target : this.defaultTarget),
+ (this.text = "function" == typeof e.text ? e.text : this.defaultText)
+ }),
+ (e.prototype.listenClick = function t(e) {
+ var n = this
+ this.listener = d.default(e, "click", function (t) {
+ return n.onClick(t)
+ })
+ }),
+ (e.prototype.onClick = function t(e) {
+ var n = e.delegateTarget || e.currentTarget
+ this.clipboardAction && (this.clipboardAction = null),
+ (this.clipboardAction = new s.default({
+ action: this.action(n),
+ target: this.target(n),
+ text: this.text(n),
+ trigger: n,
+ emitter: this,
+ }))
+ }),
+ (e.prototype.defaultAction = function t(e) {
+ return a("action", e)
+ }),
+ (e.prototype.defaultTarget = function t(e) {
+ var n = a("target", e)
+ return n ? document.querySelector(n) : void 0
+ }),
+ (e.prototype.defaultText = function t(e) {
+ return a("text", e)
+ }),
+ (e.prototype.destroy = function t() {
+ this.listener.destroy(),
+ this.clipboardAction &&
+ (this.clipboardAction.destroy(), (this.clipboardAction = null))
+ }),
+ e
+ )
+ })(l.default)
+ ;(n.default = h), (e.exports = n.default)
+ },
+ { "./clipboard-action": 8, "good-listener": 5, "tiny-emitter": 7 },
+ ],
+ },
+ {},
+ [9],
+ )(9)
+})
diff --git a/docs/themes/hugo-docs/static/js/dgraph.js b/docs/themes/hugo-docs/static/js/dgraph.js
index 784026b..9197ac0 100644
--- a/docs/themes/hugo-docs/static/js/dgraph.js
+++ b/docs/themes/hugo-docs/static/js/dgraph.js
@@ -1,49 +1,49 @@
// debounce limits the amount of function invocation by spacing out the calls
// by at least `wait` ms.
function debounce(func, wait, immediate) {
- var timeout;
+ var timeout
- return function() {
+ return function () {
var context = this,
- args = arguments;
- var later = function() {
- timeout = null;
- if (!immediate) func.apply(context, args);
- };
+ args = arguments
+ var later = function () {
+ timeout = null
+ if (!immediate) func.apply(context, args)
+ }
- var callNow = immediate && !timeout;
- clearTimeout(timeout);
- timeout = setTimeout(later, wait);
- if (callNow) func.apply(context, args);
- };
+ var callNow = immediate && !timeout
+ clearTimeout(timeout)
+ timeout = setTimeout(later, wait)
+ if (callNow) func.apply(context, args)
+ }
}
/********** Cookie helpers **/
function createCookie(name, val, days) {
- var expires = "";
+ var expires = ""
if (days) {
- var date = new Date();
- date.setTime(date.getTime() + days * 24 * 60 * 60 * 1000);
- expires = "; expires=" + date.toUTCString();
+ var date = new Date()
+ date.setTime(date.getTime() + days * 24 * 60 * 60 * 1000)
+ expires = "; expires=" + date.toUTCString()
}
- document.cookie = name + "=" + val + expires + "; path=/";
+ document.cookie = name + "=" + val + expires + "; path=/"
}
function readCookie(name) {
- var nameEQ = name + "=";
- var ca = document.cookie.split(";");
+ var nameEQ = name + "="
+ var ca = document.cookie.split(";")
for (var i = 0; i < ca.length; i++) {
- var c = ca[i];
- while (c.charAt(0) == " ") c = c.substring(1, c.length);
- if (c.indexOf(nameEQ) == 0) return c.substring(nameEQ.length, c.length);
+ var c = ca[i]
+ while (c.charAt(0) == " ") c = c.substring(1, c.length)
+ if (c.indexOf(nameEQ) == 0) return c.substring(nameEQ.length, c.length)
}
- return null;
+ return null
}
function eraseCookie(name) {
- createCookie(name, "", -1);
+ createCookie(name, "", -1)
}
/**
@@ -54,166 +54,144 @@ function eraseCookie(name) {
* empty string denotes the latest version
*/
function getCurrentVersion(pathname) {
- let candidate;
+ let candidate
if (location.pathname.startsWith("/docs")) {
- candidate = pathname.split("/")[2];
+ candidate = pathname.split("/")[2]
} else {
- candidate = pathname.split("/")[1];
+ candidate = pathname.split("/")[1]
}
if (candidate === "master") {
- return candidate;
+ return candidate
}
if (/v\d+\.\d+\.\d+/.test(candidate)) {
- return candidate;
+ return candidate
}
- return "";
+ return ""
}
// getPathBeforeVersionName gets the current URL path before the version prefix
function getPathBeforeVersionName(location, versionName) {
if (location.pathname.startsWith("/docs")) {
- return "/docs/";
+ return "/docs/"
}
- return "/";
+ return "/"
}
// getPathAfterVersionName gets the current URL path after the version prefix
function getPathAfterVersionName(location, versionName) {
- let path;
+ let path
if (location.pathname.startsWith("/docs")) {
if (versionName === "") {
- path = location.pathname
- .split("/")
- .slice(2)
- .join("/");
+ path = location.pathname.split("/").slice(2).join("/")
} else {
- path = location.pathname
- .split("/")
- .slice(3)
- .join("/");
+ path = location.pathname.split("/").slice(3).join("/")
}
- return path + location.hash;
+ return path + location.hash
}
if (versionName === "") {
- path = location.pathname
- .split("/")
- .slice(1)
- .join("/");
+ path = location.pathname.split("/").slice(1).join("/")
} else {
- path = location.pathname
- .split("/")
- .slice(2)
- .join("/");
+ path = location.pathname.split("/").slice(2).join("/")
}
- return path + location.hash;
+ return path + location.hash
}
-(function() {
+;(function () {
// clipboard
- var clipInit = false;
- $("pre code:not(.no-copy)").each(function() {
+ var clipInit = false
+ $("pre code:not(.no-copy)").each(function () {
var code = $(this),
- text = code.text();
+ text = code.text()
if (text.length > 5) {
if (!clipInit) {
- var text;
+ var text
var clip = new Clipboard(".copy-btn", {
- text: function(trigger) {
- text = $(trigger)
- .prev("code")
- .text();
- return text.replace(/^\$\s/gm, "");
- }
- });
+ text: function (trigger) {
+ text = $(trigger).prev("code").text()
+ return text.replace(/^\$\s/gm, "")
+ },
+ })
- clip.on("success", function(e) {
- e.clearSelection();
- $(e.trigger)
- .text("Copied to clipboard!")
- .addClass("copied");
+ clip.on("success", function (e) {
+ e.clearSelection()
+ $(e.trigger).text("Copied to clipboard!").addClass("copied")
- window.setTimeout(function() {
- $(e.trigger)
- .text("Copy")
- .removeClass("copied");
- }, 2000);
- });
+ window.setTimeout(function () {
+ $(e.trigger).text("Copy").removeClass("copied")
+ }, 2000)
+ })
- clip.on("error", function(e) {
- e.clearSelection();
- $(e.trigger).text("Error copying");
+ clip.on("error", function (e) {
+ e.clearSelection()
+ $(e.trigger).text("Error copying")
- window.setTimeout(function() {
- $(e.trigger).text("Copy");
- }, 2000);
- });
+ window.setTimeout(function () {
+ $(e.trigger).text("Copy")
+ }, 2000)
+ })
- clipInit = true;
+ clipInit = true
}
- code.after('Copy');
+ code.after('Copy')
}
- });
+ })
// Sidebar
- var h2s = document.querySelectorAll("h2");
- var h3s = document.querySelectorAll("h3");
- var isAfter = function(e1, e2) {
- return e1.compareDocumentPosition(e2) & Node.DOCUMENT_POSITION_FOLLOWING;
- };
- var activeLink = document.querySelector(".topic.active");
- var allLinks = [];
+ var h2s = document.querySelectorAll("h2")
+ var h3s = document.querySelectorAll("h3")
+ var isAfter = function (e1, e2) {
+ return e1.compareDocumentPosition(e2) & Node.DOCUMENT_POSITION_FOLLOWING
+ }
+ var activeLink = document.querySelector(".topic.active")
+ var allLinks = []
- var h2sWithH3s = [];
- var j = 0;
+ var h2sWithH3s = []
+ var j = 0
for (var i = 0; i < h2s.length; i++) {
- var h2 = h2s[i];
- var nextH2 = h2s[i + 1];
- var ourH3s = [];
- while (
- h3s[j] &&
- isAfter(h2, h3s[j]) &&
- (!nextH2 || !isAfter(nextH2, h3s[j]))
- ) {
- ourH3s.push({ header: h3s[j] });
- j++;
+ var h2 = h2s[i]
+ var nextH2 = h2s[i + 1]
+ var ourH3s = []
+ while (h3s[j] && isAfter(h2, h3s[j]) && (!nextH2 || !isAfter(nextH2, h3s[j]))) {
+ ourH3s.push({ header: h3s[j] })
+ j++
}
h2sWithH3s.push({
header: h2,
- subHeaders: ourH3s
- });
+ subHeaders: ourH3s,
+ })
}
// console.log(h2sWithH3s);
function createSubtopic(container, headers) {
- var subMenu = document.createElement("ul");
- subMenu.className = "sub-topics";
- container.appendChild(subMenu);
+ var subMenu = document.createElement("ul")
+ subMenu.className = "sub-topics"
+ container.appendChild(subMenu)
- Array.prototype.forEach.call(headers, function(h) {
- var li = createSubtopicItem(h.header);
- li.className = "topic sub-topic";
- subMenu.appendChild(li);
+ Array.prototype.forEach.call(headers, function (h) {
+ var li = createSubtopicItem(h.header)
+ li.className = "topic sub-topic"
+ subMenu.appendChild(li)
if (h.subHeaders) {
- createSubtopic(subMenu, h.subHeaders);
+ createSubtopic(subMenu, h.subHeaders)
}
- });
+ })
}
function createSubtopicItem(h) {
- allLinks.push(h);
+ allLinks.push(h)
- var li = document.createElement("li");
+ var li = document.createElement("li")
li.innerHTML =
' ' +
(h.title || h.textContent) +
- "";
- return li;
+ ""
+ return li
}
// setActiveSubTopic updates the active subtopic on the sidebar based on the
@@ -230,129 +208,123 @@ function getPathAfterVersionName(location, versionName) {
// @params hash [String] - hash including the hash sign at the beginning
function setActiveSubTopic(hash) {
// Set inactive the previously active topic
- var prevActiveTopic = document.querySelector(".sub-topics .topic.active");
- var nextActiveTopic = document.querySelector(
- '.sub-topics a[href="' + hash + '"]'
- ).parentNode;
+ var prevActiveTopic = document.querySelector(".sub-topics .topic.active")
+ var nextActiveTopic = document.querySelector('.sub-topics a[href="' + hash + '"]').parentNode
if (prevActiveTopic !== nextActiveTopic) {
- nextActiveTopic.classList.add("active");
+ nextActiveTopic.classList.add("active")
if (prevActiveTopic) {
- prevActiveTopic.classList.remove("active");
+ prevActiveTopic.classList.remove("active")
}
}
}
// updateSidebar updates the active menu in the sidebar
function updateSidebar() {
- var currentScrollY = document.body.scrollTop;
- var topSideOffset = 120;
+ var currentScrollY = document.body.scrollTop
+ var topSideOffset = 120
- var activeHash;
+ var activeHash
for (var i = 0; i < allLinks.length; i++) {
- var h = allLinks[i];
- var hash = h.getElementsByTagName("a")[0].hash;
+ var h = allLinks[i]
+ var hash = h.getElementsByTagName("a")[0].hash
if (h.offsetTop - topSideOffset > currentScrollY) {
if (!activeHash) {
- activeHash = hash;
- break;
+ activeHash = hash
+ break
}
} else {
- activeHash = hash;
+ activeHash = hash
}
}
if (activeHash) {
- setActiveSubTopic(activeHash);
+ setActiveSubTopic(activeHash)
}
}
if (h2sWithH3s.length > 0 && activeLink) {
- createSubtopic(activeLink, h2sWithH3s);
+ createSubtopic(activeLink, h2sWithH3s)
}
- var subTopics = document.querySelectorAll(".sub-topics .sub-topic");
+ var subTopics = document.querySelectorAll(".sub-topics .sub-topic")
for (var i = 0; i < subTopics.length; i++) {
- var subTopic = subTopics[i];
- subTopic.addEventListener("click", function(e) {
- var hash = e.target.hash;
- setActiveSubTopic(hash);
- });
+ var subTopic = subTopics[i]
+ subTopic.addEventListener("click", function (e) {
+ var hash = e.target.hash
+ setActiveSubTopic(hash)
+ })
}
// Scrollspy for sidebar
- window.addEventListener("scroll", debounce(updateSidebar, 15));
+ window.addEventListener("scroll", debounce(updateSidebar, 15))
// Sidebar toggle
- document
- .getElementById("sidebar-toggle")
- .addEventListener("click", function(e) {
- e.preventDefault();
- var klass = document.body.className;
- if (klass === "sidebar-visible") {
- document.body.className = "";
- } else {
- document.body.className = "sidebar-visible";
- }
- });
+ document.getElementById("sidebar-toggle").addEventListener("click", function (e) {
+ e.preventDefault()
+ var klass = document.body.className
+ if (klass === "sidebar-visible") {
+ document.body.className = ""
+ } else {
+ document.body.className = "sidebar-visible"
+ }
+ })
// Anchor tags for headings
function appendAnchor(heading) {
- var id = heading.id;
- var anchorOffset = document.createElement("div");
- anchorOffset.className = "anchor-offset";
- anchorOffset.id = id;
+ var id = heading.id
+ var anchorOffset = document.createElement("div")
+ anchorOffset.className = "anchor-offset"
+ anchorOffset.id = id
- var anchor = document.createElement("a");
- anchor.href = "#" + id;
- anchor.className = "anchor";
+ var anchor = document.createElement("a")
+ anchor.href = "#" + id
+ anchor.className = "anchor"
// anchor.innerHTML = 'link'
- anchor.innerHTML = '';
- heading.insertBefore(anchor, heading.firstChild);
- heading.insertBefore(anchorOffset, heading.firstChild);
+ anchor.innerHTML = ''
+ heading.insertBefore(anchor, heading.firstChild)
+ heading.insertBefore(anchorOffset, heading.firstChild)
// Remove the id from heading
// Instead we will assign the id to the .anchor-offset element to account
// for the fixed header height
- heading.removeAttribute("id");
+ heading.removeAttribute("id")
}
- var h2s = document.querySelectorAll(
- ".content-wrapper h2, .content-wrapper h3"
- );
+ var h2s = document.querySelectorAll(".content-wrapper h2, .content-wrapper h3")
for (var i = 0; i < h2s.length; i++) {
- appendAnchor(h2s[i]);
+ appendAnchor(h2s[i])
}
// code collapse
- var pres = $("pre");
- pres.each(function() {
- var self = this;
+ var pres = $("pre")
+ pres.each(function () {
+ var self = this
- var isInRunnable = $(self).parents(".runnable").length > 0;
+ var isInRunnable = $(self).parents(".runnable").length > 0
if (isInRunnable) {
- return;
+ return
}
if (self.clientHeight > 330) {
if (self.clientHeight < 380) {
- return;
+ return
}
- self.className += " collapsed";
+ self.className += " collapsed"
- var showMore = document.createElement("div");
- showMore.className = "showmore";
- showMore.innerHTML = "Show all";
- showMore.addEventListener("click", function() {
- self.className = "";
- showMore.parentNode.removeChild(showMore);
- });
+ var showMore = document.createElement("div")
+ showMore.className = "showmore"
+ showMore.innerHTML = "Show all"
+ showMore.addEventListener("click", function () {
+ self.className = ""
+ showMore.parentNode.removeChild(showMore)
+ })
- this.appendChild(showMore);
+ this.appendChild(showMore)
}
- });
+ })
// version selector
// var currentVersion = getCurrentVersion(location.pathname);
@@ -397,19 +369,19 @@ function getPathAfterVersionName(location, versionName) {
// (" ");
// Add target = _blank to all external links.
- var links = document.links;
+ var links = document.links
for (var i = 0, linksLength = links.length; i < linksLength; i++) {
if (links[i].hostname != window.location.hostname) {
- links[i].target = "_blank";
+ links[i].target = "_blank"
}
}
/********** On page load **/
- updateSidebar();
- var activeTopic = document.querySelector(".sub-topics .topic.active");
+ updateSidebar()
+ var activeTopic = document.querySelector(".sub-topics .topic.active")
if (activeTopic) {
- activeTopic.scrollIntoView();
+ activeTopic.scrollIntoView()
}
-})();
+})()
diff --git a/docs/themes/hugo-docs/static/js/jquery-2.x.min.js b/docs/themes/hugo-docs/static/js/jquery-2.x.min.js
index b8c4187..0a638c7 100644
--- a/docs/themes/hugo-docs/static/js/jquery-2.x.min.js
+++ b/docs/themes/hugo-docs/static/js/jquery-2.x.min.js
@@ -1,4 +1,4786 @@
/*! jQuery v2.2.3 | (c) jQuery Foundation | jquery.org/license */
-!function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=a.document,e=c.slice,f=c.concat,g=c.push,h=c.indexOf,i={},j=i.toString,k=i.hasOwnProperty,l={},m="2.2.3",n=function(a,b){return new n.fn.init(a,b)},o=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,p=/^-ms-/,q=/-([\da-z])/gi,r=function(a,b){return b.toUpperCase()};n.fn=n.prototype={jquery:m,constructor:n,selector:"",length:0,toArray:function(){return e.call(this)},get:function(a){return null!=a?0>a?this[a+this.length]:this[a]:e.call(this)},pushStack:function(a){var b=n.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a){return n.each(this,a)},map:function(a){return this.pushStack(n.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(e.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0>a?b:0);return this.pushStack(c>=0&&b>c?[this[c]]:[])},end:function(){return this.prevObject||this.constructor()},push:g,sort:c.sort,splice:c.splice},n.extend=n.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||n.isFunction(g)||(g={}),h===i&&(g=this,h--);i>h;h++)if(null!=(a=arguments[h]))for(b in a)c=g[b],d=a[b],g!==d&&(j&&d&&(n.isPlainObject(d)||(e=n.isArray(d)))?(e?(e=!1,f=c&&n.isArray(c)?c:[]):f=c&&n.isPlainObject(c)?c:{},g[b]=n.extend(j,f,d)):void 0!==d&&(g[b]=d));return g},n.extend({expando:"jQuery"+(m+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===n.type(a)},isArray:Array.isArray,isWindow:function(a){return null!=a&&a===a.window},isNumeric:function(a){var b=a&&a.toString();return!n.isArray(a)&&b-parseFloat(b)+1>=0},isPlainObject:function(a){var b;if("object"!==n.type(a)||a.nodeType||n.isWindow(a))return!1;if(a.constructor&&!k.call(a,"constructor")&&!k.call(a.constructor.prototype||{},"isPrototypeOf"))return!1;for(b in a);return void 0===b||k.call(a,b)},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},type:function(a){return null==a?a+"":"object"==typeof a||"function"==typeof a?i[j.call(a)]||"object":typeof a},globalEval:function(a){var b,c=eval;a=n.trim(a),a&&(1===a.indexOf("use strict")?(b=d.createElement("script"),b.text=a,d.head.appendChild(b).parentNode.removeChild(b)):c(a))},camelCase:function(a){return a.replace(p,"ms-").replace(q,r)},nodeName:function(a,b){return a.nodeName&&a.nodeName.toLowerCase()===b.toLowerCase()},each:function(a,b){var c,d=0;if(s(a)){for(c=a.length;c>d;d++)if(b.call(a[d],d,a[d])===!1)break}else for(d in a)if(b.call(a[d],d,a[d])===!1)break;return a},trim:function(a){return null==a?"":(a+"").replace(o,"")},makeArray:function(a,b){var c=b||[];return null!=a&&(s(Object(a))?n.merge(c,"string"==typeof a?[a]:a):g.call(c,a)),c},inArray:function(a,b,c){return null==b?-1:h.call(b,a,c)},merge:function(a,b){for(var c=+b.length,d=0,e=a.length;c>d;d++)a[e++]=b[d];return a.length=e,a},grep:function(a,b,c){for(var d,e=[],f=0,g=a.length,h=!c;g>f;f++)d=!b(a[f],f),d!==h&&e.push(a[f]);return e},map:function(a,b,c){var d,e,g=0,h=[];if(s(a))for(d=a.length;d>g;g++)e=b(a[g],g,c),null!=e&&h.push(e);else for(g in a)e=b(a[g],g,c),null!=e&&h.push(e);return f.apply([],h)},guid:1,proxy:function(a,b){var c,d,f;return"string"==typeof b&&(c=a[b],b=a,a=c),n.isFunction(a)?(d=e.call(arguments,2),f=function(){return a.apply(b||this,d.concat(e.call(arguments)))},f.guid=a.guid=a.guid||n.guid++,f):void 0},now:Date.now,support:l}),"function"==typeof Symbol&&(n.fn[Symbol.iterator]=c[Symbol.iterator]),n.each("Boolean Number String Function Array Date RegExp Object Error Symbol".split(" "),function(a,b){i["[object "+b+"]"]=b.toLowerCase()});function s(a){var b=!!a&&"length"in a&&a.length,c=n.type(a);return"function"===c||n.isWindow(a)?!1:"array"===c||0===b||"number"==typeof b&&b>0&&b-1 in a}var t=function(a){var b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u="sizzle"+1*new Date,v=a.document,w=0,x=0,y=ga(),z=ga(),A=ga(),B=function(a,b){return a===b&&(l=!0),0},C=1<<31,D={}.hasOwnProperty,E=[],F=E.pop,G=E.push,H=E.push,I=E.slice,J=function(a,b){for(var c=0,d=a.length;d>c;c++)if(a[c]===b)return c;return-1},K="checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",L="[\\x20\\t\\r\\n\\f]",M="(?:\\\\.|[\\w-]|[^\\x00-\\xa0])+",N="\\["+L+"*("+M+")(?:"+L+"*([*^$|!~]?=)"+L+"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|("+M+"))|)"+L+"*\\]",O=":("+M+")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|"+N+")*)|.*)\\)|)",P=new RegExp(L+"+","g"),Q=new RegExp("^"+L+"+|((?:^|[^\\\\])(?:\\\\.)*)"+L+"+$","g"),R=new RegExp("^"+L+"*,"+L+"*"),S=new RegExp("^"+L+"*([>+~]|"+L+")"+L+"*"),T=new RegExp("="+L+"*([^\\]'\"]*?)"+L+"*\\]","g"),U=new RegExp(O),V=new RegExp("^"+M+"$"),W={ID:new RegExp("^#("+M+")"),CLASS:new RegExp("^\\.("+M+")"),TAG:new RegExp("^("+M+"|[*])"),ATTR:new RegExp("^"+N),PSEUDO:new RegExp("^"+O),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+L+"*(even|odd|(([+-]|)(\\d*)n|)"+L+"*(?:([+-]|)"+L+"*(\\d+)|))"+L+"*\\)|)","i"),bool:new RegExp("^(?:"+K+")$","i"),needsContext:new RegExp("^"+L+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+L+"*((?:-\\d)?\\d*)"+L+"*\\)|)(?=[^-]|$)","i")},X=/^(?:input|select|textarea|button)$/i,Y=/^h\d$/i,Z=/^[^{]+\{\s*\[native \w/,$=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,_=/[+~]/,aa=/'|\\/g,ba=new RegExp("\\\\([\\da-f]{1,6}"+L+"?|("+L+")|.)","ig"),ca=function(a,b,c){var d="0x"+b-65536;return d!==d||c?b:0>d?String.fromCharCode(d+65536):String.fromCharCode(d>>10|55296,1023&d|56320)},da=function(){m()};try{H.apply(E=I.call(v.childNodes),v.childNodes),E[v.childNodes.length].nodeType}catch(ea){H={apply:E.length?function(a,b){G.apply(a,I.call(b))}:function(a,b){var c=a.length,d=0;while(a[c++]=b[d++]);a.length=c-1}}}function fa(a,b,d,e){var f,h,j,k,l,o,r,s,w=b&&b.ownerDocument,x=b?b.nodeType:9;if(d=d||[],"string"!=typeof a||!a||1!==x&&9!==x&&11!==x)return d;if(!e&&((b?b.ownerDocument||b:v)!==n&&m(b),b=b||n,p)){if(11!==x&&(o=$.exec(a)))if(f=o[1]){if(9===x){if(!(j=b.getElementById(f)))return d;if(j.id===f)return d.push(j),d}else if(w&&(j=w.getElementById(f))&&t(b,j)&&j.id===f)return d.push(j),d}else{if(o[2])return H.apply(d,b.getElementsByTagName(a)),d;if((f=o[3])&&c.getElementsByClassName&&b.getElementsByClassName)return H.apply(d,b.getElementsByClassName(f)),d}if(c.qsa&&!A[a+" "]&&(!q||!q.test(a))){if(1!==x)w=b,s=a;else if("object"!==b.nodeName.toLowerCase()){(k=b.getAttribute("id"))?k=k.replace(aa,"\\$&"):b.setAttribute("id",k=u),r=g(a),h=r.length,l=V.test(k)?"#"+k:"[id='"+k+"']";while(h--)r[h]=l+" "+qa(r[h]);s=r.join(","),w=_.test(a)&&oa(b.parentNode)||b}if(s)try{return H.apply(d,w.querySelectorAll(s)),d}catch(y){}finally{k===u&&b.removeAttribute("id")}}}return i(a.replace(Q,"$1"),b,d,e)}function ga(){var a=[];function b(c,e){return a.push(c+" ")>d.cacheLength&&delete b[a.shift()],b[c+" "]=e}return b}function ha(a){return a[u]=!0,a}function ia(a){var b=n.createElement("div");try{return!!a(b)}catch(c){return!1}finally{b.parentNode&&b.parentNode.removeChild(b),b=null}}function ja(a,b){var c=a.split("|"),e=c.length;while(e--)d.attrHandle[c[e]]=b}function ka(a,b){var c=b&&a,d=c&&1===a.nodeType&&1===b.nodeType&&(~b.sourceIndex||C)-(~a.sourceIndex||C);if(d)return d;if(c)while(c=c.nextSibling)if(c===b)return-1;return a?1:-1}function la(a){return function(b){var c=b.nodeName.toLowerCase();return"input"===c&&b.type===a}}function ma(a){return function(b){var c=b.nodeName.toLowerCase();return("input"===c||"button"===c)&&b.type===a}}function na(a){return ha(function(b){return b=+b,ha(function(c,d){var e,f=a([],c.length,b),g=f.length;while(g--)c[e=f[g]]&&(c[e]=!(d[e]=c[e]))})})}function oa(a){return a&&"undefined"!=typeof a.getElementsByTagName&&a}c=fa.support={},f=fa.isXML=function(a){var b=a&&(a.ownerDocument||a).documentElement;return b?"HTML"!==b.nodeName:!1},m=fa.setDocument=function(a){var b,e,g=a?a.ownerDocument||a:v;return g!==n&&9===g.nodeType&&g.documentElement?(n=g,o=n.documentElement,p=!f(n),(e=n.defaultView)&&e.top!==e&&(e.addEventListener?e.addEventListener("unload",da,!1):e.attachEvent&&e.attachEvent("onunload",da)),c.attributes=ia(function(a){return a.className="i",!a.getAttribute("className")}),c.getElementsByTagName=ia(function(a){return a.appendChild(n.createComment("")),!a.getElementsByTagName("*").length}),c.getElementsByClassName=Z.test(n.getElementsByClassName),c.getById=ia(function(a){return o.appendChild(a).id=u,!n.getElementsByName||!n.getElementsByName(u).length}),c.getById?(d.find.ID=function(a,b){if("undefined"!=typeof b.getElementById&&p){var c=b.getElementById(a);return c?[c]:[]}},d.filter.ID=function(a){var b=a.replace(ba,ca);return function(a){return a.getAttribute("id")===b}}):(delete d.find.ID,d.filter.ID=function(a){var b=a.replace(ba,ca);return function(a){var c="undefined"!=typeof a.getAttributeNode&&a.getAttributeNode("id");return c&&c.value===b}}),d.find.TAG=c.getElementsByTagName?function(a,b){return"undefined"!=typeof b.getElementsByTagName?b.getElementsByTagName(a):c.qsa?b.querySelectorAll(a):void 0}:function(a,b){var c,d=[],e=0,f=b.getElementsByTagName(a);if("*"===a){while(c=f[e++])1===c.nodeType&&d.push(c);return d}return f},d.find.CLASS=c.getElementsByClassName&&function(a,b){return"undefined"!=typeof b.getElementsByClassName&&p?b.getElementsByClassName(a):void 0},r=[],q=[],(c.qsa=Z.test(n.querySelectorAll))&&(ia(function(a){o.appendChild(a).innerHTML="",a.querySelectorAll("[msallowcapture^='']").length&&q.push("[*^$]="+L+"*(?:''|\"\")"),a.querySelectorAll("[selected]").length||q.push("\\["+L+"*(?:value|"+K+")"),a.querySelectorAll("[id~="+u+"-]").length||q.push("~="),a.querySelectorAll(":checked").length||q.push(":checked"),a.querySelectorAll("a#"+u+"+*").length||q.push(".#.+[+~]")}),ia(function(a){var b=n.createElement("input");b.setAttribute("type","hidden"),a.appendChild(b).setAttribute("name","D"),a.querySelectorAll("[name=d]").length&&q.push("name"+L+"*[*^$|!~]?="),a.querySelectorAll(":enabled").length||q.push(":enabled",":disabled"),a.querySelectorAll("*,:x"),q.push(",.*:")})),(c.matchesSelector=Z.test(s=o.matches||o.webkitMatchesSelector||o.mozMatchesSelector||o.oMatchesSelector||o.msMatchesSelector))&&ia(function(a){c.disconnectedMatch=s.call(a,"div"),s.call(a,"[s!='']:x"),r.push("!=",O)}),q=q.length&&new RegExp(q.join("|")),r=r.length&&new RegExp(r.join("|")),b=Z.test(o.compareDocumentPosition),t=b||Z.test(o.contains)?function(a,b){var c=9===a.nodeType?a.documentElement:a,d=b&&b.parentNode;return a===d||!(!d||1!==d.nodeType||!(c.contains?c.contains(d):a.compareDocumentPosition&&16&a.compareDocumentPosition(d)))}:function(a,b){if(b)while(b=b.parentNode)if(b===a)return!0;return!1},B=b?function(a,b){if(a===b)return l=!0,0;var d=!a.compareDocumentPosition-!b.compareDocumentPosition;return d?d:(d=(a.ownerDocument||a)===(b.ownerDocument||b)?a.compareDocumentPosition(b):1,1&d||!c.sortDetached&&b.compareDocumentPosition(a)===d?a===n||a.ownerDocument===v&&t(v,a)?-1:b===n||b.ownerDocument===v&&t(v,b)?1:k?J(k,a)-J(k,b):0:4&d?-1:1)}:function(a,b){if(a===b)return l=!0,0;var c,d=0,e=a.parentNode,f=b.parentNode,g=[a],h=[b];if(!e||!f)return a===n?-1:b===n?1:e?-1:f?1:k?J(k,a)-J(k,b):0;if(e===f)return ka(a,b);c=a;while(c=c.parentNode)g.unshift(c);c=b;while(c=c.parentNode)h.unshift(c);while(g[d]===h[d])d++;return d?ka(g[d],h[d]):g[d]===v?-1:h[d]===v?1:0},n):n},fa.matches=function(a,b){return fa(a,null,null,b)},fa.matchesSelector=function(a,b){if((a.ownerDocument||a)!==n&&m(a),b=b.replace(T,"='$1']"),c.matchesSelector&&p&&!A[b+" "]&&(!r||!r.test(b))&&(!q||!q.test(b)))try{var d=s.call(a,b);if(d||c.disconnectedMatch||a.document&&11!==a.document.nodeType)return d}catch(e){}return fa(b,n,null,[a]).length>0},fa.contains=function(a,b){return(a.ownerDocument||a)!==n&&m(a),t(a,b)},fa.attr=function(a,b){(a.ownerDocument||a)!==n&&m(a);var e=d.attrHandle[b.toLowerCase()],f=e&&D.call(d.attrHandle,b.toLowerCase())?e(a,b,!p):void 0;return void 0!==f?f:c.attributes||!p?a.getAttribute(b):(f=a.getAttributeNode(b))&&f.specified?f.value:null},fa.error=function(a){throw new Error("Syntax error, unrecognized expression: "+a)},fa.uniqueSort=function(a){var b,d=[],e=0,f=0;if(l=!c.detectDuplicates,k=!c.sortStable&&a.slice(0),a.sort(B),l){while(b=a[f++])b===a[f]&&(e=d.push(f));while(e--)a.splice(d[e],1)}return k=null,a},e=fa.getText=function(a){var b,c="",d=0,f=a.nodeType;if(f){if(1===f||9===f||11===f){if("string"==typeof a.textContent)return a.textContent;for(a=a.firstChild;a;a=a.nextSibling)c+=e(a)}else if(3===f||4===f)return a.nodeValue}else while(b=a[d++])c+=e(b);return c},d=fa.selectors={cacheLength:50,createPseudo:ha,match:W,attrHandle:{},find:{},relative:{">":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(a){return a[1]=a[1].replace(ba,ca),a[3]=(a[3]||a[4]||a[5]||"").replace(ba,ca),"~="===a[2]&&(a[3]=" "+a[3]+" "),a.slice(0,4)},CHILD:function(a){return a[1]=a[1].toLowerCase(),"nth"===a[1].slice(0,3)?(a[3]||fa.error(a[0]),a[4]=+(a[4]?a[5]+(a[6]||1):2*("even"===a[3]||"odd"===a[3])),a[5]=+(a[7]+a[8]||"odd"===a[3])):a[3]&&fa.error(a[0]),a},PSEUDO:function(a){var b,c=!a[6]&&a[2];return W.CHILD.test(a[0])?null:(a[3]?a[2]=a[4]||a[5]||"":c&&U.test(c)&&(b=g(c,!0))&&(b=c.indexOf(")",c.length-b)-c.length)&&(a[0]=a[0].slice(0,b),a[2]=c.slice(0,b)),a.slice(0,3))}},filter:{TAG:function(a){var b=a.replace(ba,ca).toLowerCase();return"*"===a?function(){return!0}:function(a){return a.nodeName&&a.nodeName.toLowerCase()===b}},CLASS:function(a){var b=y[a+" "];return b||(b=new RegExp("(^|"+L+")"+a+"("+L+"|$)"))&&y(a,function(a){return b.test("string"==typeof a.className&&a.className||"undefined"!=typeof a.getAttribute&&a.getAttribute("class")||"")})},ATTR:function(a,b,c){return function(d){var e=fa.attr(d,a);return null==e?"!="===b:b?(e+="","="===b?e===c:"!="===b?e!==c:"^="===b?c&&0===e.indexOf(c):"*="===b?c&&e.indexOf(c)>-1:"$="===b?c&&e.slice(-c.length)===c:"~="===b?(" "+e.replace(P," ")+" ").indexOf(c)>-1:"|="===b?e===c||e.slice(0,c.length+1)===c+"-":!1):!0}},CHILD:function(a,b,c,d,e){var f="nth"!==a.slice(0,3),g="last"!==a.slice(-4),h="of-type"===b;return 1===d&&0===e?function(a){return!!a.parentNode}:function(b,c,i){var j,k,l,m,n,o,p=f!==g?"nextSibling":"previousSibling",q=b.parentNode,r=h&&b.nodeName.toLowerCase(),s=!i&&!h,t=!1;if(q){if(f){while(p){m=b;while(m=m[p])if(h?m.nodeName.toLowerCase()===r:1===m.nodeType)return!1;o=p="only"===a&&!o&&"nextSibling"}return!0}if(o=[g?q.firstChild:q.lastChild],g&&s){m=q,l=m[u]||(m[u]={}),k=l[m.uniqueID]||(l[m.uniqueID]={}),j=k[a]||[],n=j[0]===w&&j[1],t=n&&j[2],m=n&&q.childNodes[n];while(m=++n&&m&&m[p]||(t=n=0)||o.pop())if(1===m.nodeType&&++t&&m===b){k[a]=[w,n,t];break}}else if(s&&(m=b,l=m[u]||(m[u]={}),k=l[m.uniqueID]||(l[m.uniqueID]={}),j=k[a]||[],n=j[0]===w&&j[1],t=n),t===!1)while(m=++n&&m&&m[p]||(t=n=0)||o.pop())if((h?m.nodeName.toLowerCase()===r:1===m.nodeType)&&++t&&(s&&(l=m[u]||(m[u]={}),k=l[m.uniqueID]||(l[m.uniqueID]={}),k[a]=[w,t]),m===b))break;return t-=e,t===d||t%d===0&&t/d>=0}}},PSEUDO:function(a,b){var c,e=d.pseudos[a]||d.setFilters[a.toLowerCase()]||fa.error("unsupported pseudo: "+a);return e[u]?e(b):e.length>1?(c=[a,a,"",b],d.setFilters.hasOwnProperty(a.toLowerCase())?ha(function(a,c){var d,f=e(a,b),g=f.length;while(g--)d=J(a,f[g]),a[d]=!(c[d]=f[g])}):function(a){return e(a,0,c)}):e}},pseudos:{not:ha(function(a){var b=[],c=[],d=h(a.replace(Q,"$1"));return d[u]?ha(function(a,b,c,e){var f,g=d(a,null,e,[]),h=a.length;while(h--)(f=g[h])&&(a[h]=!(b[h]=f))}):function(a,e,f){return b[0]=a,d(b,null,f,c),b[0]=null,!c.pop()}}),has:ha(function(a){return function(b){return fa(a,b).length>0}}),contains:ha(function(a){return a=a.replace(ba,ca),function(b){return(b.textContent||b.innerText||e(b)).indexOf(a)>-1}}),lang:ha(function(a){return V.test(a||"")||fa.error("unsupported lang: "+a),a=a.replace(ba,ca).toLowerCase(),function(b){var c;do if(c=p?b.lang:b.getAttribute("xml:lang")||b.getAttribute("lang"))return c=c.toLowerCase(),c===a||0===c.indexOf(a+"-");while((b=b.parentNode)&&1===b.nodeType);return!1}}),target:function(b){var c=a.location&&a.location.hash;return c&&c.slice(1)===b.id},root:function(a){return a===o},focus:function(a){return a===n.activeElement&&(!n.hasFocus||n.hasFocus())&&!!(a.type||a.href||~a.tabIndex)},enabled:function(a){return a.disabled===!1},disabled:function(a){return a.disabled===!0},checked:function(a){var b=a.nodeName.toLowerCase();return"input"===b&&!!a.checked||"option"===b&&!!a.selected},selected:function(a){return a.parentNode&&a.parentNode.selectedIndex,a.selected===!0},empty:function(a){for(a=a.firstChild;a;a=a.nextSibling)if(a.nodeType<6)return!1;return!0},parent:function(a){return!d.pseudos.empty(a)},header:function(a){return Y.test(a.nodeName)},input:function(a){return X.test(a.nodeName)},button:function(a){var b=a.nodeName.toLowerCase();return"input"===b&&"button"===a.type||"button"===b},text:function(a){var b;return"input"===a.nodeName.toLowerCase()&&"text"===a.type&&(null==(b=a.getAttribute("type"))||"text"===b.toLowerCase())},first:na(function(){return[0]}),last:na(function(a,b){return[b-1]}),eq:na(function(a,b,c){return[0>c?c+b:c]}),even:na(function(a,b){for(var c=0;b>c;c+=2)a.push(c);return a}),odd:na(function(a,b){for(var c=1;b>c;c+=2)a.push(c);return a}),lt:na(function(a,b,c){for(var d=0>c?c+b:c;--d>=0;)a.push(d);return a}),gt:na(function(a,b,c){for(var d=0>c?c+b:c;++db;b++)d+=a[b].value;return d}function ra(a,b,c){var d=b.dir,e=c&&"parentNode"===d,f=x++;return b.first?function(b,c,f){while(b=b[d])if(1===b.nodeType||e)return a(b,c,f)}:function(b,c,g){var h,i,j,k=[w,f];if(g){while(b=b[d])if((1===b.nodeType||e)&&a(b,c,g))return!0}else while(b=b[d])if(1===b.nodeType||e){if(j=b[u]||(b[u]={}),i=j[b.uniqueID]||(j[b.uniqueID]={}),(h=i[d])&&h[0]===w&&h[1]===f)return k[2]=h[2];if(i[d]=k,k[2]=a(b,c,g))return!0}}}function sa(a){return a.length>1?function(b,c,d){var e=a.length;while(e--)if(!a[e](b,c,d))return!1;return!0}:a[0]}function ta(a,b,c){for(var d=0,e=b.length;e>d;d++)fa(a,b[d],c);return c}function ua(a,b,c,d,e){for(var f,g=[],h=0,i=a.length,j=null!=b;i>h;h++)(f=a[h])&&(c&&!c(f,d,e)||(g.push(f),j&&b.push(h)));return g}function va(a,b,c,d,e,f){return d&&!d[u]&&(d=va(d)),e&&!e[u]&&(e=va(e,f)),ha(function(f,g,h,i){var j,k,l,m=[],n=[],o=g.length,p=f||ta(b||"*",h.nodeType?[h]:h,[]),q=!a||!f&&b?p:ua(p,m,a,h,i),r=c?e||(f?a:o||d)?[]:g:q;if(c&&c(q,r,h,i),d){j=ua(r,n),d(j,[],h,i),k=j.length;while(k--)(l=j[k])&&(r[n[k]]=!(q[n[k]]=l))}if(f){if(e||a){if(e){j=[],k=r.length;while(k--)(l=r[k])&&j.push(q[k]=l);e(null,r=[],j,i)}k=r.length;while(k--)(l=r[k])&&(j=e?J(f,l):m[k])>-1&&(f[j]=!(g[j]=l))}}else r=ua(r===g?r.splice(o,r.length):r),e?e(null,g,r,i):H.apply(g,r)})}function wa(a){for(var b,c,e,f=a.length,g=d.relative[a[0].type],h=g||d.relative[" "],i=g?1:0,k=ra(function(a){return a===b},h,!0),l=ra(function(a){return J(b,a)>-1},h,!0),m=[function(a,c,d){var e=!g&&(d||c!==j)||((b=c).nodeType?k(a,c,d):l(a,c,d));return b=null,e}];f>i;i++)if(c=d.relative[a[i].type])m=[ra(sa(m),c)];else{if(c=d.filter[a[i].type].apply(null,a[i].matches),c[u]){for(e=++i;f>e;e++)if(d.relative[a[e].type])break;return va(i>1&&sa(m),i>1&&qa(a.slice(0,i-1).concat({value:" "===a[i-2].type?"*":""})).replace(Q,"$1"),c,e>i&&wa(a.slice(i,e)),f>e&&wa(a=a.slice(e)),f>e&&qa(a))}m.push(c)}return sa(m)}function xa(a,b){var c=b.length>0,e=a.length>0,f=function(f,g,h,i,k){var l,o,q,r=0,s="0",t=f&&[],u=[],v=j,x=f||e&&d.find.TAG("*",k),y=w+=null==v?1:Math.random()||.1,z=x.length;for(k&&(j=g===n||g||k);s!==z&&null!=(l=x[s]);s++){if(e&&l){o=0,g||l.ownerDocument===n||(m(l),h=!p);while(q=a[o++])if(q(l,g||n,h)){i.push(l);break}k&&(w=y)}c&&((l=!q&&l)&&r--,f&&t.push(l))}if(r+=s,c&&s!==r){o=0;while(q=b[o++])q(t,u,g,h);if(f){if(r>0)while(s--)t[s]||u[s]||(u[s]=F.call(i));u=ua(u)}H.apply(i,u),k&&!f&&u.length>0&&r+b.length>1&&fa.uniqueSort(i)}return k&&(w=y,j=v),t};return c?ha(f):f}return h=fa.compile=function(a,b){var c,d=[],e=[],f=A[a+" "];if(!f){b||(b=g(a)),c=b.length;while(c--)f=wa(b[c]),f[u]?d.push(f):e.push(f);f=A(a,xa(e,d)),f.selector=a}return f},i=fa.select=function(a,b,e,f){var i,j,k,l,m,n="function"==typeof a&&a,o=!f&&g(a=n.selector||a);if(e=e||[],1===o.length){if(j=o[0]=o[0].slice(0),j.length>2&&"ID"===(k=j[0]).type&&c.getById&&9===b.nodeType&&p&&d.relative[j[1].type]){if(b=(d.find.ID(k.matches[0].replace(ba,ca),b)||[])[0],!b)return e;n&&(b=b.parentNode),a=a.slice(j.shift().value.length)}i=W.needsContext.test(a)?0:j.length;while(i--){if(k=j[i],d.relative[l=k.type])break;if((m=d.find[l])&&(f=m(k.matches[0].replace(ba,ca),_.test(j[0].type)&&oa(b.parentNode)||b))){if(j.splice(i,1),a=f.length&&qa(j),!a)return H.apply(e,f),e;break}}}return(n||h(a,o))(f,b,!p,e,!b||_.test(a)&&oa(b.parentNode)||b),e},c.sortStable=u.split("").sort(B).join("")===u,c.detectDuplicates=!!l,m(),c.sortDetached=ia(function(a){return 1&a.compareDocumentPosition(n.createElement("div"))}),ia(function(a){return a.innerHTML="","#"===a.firstChild.getAttribute("href")})||ja("type|href|height|width",function(a,b,c){return c?void 0:a.getAttribute(b,"type"===b.toLowerCase()?1:2)}),c.attributes&&ia(function(a){return a.innerHTML="",a.firstChild.setAttribute("value",""),""===a.firstChild.getAttribute("value")})||ja("value",function(a,b,c){return c||"input"!==a.nodeName.toLowerCase()?void 0:a.defaultValue}),ia(function(a){return null==a.getAttribute("disabled")})||ja(K,function(a,b,c){var d;return c?void 0:a[b]===!0?b.toLowerCase():(d=a.getAttributeNode(b))&&d.specified?d.value:null}),fa}(a);n.find=t,n.expr=t.selectors,n.expr[":"]=n.expr.pseudos,n.uniqueSort=n.unique=t.uniqueSort,n.text=t.getText,n.isXMLDoc=t.isXML,n.contains=t.contains;var u=function(a,b,c){var d=[],e=void 0!==c;while((a=a[b])&&9!==a.nodeType)if(1===a.nodeType){if(e&&n(a).is(c))break;d.push(a)}return d},v=function(a,b){for(var c=[];a;a=a.nextSibling)1===a.nodeType&&a!==b&&c.push(a);return c},w=n.expr.match.needsContext,x=/^<([\w-]+)\s*\/?>(?:<\/\1>|)$/,y=/^.[^:#\[\.,]*$/;function z(a,b,c){if(n.isFunction(b))return n.grep(a,function(a,d){return!!b.call(a,d,a)!==c});if(b.nodeType)return n.grep(a,function(a){return a===b!==c});if("string"==typeof b){if(y.test(b))return n.filter(b,a,c);b=n.filter(b,a)}return n.grep(a,function(a){return h.call(b,a)>-1!==c})}n.filter=function(a,b,c){var d=b[0];return c&&(a=":not("+a+")"),1===b.length&&1===d.nodeType?n.find.matchesSelector(d,a)?[d]:[]:n.find.matches(a,n.grep(b,function(a){return 1===a.nodeType}))},n.fn.extend({find:function(a){var b,c=this.length,d=[],e=this;if("string"!=typeof a)return this.pushStack(n(a).filter(function(){for(b=0;c>b;b++)if(n.contains(e[b],this))return!0}));for(b=0;c>b;b++)n.find(a,e[b],d);return d=this.pushStack(c>1?n.unique(d):d),d.selector=this.selector?this.selector+" "+a:a,d},filter:function(a){return this.pushStack(z(this,a||[],!1))},not:function(a){return this.pushStack(z(this,a||[],!0))},is:function(a){return!!z(this,"string"==typeof a&&w.test(a)?n(a):a||[],!1).length}});var A,B=/^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]*))$/,C=n.fn.init=function(a,b,c){var e,f;if(!a)return this;if(c=c||A,"string"==typeof a){if(e="<"===a[0]&&">"===a[a.length-1]&&a.length>=3?[null,a,null]:B.exec(a),!e||!e[1]&&b)return!b||b.jquery?(b||c).find(a):this.constructor(b).find(a);if(e[1]){if(b=b instanceof n?b[0]:b,n.merge(this,n.parseHTML(e[1],b&&b.nodeType?b.ownerDocument||b:d,!0)),x.test(e[1])&&n.isPlainObject(b))for(e in b)n.isFunction(this[e])?this[e](b[e]):this.attr(e,b[e]);return this}return f=d.getElementById(e[2]),f&&f.parentNode&&(this.length=1,this[0]=f),this.context=d,this.selector=a,this}return a.nodeType?(this.context=this[0]=a,this.length=1,this):n.isFunction(a)?void 0!==c.ready?c.ready(a):a(n):(void 0!==a.selector&&(this.selector=a.selector,this.context=a.context),n.makeArray(a,this))};C.prototype=n.fn,A=n(d);var D=/^(?:parents|prev(?:Until|All))/,E={children:!0,contents:!0,next:!0,prev:!0};n.fn.extend({has:function(a){var b=n(a,this),c=b.length;return this.filter(function(){for(var a=0;c>a;a++)if(n.contains(this,b[a]))return!0})},closest:function(a,b){for(var c,d=0,e=this.length,f=[],g=w.test(a)||"string"!=typeof a?n(a,b||this.context):0;e>d;d++)for(c=this[d];c&&c!==b;c=c.parentNode)if(c.nodeType<11&&(g?g.index(c)>-1:1===c.nodeType&&n.find.matchesSelector(c,a))){f.push(c);break}return this.pushStack(f.length>1?n.uniqueSort(f):f)},index:function(a){return a?"string"==typeof a?h.call(n(a),this[0]):h.call(this,a.jquery?a[0]:a):this[0]&&this[0].parentNode?this.first().prevAll().length:-1},add:function(a,b){return this.pushStack(n.uniqueSort(n.merge(this.get(),n(a,b))))},addBack:function(a){return this.add(null==a?this.prevObject:this.prevObject.filter(a))}});function F(a,b){while((a=a[b])&&1!==a.nodeType);return a}n.each({parent:function(a){var b=a.parentNode;return b&&11!==b.nodeType?b:null},parents:function(a){return u(a,"parentNode")},parentsUntil:function(a,b,c){return u(a,"parentNode",c)},next:function(a){return F(a,"nextSibling")},prev:function(a){return F(a,"previousSibling")},nextAll:function(a){return u(a,"nextSibling")},prevAll:function(a){return u(a,"previousSibling")},nextUntil:function(a,b,c){return u(a,"nextSibling",c)},prevUntil:function(a,b,c){return u(a,"previousSibling",c)},siblings:function(a){return v((a.parentNode||{}).firstChild,a)},children:function(a){return v(a.firstChild)},contents:function(a){return a.contentDocument||n.merge([],a.childNodes)}},function(a,b){n.fn[a]=function(c,d){var e=n.map(this,b,c);return"Until"!==a.slice(-5)&&(d=c),d&&"string"==typeof d&&(e=n.filter(d,e)),this.length>1&&(E[a]||n.uniqueSort(e),D.test(a)&&e.reverse()),this.pushStack(e)}});var G=/\S+/g;function H(a){var b={};return n.each(a.match(G)||[],function(a,c){b[c]=!0}),b}n.Callbacks=function(a){a="string"==typeof a?H(a):n.extend({},a);var b,c,d,e,f=[],g=[],h=-1,i=function(){for(e=a.once,d=b=!0;g.length;h=-1){c=g.shift();while(++h-1)f.splice(c,1),h>=c&&h--}),this},has:function(a){return a?n.inArray(a,f)>-1:f.length>0},empty:function(){return f&&(f=[]),this},disable:function(){return e=g=[],f=c="",this},disabled:function(){return!f},lock:function(){return e=g=[],c||(f=c=""),this},locked:function(){return!!e},fireWith:function(a,c){return e||(c=c||[],c=[a,c.slice?c.slice():c],g.push(c),b||i()),this},fire:function(){return j.fireWith(this,arguments),this},fired:function(){return!!d}};return j},n.extend({Deferred:function(a){var b=[["resolve","done",n.Callbacks("once memory"),"resolved"],["reject","fail",n.Callbacks("once memory"),"rejected"],["notify","progress",n.Callbacks("memory")]],c="pending",d={state:function(){return c},always:function(){return e.done(arguments).fail(arguments),this},then:function(){var a=arguments;return n.Deferred(function(c){n.each(b,function(b,f){var g=n.isFunction(a[b])&&a[b];e[f[1]](function(){var a=g&&g.apply(this,arguments);a&&n.isFunction(a.promise)?a.promise().progress(c.notify).done(c.resolve).fail(c.reject):c[f[0]+"With"](this===d?c.promise():this,g?[a]:arguments)})}),a=null}).promise()},promise:function(a){return null!=a?n.extend(a,d):d}},e={};return d.pipe=d.then,n.each(b,function(a,f){var g=f[2],h=f[3];d[f[1]]=g.add,h&&g.add(function(){c=h},b[1^a][2].disable,b[2][2].lock),e[f[0]]=function(){return e[f[0]+"With"](this===e?d:this,arguments),this},e[f[0]+"With"]=g.fireWith}),d.promise(e),a&&a.call(e,e),e},when:function(a){var b=0,c=e.call(arguments),d=c.length,f=1!==d||a&&n.isFunction(a.promise)?d:0,g=1===f?a:n.Deferred(),h=function(a,b,c){return function(d){b[a]=this,c[a]=arguments.length>1?e.call(arguments):d,c===i?g.notifyWith(b,c):--f||g.resolveWith(b,c)}},i,j,k;if(d>1)for(i=new Array(d),j=new Array(d),k=new Array(d);d>b;b++)c[b]&&n.isFunction(c[b].promise)?c[b].promise().progress(h(b,j,i)).done(h(b,k,c)).fail(g.reject):--f;return f||g.resolveWith(k,c),g.promise()}});var I;n.fn.ready=function(a){return n.ready.promise().done(a),this},n.extend({isReady:!1,readyWait:1,holdReady:function(a){a?n.readyWait++:n.ready(!0)},ready:function(a){(a===!0?--n.readyWait:n.isReady)||(n.isReady=!0,a!==!0&&--n.readyWait>0||(I.resolveWith(d,[n]),n.fn.triggerHandler&&(n(d).triggerHandler("ready"),n(d).off("ready"))))}});function J(){d.removeEventListener("DOMContentLoaded",J),a.removeEventListener("load",J),n.ready()}n.ready.promise=function(b){return I||(I=n.Deferred(),"complete"===d.readyState||"loading"!==d.readyState&&!d.documentElement.doScroll?a.setTimeout(n.ready):(d.addEventListener("DOMContentLoaded",J),a.addEventListener("load",J))),I.promise(b)},n.ready.promise();var K=function(a,b,c,d,e,f,g){var h=0,i=a.length,j=null==c;if("object"===n.type(c)){e=!0;for(h in c)K(a,b,h,c[h],!0,f,g)}else if(void 0!==d&&(e=!0,n.isFunction(d)||(g=!0),j&&(g?(b.call(a,d),b=null):(j=b,b=function(a,b,c){return j.call(n(a),c)})),b))for(;i>h;h++)b(a[h],c,g?d:d.call(a[h],h,b(a[h],c)));return e?a:j?b.call(a):i?b(a[0],c):f},L=function(a){return 1===a.nodeType||9===a.nodeType||!+a.nodeType};function M(){this.expando=n.expando+M.uid++}M.uid=1,M.prototype={register:function(a,b){var c=b||{};return a.nodeType?a[this.expando]=c:Object.defineProperty(a,this.expando,{value:c,writable:!0,configurable:!0}),a[this.expando]},cache:function(a){if(!L(a))return{};var b=a[this.expando];return b||(b={},L(a)&&(a.nodeType?a[this.expando]=b:Object.defineProperty(a,this.expando,{value:b,configurable:!0}))),b},set:function(a,b,c){var d,e=this.cache(a);if("string"==typeof b)e[b]=c;else for(d in b)e[d]=b[d];return e},get:function(a,b){return void 0===b?this.cache(a):a[this.expando]&&a[this.expando][b]},access:function(a,b,c){var d;return void 0===b||b&&"string"==typeof b&&void 0===c?(d=this.get(a,b),void 0!==d?d:this.get(a,n.camelCase(b))):(this.set(a,b,c),void 0!==c?c:b)},remove:function(a,b){var c,d,e,f=a[this.expando];if(void 0!==f){if(void 0===b)this.register(a);else{n.isArray(b)?d=b.concat(b.map(n.camelCase)):(e=n.camelCase(b),b in f?d=[b,e]:(d=e,d=d in f?[d]:d.match(G)||[])),c=d.length;while(c--)delete f[d[c]]}(void 0===b||n.isEmptyObject(f))&&(a.nodeType?a[this.expando]=void 0:delete a[this.expando])}},hasData:function(a){var b=a[this.expando];return void 0!==b&&!n.isEmptyObject(b)}};var N=new M,O=new M,P=/^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,Q=/[A-Z]/g;function R(a,b,c){var d;if(void 0===c&&1===a.nodeType)if(d="data-"+b.replace(Q,"-$&").toLowerCase(),c=a.getAttribute(d),"string"==typeof c){try{c="true"===c?!0:"false"===c?!1:"null"===c?null:+c+""===c?+c:P.test(c)?n.parseJSON(c):c;
-}catch(e){}O.set(a,b,c)}else c=void 0;return c}n.extend({hasData:function(a){return O.hasData(a)||N.hasData(a)},data:function(a,b,c){return O.access(a,b,c)},removeData:function(a,b){O.remove(a,b)},_data:function(a,b,c){return N.access(a,b,c)},_removeData:function(a,b){N.remove(a,b)}}),n.fn.extend({data:function(a,b){var c,d,e,f=this[0],g=f&&f.attributes;if(void 0===a){if(this.length&&(e=O.get(f),1===f.nodeType&&!N.get(f,"hasDataAttrs"))){c=g.length;while(c--)g[c]&&(d=g[c].name,0===d.indexOf("data-")&&(d=n.camelCase(d.slice(5)),R(f,d,e[d])));N.set(f,"hasDataAttrs",!0)}return e}return"object"==typeof a?this.each(function(){O.set(this,a)}):K(this,function(b){var c,d;if(f&&void 0===b){if(c=O.get(f,a)||O.get(f,a.replace(Q,"-$&").toLowerCase()),void 0!==c)return c;if(d=n.camelCase(a),c=O.get(f,d),void 0!==c)return c;if(c=R(f,d,void 0),void 0!==c)return c}else d=n.camelCase(a),this.each(function(){var c=O.get(this,d);O.set(this,d,b),a.indexOf("-")>-1&&void 0!==c&&O.set(this,a,b)})},null,b,arguments.length>1,null,!0)},removeData:function(a){return this.each(function(){O.remove(this,a)})}}),n.extend({queue:function(a,b,c){var d;return a?(b=(b||"fx")+"queue",d=N.get(a,b),c&&(!d||n.isArray(c)?d=N.access(a,b,n.makeArray(c)):d.push(c)),d||[]):void 0},dequeue:function(a,b){b=b||"fx";var c=n.queue(a,b),d=c.length,e=c.shift(),f=n._queueHooks(a,b),g=function(){n.dequeue(a,b)};"inprogress"===e&&(e=c.shift(),d--),e&&("fx"===b&&c.unshift("inprogress"),delete f.stop,e.call(a,g,f)),!d&&f&&f.empty.fire()},_queueHooks:function(a,b){var c=b+"queueHooks";return N.get(a,c)||N.access(a,c,{empty:n.Callbacks("once memory").add(function(){N.remove(a,[b+"queue",c])})})}}),n.fn.extend({queue:function(a,b){var c=2;return"string"!=typeof a&&(b=a,a="fx",c--),arguments.length",""],thead:[1,""],col:[2,""],tr:[2,""],td:[3,""],_default:[0,"",""]};$.optgroup=$.option,$.tbody=$.tfoot=$.colgroup=$.caption=$.thead,$.th=$.td;function _(a,b){var c="undefined"!=typeof a.getElementsByTagName?a.getElementsByTagName(b||"*"):"undefined"!=typeof a.querySelectorAll?a.querySelectorAll(b||"*"):[];return void 0===b||b&&n.nodeName(a,b)?n.merge([a],c):c}function aa(a,b){for(var c=0,d=a.length;d>c;c++)N.set(a[c],"globalEval",!b||N.get(b[c],"globalEval"))}var ba=/<|?\w+;/;function ca(a,b,c,d,e){for(var f,g,h,i,j,k,l=b.createDocumentFragment(),m=[],o=0,p=a.length;p>o;o++)if(f=a[o],f||0===f)if("object"===n.type(f))n.merge(m,f.nodeType?[f]:f);else if(ba.test(f)){g=g||l.appendChild(b.createElement("div")),h=(Y.exec(f)||["",""])[1].toLowerCase(),i=$[h]||$._default,g.innerHTML=i[1]+n.htmlPrefilter(f)+i[2],k=i[0];while(k--)g=g.lastChild;n.merge(m,g.childNodes),g=l.firstChild,g.textContent=""}else m.push(b.createTextNode(f));l.textContent="",o=0;while(f=m[o++])if(d&&n.inArray(f,d)>-1)e&&e.push(f);else if(j=n.contains(f.ownerDocument,f),g=_(l.appendChild(f),"script"),j&&aa(g),c){k=0;while(f=g[k++])Z.test(f.type||"")&&c.push(f)}return l}!function(){var a=d.createDocumentFragment(),b=a.appendChild(d.createElement("div")),c=d.createElement("input");c.setAttribute("type","radio"),c.setAttribute("checked","checked"),c.setAttribute("name","t"),b.appendChild(c),l.checkClone=b.cloneNode(!0).cloneNode(!0).lastChild.checked,b.innerHTML="",l.noCloneChecked=!!b.cloneNode(!0).lastChild.defaultValue}();var da=/^key/,ea=/^(?:mouse|pointer|contextmenu|drag|drop)|click/,fa=/^([^.]*)(?:\.(.+)|)/;function ga(){return!0}function ha(){return!1}function ia(){try{return d.activeElement}catch(a){}}function ja(a,b,c,d,e,f){var g,h;if("object"==typeof b){"string"!=typeof c&&(d=d||c,c=void 0);for(h in b)ja(a,h,c,d,b[h],f);return a}if(null==d&&null==e?(e=c,d=c=void 0):null==e&&("string"==typeof c?(e=d,d=void 0):(e=d,d=c,c=void 0)),e===!1)e=ha;else if(!e)return a;return 1===f&&(g=e,e=function(a){return n().off(a),g.apply(this,arguments)},e.guid=g.guid||(g.guid=n.guid++)),a.each(function(){n.event.add(this,b,e,d,c)})}n.event={global:{},add:function(a,b,c,d,e){var f,g,h,i,j,k,l,m,o,p,q,r=N.get(a);if(r){c.handler&&(f=c,c=f.handler,e=f.selector),c.guid||(c.guid=n.guid++),(i=r.events)||(i=r.events={}),(g=r.handle)||(g=r.handle=function(b){return"undefined"!=typeof n&&n.event.triggered!==b.type?n.event.dispatch.apply(a,arguments):void 0}),b=(b||"").match(G)||[""],j=b.length;while(j--)h=fa.exec(b[j])||[],o=q=h[1],p=(h[2]||"").split(".").sort(),o&&(l=n.event.special[o]||{},o=(e?l.delegateType:l.bindType)||o,l=n.event.special[o]||{},k=n.extend({type:o,origType:q,data:d,handler:c,guid:c.guid,selector:e,needsContext:e&&n.expr.match.needsContext.test(e),namespace:p.join(".")},f),(m=i[o])||(m=i[o]=[],m.delegateCount=0,l.setup&&l.setup.call(a,d,p,g)!==!1||a.addEventListener&&a.addEventListener(o,g)),l.add&&(l.add.call(a,k),k.handler.guid||(k.handler.guid=c.guid)),e?m.splice(m.delegateCount++,0,k):m.push(k),n.event.global[o]=!0)}},remove:function(a,b,c,d,e){var f,g,h,i,j,k,l,m,o,p,q,r=N.hasData(a)&&N.get(a);if(r&&(i=r.events)){b=(b||"").match(G)||[""],j=b.length;while(j--)if(h=fa.exec(b[j])||[],o=q=h[1],p=(h[2]||"").split(".").sort(),o){l=n.event.special[o]||{},o=(d?l.delegateType:l.bindType)||o,m=i[o]||[],h=h[2]&&new RegExp("(^|\\.)"+p.join("\\.(?:.*\\.|)")+"(\\.|$)"),g=f=m.length;while(f--)k=m[f],!e&&q!==k.origType||c&&c.guid!==k.guid||h&&!h.test(k.namespace)||d&&d!==k.selector&&("**"!==d||!k.selector)||(m.splice(f,1),k.selector&&m.delegateCount--,l.remove&&l.remove.call(a,k));g&&!m.length&&(l.teardown&&l.teardown.call(a,p,r.handle)!==!1||n.removeEvent(a,o,r.handle),delete i[o])}else for(o in i)n.event.remove(a,o+b[j],c,d,!0);n.isEmptyObject(i)&&N.remove(a,"handle events")}},dispatch:function(a){a=n.event.fix(a);var b,c,d,f,g,h=[],i=e.call(arguments),j=(N.get(this,"events")||{})[a.type]||[],k=n.event.special[a.type]||{};if(i[0]=a,a.delegateTarget=this,!k.preDispatch||k.preDispatch.call(this,a)!==!1){h=n.event.handlers.call(this,a,j),b=0;while((f=h[b++])&&!a.isPropagationStopped()){a.currentTarget=f.elem,c=0;while((g=f.handlers[c++])&&!a.isImmediatePropagationStopped())a.rnamespace&&!a.rnamespace.test(g.namespace)||(a.handleObj=g,a.data=g.data,d=((n.event.special[g.origType]||{}).handle||g.handler).apply(f.elem,i),void 0!==d&&(a.result=d)===!1&&(a.preventDefault(),a.stopPropagation()))}return k.postDispatch&&k.postDispatch.call(this,a),a.result}},handlers:function(a,b){var c,d,e,f,g=[],h=b.delegateCount,i=a.target;if(h&&i.nodeType&&("click"!==a.type||isNaN(a.button)||a.button<1))for(;i!==this;i=i.parentNode||this)if(1===i.nodeType&&(i.disabled!==!0||"click"!==a.type)){for(d=[],c=0;h>c;c++)f=b[c],e=f.selector+" ",void 0===d[e]&&(d[e]=f.needsContext?n(e,this).index(i)>-1:n.find(e,this,null,[i]).length),d[e]&&d.push(f);d.length&&g.push({elem:i,handlers:d})}return h]*)\/>/gi,la=/