Commit: beaef01972d35e24e8f0d7f56d6ddadc30a86f09 - star (git)

Commit MetaInfo

• Revisão: beaef01972d35e24e8f0d7f56d6ddadc30a86f09 (tree)
• Hora: 2020-11-22 20:52:21
• Autor: dhrname <dhrname@user...>
• Commiter: dhrname

Mensagem de Log

Add the throwNULLArgument

Mudança Sumário

• modified: joestar/cpp/main.cpp

Diff

--- a/joestar/cpp/main.cpp
+++ b/joestar/cpp/main.cpp
@@ -23,6 +23,8 @@
 
 #include <iostream>
 #include <string>
+#include <typeinfo>
+#include <stdexcept>
 
 /*Nodeの抽象クラス
  * 5方向リンクのリスト
@@ -31,13 +33,24 @@ class Node
 {
 public:
   virtual Node* getParent() = 0;
+  virtual void  setParent(Node*) = 0;
+  
   virtual Node* getNext() = 0;
+  virtual void  setNext(Node*) = 0;
+  
   virtual Node* getPrev() = 0;
+  virtual void  setPrev(Node*) = 0;
+  
   virtual Node* getFirstChild() = 0;
+  virtual void  setFirstChild(Node*) = 0;
+  
   virtual Node* getLastChild() = 0;
-  virtual Node* removeChild(Node*) = 0;
-  virtual Node* insertBefore(Node*) = 0;
-  virtual Node* appendChild(Node*) = 0;
+  virtual void  setLastChild(Node*) = 0;
+  
+  virtual Node* removeChild(Node* const) = 0;
+  virtual Node* insertBefore(Node* const, Node* const) = 0;
+  virtual Node* appendChild(Node* const) = 0;
+  
   virtual bool isNode() = 0;
 };
 
@@ -45,13 +58,18 @@ public:
 class EmptyNode: public Node
 {
 public:
-  Node* getParent(){return this;};
-  Node* getNext(){return this;};
-  Node* getPrev(){return this;};
-  Node* getFirstChild(){return this;};
-  Node* getLastChild(){return this;};
+  Node* getParent() {return this;};
+  Node* getNext() {return this;};
+  Node* getPrev() {return this;};
+  Node* getFirstChild() {return this;};
+  Node* getLastChild() {return this;};
+  void setParent(Node* node){};
+  void setNext(Node* node){};
+  void setPrev(Node* node){};
+  void setFirstChild(Node* node){};
+  void setLastChild(Node* node){};
   Node* removeChild(Node*){return this;};
-  Node* insertBefore(Node*){return this;};
+  Node* insertBefore(Node*, Node*){return this;};
   Node* appendChild(Node*){return this;};
   bool isNode()
   {
@@ -59,13 +77,13 @@ public:
   }
 };
 
-Node* const emptynode = new EmptyNode();
+EmptyNode* const emptynode = new EmptyNode();
 
 /*BaseNodeの基底クラス
  * Node抽象クラスに対する内部実装*/
 class BaseNode: public EmptyNode
 {
-private:
+protected:
   Node* parentNode;
   Node* nextSibling;
   Node* previousSibling;
@@ -83,39 +101,81 @@ public:
 
   virtual ~BaseNode(){}
   
-  virtual void setParent(Node* node);
-  virtual void setNext(Node* node);
-  virtual void setPrev(Node* node);
-  virtual void setFirstChild(Node* node);
-  virtual void setLastChild(Node* node);
+  virtual void throwNULLArgumentError(Node* const, const std::string&);
+  virtual void throwArgumentError(Node* const, const std::string&);
+  
+  virtual void setParent(Node*);
+  virtual void setNext(Node*);
+  virtual void setPrev(Node*);
+  virtual void setFirstChild(Node*);
+  virtual void setLastChild(Node*);
+  
   virtual Node* getParent();
   virtual Node* getNext();
   virtual Node* getPrev();
   virtual Node* getFirstChild();
   virtual Node* getLastChild();
+  
   virtual Node* removeChild(Node*);
-  virtual Node* insertBefore(Node*);
+  virtual Node* insertBefore(Node*, Node*);
   virtual Node* appendChild(Node*);
-  virtual bool isNode()
+  
+  virtual bool isNode() const
   {
       return true;
   }
 };
 
