83 lines
1.8 KiB
TypeScript
83 lines
1.8 KiB
TypeScript
import SimpleSchema from 'simpl-schema';
|
|
import STORAGE_LIMITS from '/imports/constants/STORAGE_LIMITS';
|
|
|
|
export interface Reference {
|
|
collection: string,
|
|
id: string,
|
|
}
|
|
|
|
export interface TreeDoc {
|
|
_id: string,
|
|
root: Reference,
|
|
parentId?: string,
|
|
left: number,
|
|
right: number,
|
|
}
|
|
|
|
const RefSchema = new SimpleSchema({
|
|
id: {
|
|
type: String,
|
|
regEx: SimpleSchema.RegEx.Id,
|
|
},
|
|
collection: {
|
|
type: String,
|
|
max: STORAGE_LIMITS.collectionName,
|
|
},
|
|
});
|
|
|
|
const ChildSchema = new SimpleSchema({
|
|
root: {
|
|
type: Object,
|
|
},
|
|
'root.id': {
|
|
type: String,
|
|
regEx: SimpleSchema.RegEx.Id,
|
|
index: 1,
|
|
},
|
|
'root.collection': {
|
|
type: String,
|
|
max: STORAGE_LIMITS.collectionName,
|
|
},
|
|
// Parent id of a document in the same collection
|
|
// Undefined parent id implies the root is the parent
|
|
parentId: {
|
|
type: String,
|
|
regEx: SimpleSchema.RegEx.Id,
|
|
optional: true,
|
|
},
|
|
/**
|
|
* The tree structure goes as follows where the numbering follows a counterclockwise depth first
|
|
* path around the tree. The canonical structure comes from the root and parentId references,
|
|
* while the left and right numbering is used to optimize ancestor queries.
|
|
*
|
|
* Left can be used as the canonical ordering of properties in an expanded tree folder view.
|
|
*
|
|
* 1 Books 12
|
|
* ┃
|
|
* 2 Programming 11
|
|
* ┏━━━━━━━━┻━━━━━━━━━┓
|
|
* 3 Languages 4 5 Databases 10
|
|
* ┏━━━━━━━┻━━━━━━━┓
|
|
* 6 MongoDB 7 8 dbm 9
|
|
*/
|
|
left: {
|
|
type: Number,
|
|
index: 1,
|
|
},
|
|
right: {
|
|
type: Number,
|
|
index: 1,
|
|
}
|
|
});
|
|
|
|
export const treeDocFields = {
|
|
_id: 1,
|
|
root: 1,
|
|
parentId: 1,
|
|
left: 1,
|
|
right: 1,
|
|
}
|
|
|
|
export default ChildSchema;
|
|
export { RefSchema };
|