pitaya-launcher/js/store/reducers/profile.js

115 lines
2.5 KiB
JavaScript

var _ = require('lodash');
var actions = require('../actions');
module.exports = function(oldProfile, action) {
switch(action.type) {
case actions.launcher.LOAD_PROFILE_SUCCESS:
return _.cloneDeep(action.profile);
case actions.edit.MOVE_PROFILE_ITEM:
return moveProfileItem(oldProfile, action.movedItem, action.targetItem);
case actions.edit.ADD_PROFILE_ITEM:
return addProfileItem(oldProfile, action.newItem, action.targetItem);
case actions.edit.UPDATE_PROFILE_ITEM:
return updateProfileItem(oldProfile, action.item, action.key, action.value);
case actions.edit.SELECT_PROFILE_ITEM:
return selectProfileItem(oldProfile, action.item);
default:
return oldProfile || null;
}
};
function selectProfileItem(oldProfile, item) {
var newProfile = _.cloneDeep(oldProfile);
return newProfile;
}
function updateProfileItem(oldProfile, targetItem, key, value) {
var newProfile = _.cloneDeep(oldProfile);
var result = treeFind(newProfile, targetItem);
result.item[key] = value;
return newProfile;
}
function moveProfileItem(oldProfile, movedItem, targetItem) {
var newProfile = _.cloneDeep(oldProfile);
var previousParent = treeFind(newProfile, movedItem).parent;
var newParent = treeFind(newProfile, targetItem).item;
previousParent.items = _.reject(previousParent.items, function(item) {
return _.isEqual(item, movedItem);
});
newParent.items = newParent.items || [];
newParent.items.push(_.cloneDeep(movedItem));
return newProfile;
}
function addProfileItem(oldProfile, newItem, targetItem) {
var newProfile = _.cloneDeep(oldProfile);
var newParent = treeFind(newProfile, targetItem).item;
newParent.items = newParent.items || [];
newParent.items.push(_.cloneDeep(newItem));
return newProfile;
}
// Tree manipulation helpers
function treeWalk(branch, func) {
var items = branch.items;
if(!items) return;
for( var i = 0, item = items[i]; (item = items[i]); i++ ) {
var breakHere = func(item, parent);
if(breakHere) return breakHere;
if(item.items) {
breakHere = treeWalk(item, func);
if(breakHere) return breakHere;
}
}
}
function treeFind(branch, obj) {
var items = branch.items;
if(!items) return;
for( var i = 0, item = items[i]; (item = items[i]); i++ ) {
if( _.isEqual(item, obj) ) {
return {item: item, parent: branch};
}
if(item.items) {
var result = treeFind(item, obj);
if(result) return result;
}
}
}