+/*throwNULLArgumentError 関数
+ * 引数のNULLチェックをして、nullptrだったら例外を投げる
+ * @param node 木構造の節
+ * @param name 引数の例外が発生したメンバ関数名*/
+inline void BaseNode::throwNULLArgumentError(Node* const node, const std::string& name)
+{
+  if (nullptr == node)
+  {
+    /*バグの放置を防ぐため、例外を投げる前に、エラーを出力して報告*/
+    std::cerr << "NULL Argument Error on the member " << name << std::endl;
+    throw std::invalid_argument("error!");
+  }
+}
 
+/*throwArgumentError 関数
+ * 引数のチェックをして、nullptrか、emptynode(空ノード)だったら例外を投げる
+ * @param node 木構造の節
+ * @param str 引数の例外が発生したメンバ関数名*/
+inline void BaseNode::throwArgumentError(Node* const node, const std::string& name)
+{
+  this->throwNULLArgumentError(node, name);
+  if ( node->isNode() )
+  {
+    /*バグの放置を防ぐため、例外を投げる前に、エラーを出力して報告*/
+    std::cerr << "Argument Error on the member " << name << std::endl;
+    throw std::invalid_argument("error!");
+  }
+}
 
-void BaseNode::setParent(Node* node){
+void BaseNode::setParent(Node* node)
+{
+  this->throwNULLArgumentError(node, "setParent");
   this->parentNode = node;
 }
-void BaseNode::setNext(Node* node){
+
+void BaseNode::setNext(Node* node)
+{
   this->nextSibling = node;
 }
-void BaseNode::setPrev(Node* node){
+
+void BaseNode::setPrev(Node* node)
+{
   this->previousSibling = node;
 }
-void BaseNode::setFirstChild(Node* node){
+
+void BaseNode::setFirstChild(Node* node)
+{
   this->firstChild = node;
 }
+
 void BaseNode::setLastChild(Node* node){
   this->lastChild = node;
 }
@@ -124,6 +184,7 @@ Node* BaseNode::getParent()
 {
   return this->parentNode;
 }
+
 Node* BaseNode::getNext()
 {
   return this->nextSibling;
@@ -140,11 +201,34 @@ Node* BaseNode::getLastChild()
 {
   return this->lastChild;
 }
-Node* BaseNode::removeChild(Node* const node)
+Node* BaseNode::removeChild(Node* const child)
 {
-  return this->parentNode;
+  this->throwArgumentError(child, "removeChild");
+  
+  child->setParent(emptynode);
+  
+  /*nodeが抜けた後、隣接ノードに関するメンバは書き換えておく*/
+  if (child->getPrev()->isNode())
+  {
+      child->getPrev()->setNext(child->getNext());
+  }
+  if (child->getNext()->isNode())
+  {
+      child->getNext()->setPrev(child->getPrev());
+  }
+ 
+  if (this->getLastChild() == child)
+  {
+      /*末尾ノードがchildである場合は自分のlastChildメンバを書きかえておく*/
+      this->lastChild = child->getPrev();
+  }
+      
+  child->setNext(emptynode);
+  child->setPrev(emptynode);
+
+  return child;
 }
-Node* BaseNode::insertBefore(Node* const node)
+Node* BaseNode::insertBefore(Node* const node, Node* const prev)
 {
   return this->parentNode;
 }
@@ -155,7 +239,14 @@ Node* BaseNode::appendChild(Node* const node)
 
 int main(int argc, char **argv)
 {
-	std::string str1 = "ABCD";
-    std::cout << str1 << std::endl;
+	std::string str1 = "ABC";
+    std::cout << "A" << str1 << std::endl;
+  try
+  {
+  }
+  catch(std::invalid_argument e)
+  {
+  }
+  delete emptynode;
 	return 0;
 }