110 lines
2.5 KiB
C++
110 lines
2.5 KiB
C++
|
/*
|
||
|
|
----
|
||
|
|
This file is part of SECONDO.
|
||
|
|
|
||
|
|
Copyright (C) 2004, University in Hagen, Department of Computer Science,
|
||
|
|
Database Systems for New Applications.
|
||
|
|
|
||
|
|
SECONDO is free software; you can redistribute it and/or modify
|
||
|
|
it under the terms of the GNU General Public License as published by
|
||
|
|
the Free Software Foundation; either version 2 of the License, or
|
||
|
|
(at your option) any later version.
|
||
|
|
|
||
|
|
SECONDO is distributed in the hope that it will be useful,
|
||
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
GNU General Public License for more details.
|
||
|
|
|
||
|
|
You should have received a copy of the GNU General Public License
|
||
|
|
along with SECONDO; if not, write to the Free Software
|
||
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||
|
|
----
|
||
|
|
|
||
|
|
//paragraph [1] Title: [{\Large \bf \begin{center}] [\end{center}}]
|
||
|
|
//paragraph [10] Footnote: [{\footnote{] [}}]
|
||
|
|
//[TOC] [\tableofcontents]
|
||
|
|
|
||
|
|
[1] Implementation of the no\_nodes Operator
|
||
|
|
|
||
|
|
[TOC]
|
||
|
|
|
||
|
|
0 Overview
|
||
|
|
|
||
|
|
1 Defines and Includes
|
||
|
|
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "op_no_nodes.h"
|
||
|
|
|
||
|
|
#include "ListUtils.h"
|
||
|
|
#include "QueryProcessor.h"
|
||
|
|
#include "BTree2.h"
|
||
|
|
|
||
|
|
extern NestedList* nl;
|
||
|
|
extern QueryProcessor *qp;
|
||
|
|
|
||
|
|
namespace BTree2Algebra {
|
||
|
|
namespace Operators {
|
||
|
|
|
||
|
|
/*
|
||
|
|
2 Operator ~no\_nodes~
|
||
|
|
|
||
|
|
Signature is
|
||
|
|
|
||
|
|
----
|
||
|
|
no[_]nodes: (btree2) --> (int)
|
||
|
|
----
|
||
|
|
|
||
|
|
2.1 TypeMapping
|
||
|
|
|
||
|
|
*/
|
||
|
|
ListExpr no_nodes::TypeMapping( ListExpr args){
|
||
|
|
if(nl->ListLength(args) != 1){
|
||
|
|
return listutils::typeError("Operator expects exactly one argument");
|
||
|
|
}
|
||
|
|
if(!listutils::isBTree2Description(nl->First(args))){
|
||
|
|
return listutils::typeError("Operator expects a btree2 object "
|
||
|
|
"as argument.");
|
||
|
|
}
|
||
|
|
return (nl->SymbolAtom(CcInt::BasicType()));
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
2.2 Valuemapping
|
||
|
|
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
no_nodes::ValueMapping(Word* args, Word& result, int message,
|
||
|
|
Word& local, Supplier s)
|
||
|
|
{
|
||
|
|
result = qp->ResultStorage(s);
|
||
|
|
BTree2* btree = (BTree2*)args[0].addr;
|
||
|
|
CcInt *res = (CcInt*) result.addr;
|
||
|
|
res->Set( true, btree->GetNodeCount());
|
||
|
|
return 0;
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
2.3 Operator specification
|
||
|
|
|
||
|
|
*/
|
||
|
|
struct no_nodesInfo : OperatorInfo {
|
||
|
|
|
||
|
|
no_nodesInfo() : OperatorInfo()
|
||
|
|
{
|
||
|
|
name = "no_nodes";
|
||
|
|
signature = "(btree2 Tk Td u) -> int";
|
||
|
|
syntax = "no_nodes ( _ )";
|
||
|
|
meaning = "Returns the number of nodes in the btree2.";
|
||
|
|
example = "query no_nodes (staedte_btree2)";
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
|
||
|
|
Operator no_nodes::def( no_nodesInfo(), no_nodes::ValueMapping,
|
||
|
|
no_nodes::TypeMapping);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|