rationChapterTree.js 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107
  1. /**
  2. * Created by Tony on 2017/4/21.
  3. */
  4. var mongoose = require("mongoose");
  5. var dbm = require("../../../config/db/db_manager");
  6. var chapterTreeDb = dbm.getCfgConnection("rationRepository")
  7. var async = require("async");
  8. var Schema = mongoose.Schema;
  9. var rationChapterTreeSchema = mongoose.Schema({//章节树 //生成唯一id改为sectionID 改成string
  10. rationRepId: Number,
  11. ID:Number,
  12. ParentID:Number,
  13. NextSiblingID:Number,
  14. name: String,
  15. isDeleted: Boolean
  16. });
  17. var rationChapterTreeModel = chapterTreeDb.model("rationChapterTrees",rationChapterTreeSchema, "rationChapterTrees")
  18. var repositoryMap = require('./repositoryMap');
  19. var counter = require('../../../public/counter/counter');
  20. var rationChapterTreeDAO = function(){};
  21. rationChapterTreeDAO.prototype.getRationChapterTree = function(repositoryName,callback){
  22. repositoryMap.getRealLibName(repositoryName, function(err, rst){
  23. if (err || rst.length == 0) {
  24. callback("获取定额库错误!",false)
  25. } else {
  26. rationChapterTreeModel.find({"rationRepId": rst[0].ID, "$or": [{"isDeleted": null}, {"isDeleted": false} ]},function(err,data){
  27. if(data.length) callback(false,data);
  28. else if(err) callback("获取定额树错误!",false)
  29. else callback(false,false);
  30. })
  31. }
  32. })
  33. }
  34. rationChapterTreeDAO.prototype.createNewNode = function(repositoryName, lastNodeId, nodeData,callback){
  35. var promise = repositoryMap.getRealLibName(repositoryName), libId;
  36. if (promise) {
  37. promise.then(function(rst){
  38. libId = rst[0].ID;
  39. return counter.counterDAO.getIDAfterCount(counter.moduleName.rationTree, 1, function(err, result){
  40. nodeData.rationRepId = libId;
  41. nodeData.ID = result.value.sequence_value;
  42. var node = new rationChapterTreeModel(nodeData);
  43. node.save(function (err, result) {
  44. if (err) {
  45. callback("章节树ID错误!", false);
  46. } else {
  47. if (lastNodeId > 0) {
  48. rationChapterTreeModel.update({ID: lastNodeId}, {"NextSiblingID": nodeData.ID}, function(err, rst){
  49. if (err) {
  50. callback("章节树ID错误!", false);
  51. } else {
  52. callback(false, result);
  53. }
  54. });
  55. } else callback(false, result);
  56. }
  57. });
  58. });
  59. });
  60. } else {
  61. callback("定额库选择错误!", false);
  62. }
  63. },
  64. rationChapterTreeDAO.prototype.removeNodes = function(nodeIds, preNodeId, preNodeNextId, callback){
  65. var functions = [];
  66. if (preNodeId != -1) {
  67. functions.push((function(nodeId, nextId) {
  68. return function(cb) {
  69. rationChapterTreeModel.update({ID: nodeId}, {"NextSiblingID": nextId}, cb);
  70. };
  71. })(preNodeId, preNodeNextId));
  72. }
  73. for (var i=0; i < nodeIds.length; i++) {
  74. functions.push((function(nodeId) {
  75. return function(cb) {
  76. rationChapterTreeModel.update({ID: nodeId}, {"isDeleted": true}, cb);
  77. };
  78. })(nodeIds[i]));
  79. }
  80. async.parallel(functions, function(err, results) {
  81. callback(err, results);
  82. });
  83. }
  84. rationChapterTreeDAO.prototype.updateNodes = function(nodes,callback){
  85. var functions = [];
  86. for (var i=0; i < nodes.length; i++) {
  87. //var md = new rationChapterTreeModel(nodes[i]);
  88. //md.isNew = false;
  89. functions.push((function(doc) {
  90. return function(cb) {
  91. rationChapterTreeModel.update({ID: doc.ID}, doc, cb);
  92. };
  93. })(nodes[i]));
  94. }
  95. async.parallel(functions, function(err, results) {
  96. callback(err, results);
  97. });
  98. };
  99. module.exports = new rationChapterTreeDAO()