pnsdata.c

mico_example_siegel c源代码

#include "PNSData.h"
#include <string.h>

// Locate an item in the tree - returning the data contained within it

unsigned char PNData::locate(const char *name, CORBA::Object_ptr &obj) {
  TreeNode *t;
  unsigned long status=locate_node(name,t);
  if (status)
    obj=t->m_item.obj;
  return status;
}

// Add some information to the tree
// If the data was there already - replace the previous entry
// otherwise returns the node off which it should be inserted

void PNData::insert(const char *name, CORBA::Object_ptr obj) {
  TreeNode *temp;
//  cout << " run to insert function 1st point ok " << endl;
  if (!locate_node(name,temp)) {
    TreeNode *new_node=new TreeNode;
    strcpy(new_node->m_item.name,name);
    new_node->m_item.obj=obj;
    if (m_root==0) {
      m_root=new_node;
//    cout << " run to insert function 2ND point ok " << endl;
      return;
    }
    if (strcmp(name,temp->m_item.name)<0)
      temp->m_left=new_node;
    else
      temp->m_right=new_node;
  }
  else {
    CORBA::release(temp->m_item.obj);
    temp->m_item.obj=obj;
  }
//cout << " run to insert function  EXIT point ok " << endl;
}

// Locate a node in the tree - returns whether found or not
// If found, ret_node is set to be the node where it was found

unsigned char PNData::locate_node(const char *name, TreeNode * &ret_node) {
  int compare;
  ret_node=m_root;
  if (ret_node==0) return 0;
  compare=strcmp(name,ret_node->m_item.name);
  while (compare!=0) {
    if (compare<0) {
      if (ret_node->m_left==0)
        return 0;
      else
        ret_node=ret_node->m_left;
    }
    else {
      if (ret_node->m_right==0)
        return 0;
      else
        ret_node=ret_node->m_right;
    }
    compare=strcmp(name,ret_node->m_item.name);
  }
  return 1;
}