facebook/sapling
1
1
Fork 0
mirror of https://github.com/facebook/sapling.git synced 2024-12-28 23:54:12 +03:00
Code Issues Projects Releases Wiki Activity
3bb2fa1efb
sapling/lib/manifest/Cargo.toml

22 lines
517 B
TOML
Raw Normal View History

Add manifest crate Summary: The seed for the rust implementation of manifests. We start with the most primitive API for manifests and maps a paths to a `Node`. At the basic level we need the same operations that a map implements so we start with `insert`, `get` and `remove`. We know that retrieving data for Manifests can fail so we encode that in our interface using `Fallible`. I let for future iterations requiring iterator or returning manifest flags. Reviewed By: DurhamG Differential Revision: D14016274 fbshipit-source-id: 8f1f83610933b9e9a96f8c5ba2c6e50567c76e06
2019-02-14 23:50:05 +03:00
[package]
name = "manifest"
version = "0.1.0"
authors = ["Facebook Source Control Team <sourcecontrol-dev@fb.com>"]
edition = "2018"
manifest: add Arbitrary implementation for FileType and FileMetadata Summary: These implementations are going to used in quickcheck tests. Differential Revision: D14178259 fbshipit-source-id: 0bded67deab3422b4aad53666c14cf195ea1b0d4
2019-02-23 02:38:53 +03:00
[features]
default = []
for-tests = ["quickcheck"]
Add manifest crate Summary: The seed for the rust implementation of manifests. We start with the most primitive API for manifests and maps a paths to a `Node`. At the basic level we need the same operations that a map implements so we start with `insert`, `get` and `remove`. We know that retrieving data for Manifests can fail so we encode that in our interface using `Fallible`. I let for future iterations requiring iterator or returning manifest flags. Reviewed By: DurhamG Differential Revision: D14016274 fbshipit-source-id: 8f1f83610933b9e9a96f8c5ba2c6e50567c76e06
2019-02-14 23:50:05 +03:00
[dependencies]
manifest: move Store behind Arc Summary: We want the Manifest share their durable nodes. The path that I want to go is enable cloning for individual manifests. What to do with the storage then? Share it in an `Arc`. (Note: this ignores all push blocking failures!) Reviewed By: quark-zju Differential Revision: D15290170 fbshipit-source-id: 621d5d70700c4372c3b40a246fc45d9446b13ac5
2019-05-17 20:20:17 +03:00
bytes = { version = "0.4.11", features = ["serde"] }
Add manifest crate Summary: The seed for the rust implementation of manifests. We start with the most primitive API for manifests and maps a paths to a `Node`. At the basic level we need the same operations that a map implements so we start with `insert`, `get` and `remove`. We know that retrieving data for Manifests can fail so we encode that in our interface using `Fallible`. I let for future iterations requiring iterator or returning manifest flags. Reviewed By: DurhamG Differential Revision: D14016274 fbshipit-source-id: 8f1f83610933b9e9a96f8c5ba2c6e50567c76e06
2019-02-14 23:50:05 +03:00
failure = "0.1.3"
manifest: bump version of once_cell to 0.2.0 Summary: A recent update to the crates in tp2 bumped the `once_cell` crate to version 0.2.0. This broke the build because the `Cargo.toml` for the `manifest` crate specified version 0.1.8. Apparently just changing the crate version to 0.2.0 fixes the build, so we weren't affected by whatever breaking changes were made to the crate. Reviewed By: DurhamG Differential Revision: D15492142 fbshipit-source-id: 552b0a751ab7c2aab5f0fbcb1124de4ea427790c
2019-05-24 08:35:02 +03:00
once_cell = "0.2.0"
manifest: add Arbitrary implementation for FileType and FileMetadata Summary: These implementations are going to used in quickcheck tests. Differential Revision: D14178259 fbshipit-source-id: 0bded67deab3422b4aad53666c14cf195ea1b0d4
2019-02-23 02:38:53 +03:00
quickcheck = { version = "0.6.2", optional = true }
manifest: add flush function to manifests Summary: Save, finalize, flush, they mean about the same thing. The first thing to note is that this implementation is not complete because the parents are not correctly passed into the hashing function. The second thing is that store failures make the code a little more complex than it would have been otherwise. (Note: this ignores all push blocking failures!) Reviewed By: quark-zju Differential Revision: D14292713 fbshipit-source-id: 807d7a385a62cb5f4948f1781d3146eaa6502ca9
2019-03-06 03:08:15 +03:00
rust-crypto = "0.2"
Add manifest crate Summary: The seed for the rust implementation of manifests. We start with the most primitive API for manifests and maps a paths to a `Node`. At the basic level we need the same operations that a map implements so we start with `insert`, `get` and `remove`. We know that retrieving data for Manifests can fail so we encode that in our interface using `Fallible`. I let for future iterations requiring iterator or returning manifest flags. Reviewed By: DurhamG Differential Revision: D14016274 fbshipit-source-id: 8f1f83610933b9e9a96f8c5ba2c6e50567c76e06
2019-02-14 23:50:05 +03:00
types = { path = "../types" }
Add in memory representation for manifest tree Summary: Starting the implementation of tree manifest with the in memory nodes and implementing `get` and `insert`. The in memory nodes are called `Ephemeral` and the stored immutable nodes are going to be called `Durable`. Using a `BTreeMap` for storing the children because we want to efficiently insert, fetch and remove path components. We also want iteration to be done in ordered fashion so BTreeMap is our collection in this case. Removing elements from the tree is going to be implemented in a future update. Reviewed By: DurhamG Differential Revision: D14016273 fbshipit-source-id: d3bc22e5ddb21b689d07a7d74bd639b8c2b138ce
2019-02-14 23:50:05 +03:00
[dev-dependencies]
manifest: add Arbitrary implementation for FileType and FileMetadata Summary: These implementations are going to used in quickcheck tests. Differential Revision: D14178259 fbshipit-source-id: 0bded67deab3422b4aad53666c14cf195ea1b0d4
2019-02-23 02:38:53 +03:00
quickcheck = "0.6.2"
Add in memory representation for manifest tree Summary: Starting the implementation of tree manifest with the in memory nodes and implementing `get` and `insert`. The in memory nodes are called `Ephemeral` and the stored immutable nodes are going to be called `Durable`. Using a `BTreeMap` for storing the children because we want to efficiently insert, fetch and remove path components. We also want iteration to be done in ordered fashion so BTreeMap is our collection in this case. Removing elements from the tree is going to be implemented in a future update. Reviewed By: DurhamG Differential Revision: D14016273 fbshipit-source-id: d3bc22e5ddb21b689d07a7d74bd639b8c2b138ce
2019-02-14 23:50:05 +03:00
types = { path = "../types", default-features = false, features = ["for-tests"] }
Reference in New Issue Copy Permalink