xoonips/AL/criteria.cc

/*
 * --------------------------------------------------------------------------  
 * XooNiPs Xoops modules for Neuroinformatics Platforms                        
 * Copyright (C) 2005 RIKEN, Japan. All rights reserved.                       
 * http://sourceforge.jp/projects/xoonips/                                     
 * --------------------------------------------------------------------------  
 * This program 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.                      
 *                                                                             
 * This program 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 this program; if not, write to the Free Software                 
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA. 
 * --------------------------------------------------------------------------  
 * 
 * SQL鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申criteria鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * 
 * $Revision: 1.3 $
 * $Log: criteria.cc,v $
 * Revision 1.3  2004/11/27 01:08:08  youi
 * clearAll:orderby鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申.
 *
 * Revision 1.2  2004/11/27 00:39:57  youi
 * orderby鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申column鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申.
 *
 * Revision 1.1  2004/11/24 06:54:31  youi
 * initial version
 *
 * 
 */
#include <stdlib.h>
#include <string.h>

#include "common.h"
#include "criteria.h"

/**
 * SQL鐃緒申ORDERBY鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * 
 * @param column 鐃緒申鐃緒申鐃緒申鐃緒申
 * @param order 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申(鐃緒申鐃緒申鐃緒申鐃緒申 orderby::ASC)
 * @ref orderby::ASC
 * @ref orderby::DESC
 * 
 */
orderby::orderby( const char* column = "", int order = orderby::ASC ){
    this -> column = 0;
    setValue( &this -> column, column );
    this -> order = order;
    this -> next = 0;
}

/**
 * 
 * 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * 
 * 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * 
 */
orderby::~orderby( ){
    delete this -> column;
}
    
/**
 * 
 * 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * @return 鐃緒申鐃緒申鐃緒申鐃緒申
 * 
 */
const char* orderby::getColumn( ) const { return column; }

/**
 * 
 * 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * @return 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * @ref orderby::ASC
 * @ref orderby::DESC
 * 
 */
order_t orderby::getOrder( ) const{ return order; }

/**
 * 
 * SQL鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申(LIMIT)鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申(鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申)鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * 鐃緒申.
 * 
 */
criteria::criteria( )
{
    start = 0;
    rows = 0;
    indexOfOrders = 0;
    ordersLen = 0;
    ordersMax = 16;
    orders = new orderby*[ ordersMax ];
    memset( orders, 0, sizeof( orderby* ) * ordersMax );
}

/**
 * 
 * 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * 
 * addOrderBy鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申orderby鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 *
 * @ref addOrderBy
 * 
 */
criteria::~criteria( )
{
    if( orders != 0 ){
        for( int i = 0; i < ordersLen; i++ ) delete orders[ i ];
        delete[] orders;
    }
}

/**
 * 
 * SQL鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申. 
 * 
 * @param start 鐃緒申鐃緒申鐃緒申
 * @param rows 鐃緒申鐃緒申
 * 
 */
void criteria::setLimit( int start , int rows )
{
    this -> start = start;
    this -> rows = rows;
}

/**
 * 
 * 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申SQL鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * 
 * @param order orderby鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 *
 */
void criteria::addOrderBy( orderby *order )
{
    if( ordersMax == ordersLen ){
        //orders鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
        orderby** ptr = new orderby*[ ordersMax * 2 ];
        memset( ptr, 0, sizeof( orderby* ) * ordersMax * 2 );
        memcpy( ptr, orders, sizeof( orderby* ) * ordersMax );
        delete[] orders;
        ordersMax *= 2;
        orders = ptr;
    }
    orders[ ordersLen ] = order;
    ordersLen++;
}

/**
 * 
 * 鐃緒申鐃緒申鐃緒申orderby鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申. 2鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申orderby鐃緒申nextOrderBy鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申.<br>
 * 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申(unsafe)鐃緒申鐃緒申
 * 
 * @return 鐃緒申鐃緒申鐃緒申orderby
 * @return 0 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申orderby鐃緒申鐃緒申鐃緒申
 * @ref nextOrderBy
 * 
 */
const orderby* criteria::headOrderBy( )
{
    indexOfOrders = 0;
    if( indexOfOrders >= ordersLen ) return 0;
    return orders[ indexOfOrders++ ];
}

/**
 * 
 * orderby鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申.<br>
 * 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申(unsafe)鐃緒申鐃緒申
 * 
 * @return orderby鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申
 * @return 0 鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申orderby鐃緒申鐃緒申鐃緒申
 * @ref headNextOrderBy
 * 
 */
const orderby* criteria::nextOrderBy( )
{
    if( indexOfOrders >= ordersLen ) return 0;
    return orders[ indexOfOrders++ ];
}

/**
 * 
 * LIMIT鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申ORDERBY鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申.
 * 
 */
void criteria::clearAll( )
{
    for( int i = 0; i < ordersLen; i++ ) delete orders[ i ];
    memset( orders, 0, sizeof( orderby* ) * ordersMax );
    ordersLen = 0;
    start = rows = 0;
}

/**
 * 
 * LIMIT鐃緒申鐃緒申鐃緒申鐃緒申
 * 
 * @return 
 * 
 */
int criteria::getLimitStart( ) const { return start; }

/**
 * 
 * LIMIT鐃緒申鐃緒申鐃緒申
 * 
 * @return 
 * 
 */
int criteria::getLimitRows( ) const{ return rows; }