/*
Copyright (c) 2011, Tim Branyen @tbranyen
*/
#include
#include
#include
#include "../vendor/libgit2/include/git2.h"
#include "../include/repo.h"
#include "../include/tree.h"
#include "../include/tree_entry.h"
using namespace v8;
using namespace node;
void GitTree::Initialize (Handle target) {
HandleScope scope;
Local t = FunctionTemplate::New(New);
constructor_template = Persistent::New(t);
constructor_template->InstanceTemplate()->SetInternalFieldCount(1);
constructor_template->SetClassName(String::NewSymbol("Tree"));
NODE_SET_PROTOTYPE_METHOD(constructor_template, "entryCount", EntryCount);
NODE_SET_PROTOTYPE_METHOD(constructor_template, "entryByIndex", EntryByIndex);
NODE_SET_PROTOTYPE_METHOD(constructor_template, "entryByName", EntryByName);
NODE_SET_PROTOTYPE_METHOD(constructor_template, "sortEntries", EntryCount);
target->Set(String::NewSymbol("Tree"), constructor_template->GetFunction());
}
git_tree* GitTree::GetValue() {
return this->tree;
}
void GitTree::SetValue(git_tree* tree) {
this->tree = tree;
}
size_t GitTree::EntryCount() {
return git_tree_entrycount(this->tree);
}
git_tree_entry* GitTree::EntryByIndex(int idx) {
return git_tree_entry_byindex(this->tree, idx);
}
git_tree_entry* GitTree::EntryByName(const char* name) {
return git_tree_entry_byname(this->tree, name);
}
int GitTree::SortEntries() {
//return git_tree_sort_entries(this->tree);
return 0;
}
Handle GitTree::New(const Arguments& args) {
HandleScope scope;
GitTree *tree = new GitTree();
tree->Wrap(args.This());
return args.This();
}
Handle GitTree::EntryCount(const Arguments& args) {
HandleScope scope;
GitTree *tree = ObjectWrap::Unwrap(args.This());
int count = tree->EntryCount();
return Local::New(Integer::New(count));
}
Handle GitTree::EntryByIndex(const Arguments& args) {
HandleScope scope;
GitTree *tree = ObjectWrap::Unwrap(args.This());
if(args.Length() == 0 || !args[0]->IsObject()) {
return ThrowException(Exception::Error(String::New("TreeEntry is required and must be a Object.")));
}
if(args.Length() == 1 || !args[1]->IsNumber()) {
return ThrowException(Exception::Error(String::New("Index is required and must be a Number.")));
}
GitTreeEntry* entry = ObjectWrap::Unwrap(args[0]->ToObject());
int index = args[1]->ToInteger()->Value();
entry->SetValue(tree->EntryByIndex(index));
return Undefined();
}
Handle GitTree::EntryByName(const Arguments& args) {
HandleScope scope;
GitTree *tree = ObjectWrap::Unwrap(args.This());
if(args.Length() == 0 || !args[0]->IsObject()) {
return ThrowException(Exception::Error(String::New("TreeEntry is required and must be a Object.")));
}
if(args.Length() == 1 || !args[1]->IsString()) {
return ThrowException(Exception::Error(String::New("Name is required and must be a String.")));
}
GitTreeEntry* entry = ObjectWrap::Unwrap(args[0]->ToObject());
int index = args[1]->ToInteger()->Value();
String::Utf8Value name(args[1]->ToString());
entry->SetValue(tree->EntryByName(*name));
return Undefined();
}
Handle GitTree::SortEntries(const Arguments& args) {
HandleScope scope;
GitTree *tree = ObjectWrap::Unwrap(args.This());
int err = tree->SortEntries();
return Integer::New(err);
}
Handle GitTree::ClearEntries(const Arguments& args) {
//HandleScope scope;
//GitTree *tree = ObjectWrap::Unwrap(args.This());
//tree->ClearEntries();
//
return Undefined();
}
Persistent GitTree::constructor_template;