⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 parsepairstringtest.cxx

📁 RTP协议
💻 CXX
字号:
/* ==================================================================== * The Vovida Software License, Version 1.0  *  * Copyright (c) 2000 Vovida Networks, Inc.  All rights reserved. *  * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: *  * 1. Redistributions of source code must retain the above copyright *    notice, this list of conditions and the following disclaimer. *  * 2. Redistributions in binary form must reproduce the above copyright *    notice, this list of conditions and the following disclaimer in *    the documentation and/or other materials provided with the *    distribution. *  * 3. The names "VOCAL", "Vovida Open Communication Application Library", *    and "Vovida Open Communication Application Library (VOCAL)" must *    not be used to endorse or promote products derived from this *    software without prior written permission. For written *    permission, please contact vocal@vovida.org. * * 4. Products derived from this software may not be called "VOCAL", nor *    may "VOCAL" appear in their name, without prior written *    permission of Vovida Networks, Inc. *  * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED OR IMPLIED * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND * NON-INFRINGEMENT ARE DISCLAIMED.  IN NO EVENT SHALL VOVIDA * NETWORKS, INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT DAMAGES * IN EXCESS OF $1,000, NOR FOR ANY INDIRECT, INCIDENTAL, SPECIAL, * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH * DAMAGE. *  * ==================================================================== *  * This software consists of voluntary contributions made by Vovida * Networks, Inc. and many individuals on behalf of Vovida Networks, * Inc.  For more information on Vovida Networks, Inc., please see * <http://www.vovida.org/>. * */static const char* const ParsePairStringTest_cxx_Version =     "$Id: ParsePairStringTest.cxx,v 1.1 2001/04/13 06:30:19 icahoon Exp $";#include "Application.hxx"#include "ParsePair.hxx"#include <cassert>#include <iostream>using Vocal::Application;using Vocal::Configuration::ParsePair;using Vocal::Configuration::NameValueMap;using Vocal::Configuration::NO_VALUE;using Vocal::Configuration::VALUE_PRESENT;using Vocal::Configuration::VALUE_OPTIONAL;using Vocal::ReturnCode;using Vocal::SUCCESS;using std::cout;using std::endl;using std::list;using std::string;class TestApplication : public Application{    public:        ReturnCode      init(int, char**, char**);    	ReturnCode  	run();};Application *	Application::create(){    return ( new TestApplication );}ReturnCode  TestApplication::init(int argc, char ** argv, char ** arge){    string  xml("<data>\n\t<a> foo </a>\n\t<b/></data>");        ParsePair   xmlParser;        if ( xmlParser.parse(ParsePair::CFG_XML_STRING, xml) != SUCCESS )    {        return ( !SUCCESS );    }        const NameValueMap &  xml_opts = xmlParser.pairs();        for (   NameValueMap::const_iterator   j = xml_opts.begin();            j != xml_opts.end();            ++j        )    {        cout << "name: " << j->first;                if ( j->second.type != NO_VALUE )        {            cout << " value: ";                        const list<string> & values = j->second.value;                        for ( list<string>::const_iterator k = values.begin();                  k != values.end();                  ++k                )            {                cout << *k;            }        }        cout << '.' << endl;    }        cout << "-------------------------" << endl;    string  str("a foo\nb\n");        ParsePair   strParser;        if ( strParser.parse(ParsePair::CFG_STRING, str) != SUCCESS )    {        return ( !SUCCESS );    }        const NameValueMap &  str_opts = strParser.pairs();        for (   NameValueMap::const_iterator   j = str_opts.begin();            j != str_opts.end();            ++j        )    {        cout << "name: " << j->first;                if ( j->second.type != NO_VALUE )        {            cout << " value: ";                        const list<string> & values = j->second.value;                        for ( list<string>::const_iterator k = values.begin();                  k != values.end();                  ++k                )            {                cout << *k;            }        }        cout << '.' << endl;    }    return ( SUCCESS );}int main(int argc, char ** argv, char ** arge){    return ( Application::main(argc, argv, arge) );}ReturnCode TestApplication::run(){    return ( SUCCESS );}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -