pub struct NoteId(pub Ulid);Expand description
Clé primaire relationnelle de tout dans Gradatum.
ULID (Universally Unique Lexicographically Sortable Identifier) :
- 128 bits : 48 bits timestamp ms + 80 bits random.
- Sortable lexicographiquement → les notes plus récentes sont “après” les anciennes.
- Monotone dans le même milliseconde (pas de collision dans un process).
Tuple Fields§
§0: UlidImplementations§
Trait Implementations§
impl Copy for NoteId
Source§impl<'de> Deserialize<'de> for NoteId
impl<'de> Deserialize<'de> for NoteId
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for NoteId
impl StructuralPartialEq for NoteId
Auto Trait Implementations§
impl Freeze for NoteId
impl RefUnwindSafe for NoteId
impl Send for NoteId
impl Sync for NoteId
impl Unpin for NoteId
impl UnsafeUnpin for NoteId
impl UnwindSafe for NoteId
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more