Merging algorithm
When composing stamps you actually merge their descriptors (aka metadata).
The Object.assign is used for these descriptor properties:
methods
The special deep merging algorithm (see below) is used for these descriptor properties:
The array concatenation and deduplication (see below) is used for these descriptor properties:
This is how initializers and composers metadata gets merged.
const _ = require('lodash')descriptor.initializers = _.uniq(_.concat(descriptor1.initializers, descriptor2.initializers))descriptor.composers = _.uniq(_.concat(descriptor1.composers, descriptor2.composers))
See the exact line of the reference implementation source code.
The stamp specification standardized the deep merging algorithm to, basically, this:
Plain objects are (recursively) deep merged, including ES6 Symbol keys.
Arrays are concatenated.
Functions, Symbols, RegExp, etc. values are copied by reference.
The last object type overwrites previous object type.
const MyStamp1 = stampit()const deepObject1 = {[Symbol('foo')]: { one: 'first' }, // this plain object will be deep mergedarray: [0, 'bar', () => {}, { obj: 'my object' }], // this array will be concatenated withfunc: MyStamp1, // this stamp will be replaced with another stampsomething: [42], // this array will be replaced with an objectoldKey: 'some value'}const MyStamp2 = stampit()const deepObject2 = {[Symbol('foo')]: { two: 'second' },array: [0, 'bar', { another: 'object' }],func: MyStamp2,something: { [0]: 42 },newKey: 'some value'}
The merged result of the two objects above will be this:
const deepResult = {[Symbol('foo')]: { one: 'first', two: 'second' }, // contains properties from both objectsarray: [0, 'bar', () => {}, { obj: 'my object' }, 0, 'bar', { another: 'object' }], // both arrays are herefunc: MyStamp2, // Stamp2 replaced the Stamp1something: { [0]: 42 }, // the array was replaced with the objectoldKey: 'some value', // these two were simply carried acrossnewKey: 'some value'}
See the exact line of the reference implementation source code.
