153 lines
3.2 KiB
C++
153 lines
3.2 KiB
C++
//
|
|
// Copyright (C) 2001-2002 Graeme Walker <graeme_walker@users.sourceforge.net>
|
|
//
|
|
// 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., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
//
|
|
// ===
|
|
//
|
|
// garg.cpp
|
|
//
|
|
|
|
#include "gdef.h"
|
|
#include "garg.h"
|
|
#include "gpath.h"
|
|
#include "gstr.h"
|
|
#include "gdebug.h"
|
|
#include "gassert.h"
|
|
#include <cstring>
|
|
|
|
G::Arg::Arg()
|
|
{
|
|
// now use parse()
|
|
}
|
|
|
|
G::Arg::Arg( const Arg & other ) :
|
|
m_array(other.m_array) ,
|
|
m_prefix(other.m_prefix)
|
|
{
|
|
}
|
|
|
|
G::Arg & G::Arg::operator=( const Arg & rhs )
|
|
{
|
|
if( this != &rhs )
|
|
{
|
|
m_array = rhs.m_array ;
|
|
m_prefix = rhs.m_prefix ;
|
|
}
|
|
return *this ;
|
|
}
|
|
|
|
G::Arg::~Arg()
|
|
{
|
|
}
|
|
|
|
G::Arg::Arg( int argc , char *argv[] )
|
|
{
|
|
for( int i = 0 ; i < argc ; i++ )
|
|
m_array.push_back( argv[i] ) ;
|
|
|
|
setPrefix() ;
|
|
}
|
|
|
|
void G::Arg::setPrefix()
|
|
{
|
|
G_ASSERT( m_array.size() > 0U ) ;
|
|
Path path( m_array[0U] ) ;
|
|
path.removeExtension() ;
|
|
m_prefix = path.basename() ;
|
|
}
|
|
|
|
void G::Arg::parse( HINSTANCE hinstance , const std::string & command_line )
|
|
{
|
|
m_array.push_back( moduleName(hinstance) ) ;
|
|
G::Str::splitIntoTokens( command_line , m_array , " \t" ) ;
|
|
setPrefix() ;
|
|
}
|
|
|
|
bool G::Arg::contains( const std::string & sw , size_t sw_args ) const
|
|
{
|
|
return find( sw , sw_args , NULL ) ;
|
|
}
|
|
|
|
bool G::Arg::find( const std::string & sw , size_t sw_args , size_t * index_p ) const
|
|
{
|
|
for( size_t i = 1 ; i < m_array.size() ; i++ ) // start from v[1]
|
|
{
|
|
if( sw == m_array[i] && (i+sw_args) < m_array.size() )
|
|
{
|
|
if( index_p != NULL )
|
|
*index_p = i ;
|
|
return true ;
|
|
}
|
|
}
|
|
return false ;
|
|
}
|
|
|
|
void G::Arg::remove( const std::string & sw , size_t sw_args )
|
|
{
|
|
size_t i = 0U ;
|
|
const bool found = find( sw , sw_args , &i ) ;
|
|
if( found )
|
|
removeAt( i , sw_args ) ;
|
|
}
|
|
|
|
void G::Arg::removeAt( size_t sw_index , size_t sw_args )
|
|
{
|
|
G_ASSERT( sw_index > 0U && sw_index < m_array.size() ) ;
|
|
if( sw_index > 0U && sw_index < m_array.size() )
|
|
{
|
|
Array::iterator p = m_array.begin() + sw_index ;
|
|
p = m_array.erase( p ) ;
|
|
for( size_t i = 0U ; i < sw_args && p != m_array.end() ; i++ )
|
|
p = m_array.erase( p ) ;
|
|
}
|
|
}
|
|
|
|
size_t G::Arg::index( const std::string & sw , size_t sw_args ) const
|
|
{
|
|
size_t i = 0U ;
|
|
const bool found = find( sw , sw_args , &i ) ;
|
|
return found ? i : 0U ;
|
|
}
|
|
|
|
size_t G::Arg::c() const
|
|
{
|
|
return m_array.size() ;
|
|
}
|
|
|
|
std::string G::Arg::v( size_t i ) const
|
|
{
|
|
G_ASSERT( i < m_array.size() ) ;
|
|
return m_array[i] ;
|
|
}
|
|
|
|
std::string G::Arg::prefix() const
|
|
{
|
|
return m_prefix ;
|
|
}
|
|
|
|
//static
|
|
const char * G::Arg::prefix( char * argv [] ) // throw()
|
|
{
|
|
const char * exe = argv[0] ;
|
|
const char * p1 = std::strrchr( exe , '/' ) ;
|
|
const char * p2 = std::strrchr( exe , '\\' ) ;
|
|
p1 = p1 ? (p1+1U) : exe ;
|
|
p2 = p2 ? (p2+1U) : exe ;
|
|
return p1 > p2 ? p1 : p2 ;
|
|
}
|
|
|