好的，我正在编写一个程序，它使用几个不同的类，包括链接排序列表和二叉搜索树/节点类。当我在 Visual Studio 中编译时，它运行起来完全没有任何问题，100% 流畅，并且我已经在那里对其进行了完全调试，没有出现任何错误。但是，当我将它放入 Unix 中时，我必须打开它，然后用 g++ 对其进行测试，一切都变得糟糕透顶。如果我尝试访问的不仅仅是二叉树的根，我会得到一个“分段错误”。
当我使用命令“g++ main.cpp”时，我看到几十个对其他类的成员函数的“未定义引用”。现在，我确实拥有所有必要的#include 语句，以及使用“#ifndef/#define/#endif”语句。唯一给我带来问题的两个类是 Employee 和 SearchTreeNode 类。以下是这两个以及主要的：
#include "LinkedSortedList.h"
#include "LinkedNode.h"
#include "Employee.h"
#include "SearchTreeNode.h"
#include <string>
#include <ostream>
#include <iostream>
#include <fstream>
using namespace std;
int main() {
LinkedSortedList<Employee> mylist; //create the LSL
SearchTree mytree; //create the BST
int searchCount = 0; //occasionally used to count recursive calls to function
bool _continue = true;
char command;
do{
cout << "\nEnter your command: \n" << endl;
cout << "(I)nsert\n(F)ind Employee from ID\n(D)elete Employee from ID\n(L)ast Name Search\n(S)ave to file\n(R)ead from file\n(Q)uit" << endl;
cin >> command;
if(command == 'I' || command == 'i'){
//insert
Employee* newEmployee = new Employee();
newEmployee->create();
mylist.insert(*newEmployee);
mytree.insert(newEmployee);
cout << "Employee Added\n----------\n" << endl;
newEmployee->print();
cout << "\n----------\n" << endl;
}
else if(command == 'L' || command == 'l'){
//arbitrary pointer to undefined matches to be used in fetchAllMatches()
LinkedSortedList<Employee>* matches;
string name;
cout << "Last Name to Search for: " << endl;
cin >> name;
Employee* search = new Employee();
search->setLastName(name);
int matchCount = mylist.fetchAllMatches(*search, matches, matchCount);
cout << mylist.size() << " Records Searched.\n"<< matchCount << " Matches Found:" << endl;
//Make sure that there is something to print to avoid errors
if(matchCount > 0)
matches->print();
}
else if(command == 'D' || command == 'd'){
int IDnumber;
cout << "Enter Employee ID to delete: " << endl;
cin >> IDnumber;
if(mytree.getRoot() != NULL) { // make sure there is a tree to search through
Employee *x = mytree.find(IDnumber, searchCount, mytree.getRoot());
if(x->getAddress() != "null"){
mylist.remove(*x);
mytree.remove(x->getId());
cout << "\n" << x << "\n---------\n" << "File Deleted" << endl;
}
} else {
cout << "Tree is empty" << endl;
}
}
else if(command == 'F' || command == 'f'){
int IDnumber;
cout << "Enter Employee ID to find: " << endl;
cin >> IDnumber;
searchCount = 0;
if(mytree.getRoot() != NULL) { // make sure there is a tree to search through
Employee* x = mytree.find(IDnumber, searchCount, mytree.getRoot());
if(x->getAddress() != "null"){
cout << "\n" << *x << "\n" << endl;
} else {
cout << "Employee not found!" << endl;
}
} else {
cout << "Tree is empty" << endl;
}
}
else if(command == 'S' || command == 's'){
string file;
cout << "Write Database to File Name: " << endl;
cin >> file;
mylist.printToFile(file, mylist);
}
else if(command == 'T' || command == 't'){
mytree.print(mytree.getRoot());
}
else if(command == 'R' || command == 'r'){
//read
if(mylist.size() > 0) {
mylist.clear();
mytree.clearTree(mytree);
}
string line;
string file;
int intLine;
cout << "File Name: " << endl;
cin >> file;
ifstream myfile(file.c_str());
if (myfile.is_open())
{
getline (myfile,line);
if(line != "<Records>"){
cout << "Not a database file." << endl;
}
//make sure it's still ok
while ( myfile.good() )
{
getline(myfile, line);
if(line != "<END>"){
Employee* newEmployee = new Employee();
for(int i = 0; i < 10; i++){
switch (i){
case 0:
newEmployee->setLastName(line);
break;
case 1:
getline(myfile, line);
newEmployee->setFirstName(line);
break;
case 2:
myfile >> intLine;
newEmployee->setId(intLine);
break;
case 3:
myfile >> intLine;
myfile.get();
newEmployee->setSalary(intLine);
break;
case 4:
getline(myfile, line);
newEmployee->setDept(line);
break;
case 5:
getline(myfile, line);
newEmployee->setPhone(line);
break;
case 6:
getline(myfile, line);
newEmployee->setAddress(line);
break;
case 7:
getline(myfile, line);
newEmployee->setHireDate(line);
break;
case 8:
getline(myfile, line);
newEmployee->setEmail(line);
break;
case 9:
getline(myfile, line);//eat the dashes
break;
}
}
mylist.insert(*newEmployee);
mytree.insert(newEmployee);
}
else {
myfile.close();
}
}
}
else cout << "Unable to open file";
}
else if(command == 'Q' || command == 'q'){
return 0;
}
else if(command == 'P' || command == 'p'){
mylist.print();
}
}
while(_continue);
return 0;
}
#include <iostream>
using namespace std;
#ifndef _EmployeeClass_
#define _EmployeeClass_
class Employee {
public:
Employee(){
firstName;
lastName;
department;
email;
dateHired;
phoneNumber;
homeAddress;
employeeID = 0;
salary = 0;
//this->create();
}
Employee(string last, string first, int ID, int _salary, string dept, string phone,
string address, string hireDate, string _email){
lastName = last;
firstName = first;
employeeID = ID;
salary = _salary;
department = dept;
phoneNumber = phone;
homeAddress = address;
dateHired = hireDate;
email = _email;
employeeCount++;
}
void create();
//list of getter functions to return private variables, preventing direct access.
int getId();
int getSalary();
string getFirstName();
string getLastName();
string getDept();
string getHireDate();
string getEmail();
string getAddress();
string getPhone();
friend bool operator!= (Employee &x, Employee &y);
friend bool operator== (Employee &x, Employee &y);
friend bool operator<= (Employee &x, Employee &y);
friend bool operator>= (Employee &x, Employee &y);
friend bool operator< (Employee &x, Employee &y);
friend bool operator> (Employee &x, Employee &y);
friend ostream& operator<<(ostream& output, Employee& x);
void print();
//list of setter functions to set values for the private variables, without allowing direct access.
void setPhone(string phone);
void setId(int ID);
void setSalary(int salary);
void setFirstName(string name);
void setLastName(string surname);
void setDept(string dept);
void setHireDate(string hireDate);
void setEmail(string email);
void setAddress(string address);
private:
//private member variables dependant on input for each individual object
string firstName;
string lastName;
string department;
string email;
string dateHired;
string homeAddress;
string phoneNumber;
int employeeID;
int salary;
int employeeCount;
};
#endif
这是员工类：
#include <iostream>
#include "Employee.h"
#ifndef _SearchTreeNodeClass_
#define _SearchTreeNodeClass_
//this class makes a binary search tree of "search tree nodes" which contain 3 pointers:
//left: points to left child (value always less than node)
//right: points to right child (value always greater than node)
//data: points to an Employee object in memory.
using namespace std;
class SearchTreeNode
{
private:
SearchTreeNode( Employee* D,SearchTreeNode* L = NULL, SearchTreeNode* R = NULL ) // constructor
{
data = D;
left = L;
right = R;
};
int count;
Employee* data; // node data
SearchTreeNode* left; // pointer to the left subSearchTree
SearchTreeNode* right; // pointer to the right subSearchTree
friend class SearchTree; // give SearchTree complete access
};
#endif
#ifndef _SearchTreeClass_
#define _SearchTreeClass_
using namespace std;
class SearchTree
{
public:
SearchTree();
virtual ~SearchTree();
SearchTree( const SearchTree& );
SearchTree& operator=( SearchTree& );
SearchTreeNode* getRoot();
SearchTreeNode* find(int, SearchTreeNode*);
Employee* find(int, int, SearchTreeNode* );
void insert( Employee* );
void print();
void destroy( SearchTreeNode* );
void print( SearchTreeNode* );
void clearTree( SearchTree& );
void inorder( SearchTreeNode* );
void remove( int x );
private:
SearchTreeNode* root; // pointer to the root of the search SearchTree
SearchTreeNode* copy( SearchTreeNode* );
void insert( SearchTreeNode*& root, Employee* );
};
#endif