本文整理汇总了TypeScript中clone.default函数的典型用法代码示例。如果您正苦于以下问题:TypeScript default函数的具体用法?TypeScript default怎么用?TypeScript default使用的例子?那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了default函数的7个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的TypeScript代码示例。
示例1: defaultCropState
export const cropReducer = (state = defaultCropState(), action) => {
if (checkBadStoreId(state, action)) {
return state
}
switch (action.type) {
case CropActions.CROP_CHANGE:
return Object.assign({}, state, {
change: clone(action.crop)
});
case CropActions.CROP_SELECT:
case CropActions.CROP_RANDOM_SELECTION:
return Object.assign({}, state, {
selection: clone(action.crop)
});
case CropActions.CROP_FIELD_CHANGE:
const update = clone(state.selection);
update[action.field] = action.value;
return Object.assign({}, state, {
selection: update
});
default:
return state;
}
}
开发者ID:Arne-Sandberg,项目名称:HawsIoT-WebApp,代码行数:31,代码来源:crop-reducer.ts
示例2: clone
export const defaultOptionsState = (storeId = null) => {
return Object.assign({}, clone(OPTIONS_DEFAULT_STATE), {storeId})
};
开发者ID:Arne-Sandberg,项目名称:HawsIoT-WebApp,代码行数:3,代码来源:options-reducer.ts
示例3: createExchange
function createExchange(exchangeData)
{
/// *** BVUG WITH JQUERY &**** var cloned = $.extend(true, {}, exchangeData);
var cloned = clone(exchangeData);
cloned.trades = [];
init(cloned, BUY);
init(cloned, SELL);
return cloned;
function init(exchange, orderType)
{
if (!exchange[orderType])
{
exchange[orderType] = {};
exchange[orderType].volumes = {};
var options = {max: false};
if (BUY == orderType)
{
//
// Trades occur at the highest prices so we use the maximum binary heap
//
options.max = true;
}
exchange[orderType].prices = createBinaryHeap(options);
}
}
} module.exports = {
开发者ID:acrobat888,项目名称:NodeJS,代码行数:33,代码来源:exchange.ts
示例4: if
Arr["orderBy"] = function (func?: Mapper<T, number | string | Date>): ArrayX<T> {
var arr: T[] = clone(this).sort(function (a, b) {
var objA = func ? func(a) : a;
var objB = func ? func(b) : b;
var comparison = null;
if (objA && objB) {
if (type(objA) === "number")
comparison = objA - objB;
else if (type(objA) === "date")
comparison = objA.getTime() - objB.getTime();
else
comparison = objA.toString().localeCompare(objB.toString());
}
else {
if (!objA && !objB)
comparison = 0;
else if (!objA)
comparison = -1;
else
comparison = 1;
}
return comparison;
});
return new ArrayX<T>(...arr);
}
开发者ID:prmph,项目名称:lambda.js,代码行数:26,代码来源:index.ts
示例5: it
it("should throw an error", () => {
let badReducerComposer = clone(reducerComposer);
badReducerComposer.listManagement.data.lists.initialState = undefined;
expect(() => createReducerTree(badReducerComposer))
.toThrowError("The deepest level of every reducer branch should have initialData");
delete badReducerComposer.listManagement.data.lists.initialState;
expect(() => createReducerTree(badReducerComposer))
.toThrowError("The deepest level of every reducer branch should have initialData");
});
开发者ID:KwintenP,项目名称:create-reducer-tree,代码行数:10,代码来源:create-reducer-tree.spec.ts
示例6: function
Arr["groupByNumber"] = function (keyCount: number): Dictionary<ArrayX<T>> {
var groups: X.Dictionary<X.Array<T>> = {};
let groupLength = Math.floor(this.length / keyCount);
let remainder = this.length % this.count();
for (var i = 0; i < keyCount; i++) {
if (!groups.hasOwnProperty(i))
groups[i] = new X.Array<T>();
groups[i].append(clone(this).slice(i * groupLength, (i + 1) * groupLength));
}
return groups;
}
开发者ID:prmph,项目名称:lambda.js,代码行数:13,代码来源:index.ts
示例7: function
return function (state: any = clone(initialState), action: {type: string, payload: any}) {
if (actions.indexOf(action.type) > -1) {
let newState = {};
if (keys.indexOf("actions") > -1) {
return reducerTree.reducer(state, action);
} else {
keys.forEach(key => {
let reducer = createParentReducer(reducerTree[key]);
newState[key] = reducer(state[key], action);
});
}
return newState;
}
return state;
};
开发者ID:KwintenP,项目名称:create-reducer-tree,代码行数:16,代码来源:create-reducer-tree.ts
注:本文中的clone.default函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论