编译器:Qt 语言:C++
这个程序不适合我哈哈，这已经是我第三次求助了，快把我逼疯了(谢谢大家对我的耐心和帮助)
我尝试运行我的程序(又是第一百万次)因为我无法整理出 ostream，所以我注释掉了 main 中的所有 cout 函数，这样我就可以处理我的其余代码了。但是当我尝试运行它时，我得到了 collect2: ld returned 1 exit status in my build issues。
我切换到编译输出...天哪..
Running build steps for project List... Configuration unchanged, skipping qmake step. Starting: "C:/Qt/2010.05/mingw/bin/mingw32-make.exe" -w mingw32-make: Entering directory `C:/Qt/2010.05/bin/List-build-desktop'
C:/Qt/2010.05/mingw/bin/mingw32-make -f Makefile.Debug
mingw32-make[1]: Entering directory `C:/Qt/2010.05/bin/List-build-desktop'
g++ -enable-stdcall-fixup -Wl,-enable-auto-import -Wl,-enable-runtime-pseudo-reloc -Wl,-subsystem,console -mthreads -Wl -o debug\List.exe debug/main.o debug/list.o -L"c:\Qt\2010.05\qt\lib" -lQtCored4
debug/main.o:C:\Qt\2010.05\bin\List-build-desktop/../List//List.h:194: undefined reference to `List::getNewNode(double const&)'
debug/main.o:C:\Qt\2010.05\bin\List-build-desktop/../List//List.h:215: undefined reference to `List::getNewNode(double const&)'
debug/main.o:C:\Qt\2010.05\bin\List-build-desktop/../List//List.h:215: undefined reference to `List::getNewNode(int const&)'
debug/main.o:C:\Qt\2010.05\bin\List-build-desktop/../List//List.h:194: undefined reference to `List::getNewNode(int const&)'
debug/main.o:C:\Qt\2010.05\bin\List-build-desktop/../List//List.h:466: undefined reference to `List::getNewNode(int const&)'
debug/main.o:C:\Qt\2010.05\bin\List-build-desktop/../List//List.h:466: undefined reference to `List::getNewNode(double const&)'
collect2: ld returned 1 exit status
mingw32-make[1]: Leaving directory `C:/Qt/2010.05/bin/List-build-desktop'
mingw32-make: Leaving directory `C:/Qt/2010.05/bin/List-build-desktop'
mingw32-make[1]: * [debug\List.exe] Error 1
mingw32-make: * [debug] Error 2
The process "C:/Qt/2010.05/mingw/bin/mingw32-make.exe" exited with code %2. Error while building project List (target: Desktop) When executing build step 'Make'
这基本上就是我得到的。我有 2 个头文件和一个源文件。 header :ListNode.h 和 list.h，我的 cpp 是 main.cpp
一切都相互链接，所以我不明白为什么它会给我 undefined reference 错误。
我的所有其他 friend 几乎都放弃了这项任务，而我拒绝放弃。我只是今晚不 sleep 哈。再次感谢您的帮助!
编辑::-- 代码
列表节点.h
#ifndef LISTNODE_H
#define LISTNODE_H
template<typename NODETYPE> class List;
template<typename NODETYPE>
class ListNode
{
friend class List< NODETYPE >;
public:
ListNode(const NODETYPE &);
NODETYPE getData() const;
private:
NODETYPE data;
ListNode< NODETYPE > *nextPtr;
};
template<typename NODETYPE>
ListNode< NODETYPE >::ListNode(const NODETYPE &info)
:data(info), nextPtr(0)
{
}
template<typename NODETYPE>
NODETYPE ListNode< NODETYPE >::getData() const
{
return data;
}
#endif // LISTNODE_H
我不会把所有东西都放上去，因为很多...这是 List.h..我只能想象其中有多少仍然是错误的，但我无法检查，因为错误...
#include <iostream>
using std::cout;
#include <fstream>
#include <string>
using std::ostream;
#include "ListNode.h"
template< typename NODETYPE >
class List
{
//template <typename OUTPUT >
//friend ostream &operator <<(ostream &, const List<NODETYPE> & );
public:
List();
~List();
void insertAtFront( const NODETYPE & );
void insertAtBack( const NODETYPE & );
bool removeFromFront( NODETYPE & );
bool removeFromBack( NODETYPE & );
bool isEmpty() const;
void print() const;
bool append(const NODETYPE &);
bool add_n(int, const NODETYPE &);
bool concat(List&);
void reverse();
bool remove_last();
bool remove_n(int);
void sort();
bool merge(List&);
void add_in(const NODETYPE &);
void remove(const NODETYPE &);
NODETYPE sum();
int count();
private:
ListNode< NODETYPE > *firstPtr;
ListNode< NODETYPE > *lastPtr;
ListNode< NODETYPE > *getNewNode( const NODETYPE &);
};
template<typename NODETYPE>
List<NODETYPE>::List()
: firstPtr(0), lastPtr(0)
{
}
template< typename NODETYPE>
List<NODETYPE>::~List()
{
if( !isEmpty() )
{
cout << "Destroying Nodes...\n";
ListNode< NODETYPE > *currentPtr = firstPtr;
ListNode< NODETYPE > *tempPtr;
while ( currentPtr != 0)
{
tempPtr = currentPtr;
cout << tempPtr->data << "\n";
currentPtr = currentPtr->nextPtr;
delete tempPtr;
}
}
cout << "All nodes destroyed \n\n";
}
template< typename NODETYPE >
void List< NODETYPE>::insertAtFront(const NODETYPE &value)
{
ListNode< NODETYPE > *newPtr = getNewNode (value);
if( isEmpty())
firstPtr = lastPtr = newPtr;
else
{
newPtr->nextPtr = firstPtr;
firstPtr = newPtr;
}
}
template< typename NODETYPE >
void List<NODETYPE>::insertAtBack(const NODETYPE &value)
{
ListNode<NODETYPE> *newPtr = getNewNode(value);
if( isEmpty())
firstPtr = lastPtr = newPtr;
else
{
lastPtr->nextPtr = newPtr;
lastPtr = newPtr;
}
}
template< typename NODETYPE >
bool List<NODETYPE>::removeFromFront(NODETYPE &value)
{
if(isEmpty())
return false;
else
{
ListNode<NODETYPE> *tempPtr = firstPtr;
if(firstPtr == lastPtr)
firstPtr = lastPtr = 0;
else
firstPtr = firstPtr->nextPtr;
value = tempPtr->data;
delete tempPtr;
return true;
}
}
template<typename NODETYPE>
bool List<NODETYPE>::removeFromBack(NODETYPE &value)
{
if( isEmpty())
return false;
else
{
ListNode<NODETYPE> *tempPtr = lastPtr;
if(firstPtr == lastPtr)
firstPtr = lastPtr = 0;
else
{
ListNode<NODETYPE> *currentPtr = firstPtr;
while (currentPtr->nextPtr != lastPtr)
currentPtr = currentPtr->nextPtr;
lastPtr=currentPtr;
currentPtr->nextPtr = 0;
}
value = tempPtr->data;
delete tempPtr;
return true;
}
}
template<typename NODETYPE>
bool List<NODETYPE>::isEmpty() const
{
return firstPtr == 0;
}
template<typename NODETYPE>
void List<NODETYPE>::print() const
{
if( isEmpty())
{
cout<<"The list is empty \n\n";
return;
}
ListNode<NODETYPE> *currentPtr = firstPtr;
cout<< "The list is: ";
while(currentPtr != 0)
{
cout<<currentPtr->data>> ' ';
currentPtr = currentPtr->nextPtr;
}
cout<< "\n\n";
}
/*template<typename NODETYPE>
ostream &operator <<(ostream &output, const List<NODETYPE>& value)
{
output << value;
return output;
}*/
template<typename NODETYPE>
bool List<NODETYPE>::append(const NODETYPE &value)
{
ListNode<NODETYPE> *newPtr = getNewNode(value);
if(isEmpty())
{
firstPtr = lastPtr = newPtr;
return true;
}
else
{
ListNode<NODETYPE> *tempPtr = lastPtr;
tempPtr->nextPtr=newPtr;
lastPtr = newPtr;
return true;
}
}
template<typename NODETYPE>
bool List<NODETYPE>::add_n(int a, const NODETYPE &value)
{
ListNode<NODETYPE> *newPtr = getNewNode(value);
if(isEmpty())
{
firstPtr = lastPtr = newPtr;
return true;
}
if(a <= count())
{
lastPtr->nextPtr = newPtr;
lastPtr = newPtr;
return true;
}
else
{
ListNode<NODETYPE> *currentPtr = firstPtr;
for(int cntr = 1; cntr < count(); cntr++)
{
if(cntr == a)
{
newPtr->nextPtr = currentPtr->nextPtr;
currentPtr->nextPtr = newPtr;
return true;
}
currentPtr = currentPtr->nextPtr;
}
return false;
}
}
template<typename NODETYPE>
bool List<NODETYPE>::concat(List<NODETYPE> &li)
{
if(isEmpty())
return false;
if(li.isEmpty())
return false;
else
{
ListNode<NODETYPE> *tempPtr = lastPtr;
tempPtr->nextPtr = li.firstPtr;
tempPtr = tempPtr->nextPtr;
while(tempPtr->nextPtr != 0)
tempPtr = tempPtr->nextPtr;
lastPtr = tempPtr;
return true;
}
}
template<typename NODETYPE>
void List<NODETYPE>::reverse()
{
if(isEmpty())
return;
else
{
int chk = count();
ListNode<NODETYPE> *currentPtr = firstPtr->nextPtr;
ListNode<NODETYPE> *tempPtr = firstPtr;
ListNode<NODETYPE> *tempPtr2;
for(int a = 1; a < chk; a++)
{
tempPtr2 = currentPtr->nextPtr;
tempPtr->nextPtr = currentPtr->nextPtr;
currentPtr->nextPtr = firstPtr;
firstPtr = currentPtr;
currentPtr = tempPtr2;
}
lastPtr = tempPtr;
}
}
主要.cpp
#include "List.h"
#include <iostream>
using std::cout;
using std::endl;
int main()
{
List<int> Li, Li2, Li3;
List<double> Ld, Ld2;
Ld.append(11.1);
Ld.append(22.2);
Ld.append(33.3);
Ld.add_n(35.5,2);
//cout << "Ld is: " << Ld << endl;
Ld.reverse();
//cout << "Ld is: " << Ld << endl;
Li.add_n(15,-1);
Li.add_n(16,0);
Li.add_n(17,1);
Li.append(10);
//cout << "Li is: " << Li << endl;
Li2.append(5);
Li2.append(6);
Li2.add_n(7,2);
Li2.add_n(8,1);
//cout << "Li2 is: " << Li2 << endl;
// You shouldn't use Li2 after the concatenation, because the
// elements aren't copied, just connected to form one list.
Li.concat(Li2);
//cout << "Li is: " << Li << endl;
//cout << "Li2 is: " << Li2 << endl;
Li.sort();
//cout << "Li is: " << Li << endl;
Li3.append(20);
Li3.append(10);
Li3.add_n(50,1);
Li3.add_n(40,3);
//cout << "Li3 is: " << Li3 << endl;
Li.merge(Li3);
//cout << "Li is: " << Li << endl;
//cout << "Li3 is: " << Li3 << endl;
Li3.sort();
//cout << "Li3 is: " << Li3 << endl;
// Li3 should not be used after the merge, since the nodes have been removed.
Li.merge(Li3);
//cout << "Li is: " << Li << endl;
Li.add_in(25);
Li.add_in(4);
//cout << "Li is: " << Li << endl;
Li.remove(10);
Li.remove(50);
//cout << "Li is: " << Li << endl;
Ld.add_in(14.3);
Ld.remove(14.3);
//cout << "Ld is: " << Ld << endl;
Ld2 = Ld;
//cout << "Ld is: " << Ld << endl;
//cout << "Ld2 is: " << Ld2 << endl;
Ld.sort();
//cout << "Ld is: " << Ld << endl;
//cout << "Ld2 is: " << Ld2 << endl;
cout << "Li has " << Li.count() << " nodes with a total value of "
<< Li.sum() << endl;
cout << "Ld has " << Ld.count() << " nodes with a total value of "
<< Ld.sum() << endl;
return 0;
}
要求的.pro文件
#-------------------------------------------------
#
# Project created by QtCreator 2012-09-20T02:33:43
#
#-------------------------------------------------
QT += core
QT -= gui
TARGET = List
CONFIG += console
CONFIG -= app_bundle
TEMPLATE = app
SOURCES += main.cpp \
list.cpp
HEADERS += \
list.h \
ListNode.h
最佳答案
你好像忘了创建你的 List::getNewNode 函数。
关于c++ - 收集 2 : Ld returned 1 exit status build make error，我们在Stack Overflow上找到一个类似的问题： https://stackoverflow.com/questions/12509187/
我的瘦服务器配置了nginx，我的ROR应用程序正在它们上运行。在我发布代码更新时运行thinrestart会给我的应用程序带来一些停机时间。我试图弄清楚如何优雅地重启正在运行的Thin实例，但找不到好的解决方案。有没有人能做到这一点？ 最佳答案 #Restartjustthethinserverdescribedbythatconfigsudothin-C/etc/thin/mysite.ymlrestartNginx将继续运行并代理请求。如果您将Nginx设置为使用多个上游服务器，例如server{listen80;server
如何将send与+=一起使用？a=20;a.send"+=",10undefinedmethod`+='for20:Fixnuma=20;a+=10=>30 最佳答案 恐怕你不能。+=不是方法，而是语法糖。参见http://www.ruby-doc.org/docs/ProgrammingRuby/html/tut_expressions.html它说Incommonwithmanyotherlanguages,Rubyhasasyntacticshortcut:a=a+2maybewrittenasa+=2.你能做的最好的事情是:
我对如何计算通过{%assignvar=0%}赋值的变量加一完全感到困惑。这应该是最简单的任务。到目前为止，这是我尝试过的:{%assignamount=0%}{%forvariantinproduct.variants%}{%assignamount=amount+1%}{%endfor%}Amount:{{amount}}结果总是0。也许我忽略了一些明显的东西。也许有更好的方法。我想要存档的只是获取运行的迭代次数。 最佳答案 因为{{incrementamount}}将输出您的变量值并且不会影响{%assign%}定义的变量，我
我知道还有其他相同的问题，但他们没有解决我的问题。我不断收到错误:Aws::Errors::MissingRegionErrorinBooksController#create,缺少区域；使用:region选项或将区域名称导出到ENV['AWS_REGION']。但是，这是我的配置开发.rb:config.paperclip_defaults={storage::s3,s3_host_name:"s3-us-west-2.amazonaws.com",s3_credentials:{bucket:ENV['AWS_BUCKET'],access_key_id:ENV['AWS_ACCE
有几种方法:first_or_create_by、find_or_create_by等，它们的工作原理是:与数据库对话以尝试找到我们想要的东西如果我们找不到，就自己做保存到数据库显然，并发调用这些方法可能会使两个线程都找不到它们想要的东西，并且在第3步中一个线程会意外失败。似乎更好的解决方案是，创建或查找即:提前在您的数据库中创建合理的唯一性约束。如果你想保存一些东西，就保存它如果有效，那就太好了。如果它因为RecordNotUnique异常而无法工作，它已经存在，太好了，加载它那么在什么情况下我想使用Rails内置的东西而不是我自己的(看起来更可靠)create_or_find？
我仍然收到标题中的“错误”消息，但不知道如何解决。在ApplicationController中，classApplicationController在routes.rb#match'set_activity_account/:id/:value'=>'users#account_activity',:as=>:set_activity_account--thisdoesn'tworkaswell..resources:usersdomemberdoget:action_a,:action_bendcollectiondoget'account_activity'endend和User
我有一个数组数组，想将元素附加到子数组。+=做我想做的，但我想了解为什么push不做。我期望的行为(并与+=一起工作):b=Array.new(3,[])b[0]+=["apple"]b[1]+=["orange"]b[2]+=["frog"]b=>[["苹果"],["橙子"],["Frog"]]通过推送，我将推送的元素附加到每个子数组(为什么？):a=Array.new(3,[])a[0].push("apple")a[1].push("orange")a[2].push("frog")a=>[[“苹果”、“橙子”、“Frog”]、[“苹果”、“橙子”、“Frog”]、[“苹果”、“
我在使用FasterCSV和我的rakedb:seeds迁移时遇到问题。我收到错误:“rake中止!未加引号的字段不允许\r或\n(第2行)”在以下seeds.rb数据上:require'csv'directory="db/init_data/"file_name="gardenzing020812.csv"path_to_file=directory+file_nameputs'LoadingPlantrecords'#Pre-loadallPlantrecordsn=0CSV.foreach(path_to_file)do|row|Plant.create!:name=>row[1
有没有办法让Ruby能够做这样的事情？classPlane@moved=0@x=0defx+=(v)#thisiserror@x+=v@moved+=1enddefto_s"moved#{@moved}times,currentxis#{@x}"endendplane=Plane.newplane.x+=5plane.x+=10putsplane.to_s#moved2times,currentxis15 最佳答案 您不能在Ruby中覆盖复合赋值运算符。任务在内部处理。您应该覆盖+，而不是+=。plane.a+=b与plane.a=
出于某种原因，heroku尝试要求dm-sqlite-adapter，即使它应该在这里使用Postgres。请注意，这发生在我打开任何URL时-而不是在gitpush本身期间。我构建了一个默认的Facebook应用程序。gem文件:source:gemcuttergem"foreman"gem"sinatra"gem"mogli"gem"json"gem"httparty"gem"thin"gem"data_mapper"gem"heroku"group:productiondogem"pg"gem"dm-postgres-adapter"endgroup:development,:t