C??++方式npminstallnode-gyp-gmkdirdemo&&cdDemo&&npminitcreatefib.cccreatebinding.gypnode-gypconfigurebuildcreatetestindex.jsfilenode-gyphttps://github.com/nodejs/nod...为了测试性能比较，该算法使用斐波那契的递归实现。fib.cc://addon.cc#include命名空间演示{使用v8::Exception;使用v8::FunctionCallbackInfo；使用v8::隔离；使用v8::本地；使用v8::编号；使用v8::对象；使用v8::字符串；使用v8::值；unsignedintFib_Recursive(unsignedintfib){if(fib>2){return(Fib_Recursive(fib-1)+Fib_Recursive(fib-2));}elseif(2==fib){返回1;}elseif(1==fib){返回1;}返回1;}voidFib(constFunctionCallbackInfo&args){Isolate*isolate=args.GetIsolate();if(!args[0]->IsNumber()){isolate->ThrowException(Exception::TypeError(String::NewFromUtf8(isolate,"Wrongarguments")));返回;}intvalue=Fib_Recursive(args[0]->NumberValue());Localnum=Number::New(隔离,价值）;args.GetReturnValue().Set(num);}voidInit(Local
