nel/src/ligo/primitive_configuration.cpp

   1 // NeL - MMORPG Framework <http://dev.ryzom.com/projects/nel/>
   2 // Copyright (C) 2010  Winch Gate Property Limited
   3 //
   4 // This program is free software: you can redistribute it and/or modify
   5 // it under the terms of the GNU Affero General Public License as
   6 // published by the Free Software Foundation, either version 3 of the
   7 // License, or (at your option) any later version.
   8 //
   9 // This program is distributed in the hope that it will be useful,
  10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 // GNU Affero General Public License for more details.
  13 //
  14 // You should have received a copy of the GNU Affero General Public License
  15 // along with this program.  If not, see <http://www.gnu.org/licenses/>.
  16
  17 #include "stdligo.h"
  18 #include "nel/ligo/primitive_configuration.h"
  19 #include "nel/ligo/ligo_config.h"
  20 #include "nel/ligo/primitive.h"
  21 #include "nel/misc/i_xml.h"
  22
  23 using namespace std;
  24 using namespace NLMISC;
  25 using namespace NLLIGO;
  26
  27 extern bool ReadColor (CRGBA &color, xmlNodePtr node);
  28
  29 // ***************************************************************************
  30
  31 bool CPrimitiveConfigurations::read (xmlNodePtr configurationNode, const char *filename, const char *name, NLLIGO::CLigoConfig &config)
  32 {
  33         // The name
  34         Name = name;
  35
  36         // Read the color
  37         ReadColor (Color, configurationNode);
  38
  39         // Get the first matching pair
  40         MatchPairs.reserve (CIXml::countChildren (configurationNode, "MATCH_GROUP"));
  41         xmlNodePtr matchGroups = CIXml::getFirstChildNode (configurationNode, "MATCH_GROUP");
  42         if (matchGroups)
  43         {
  44                 do
  45                 {
  46                         // Add a pair
  47                         MatchPairs.push_back(CMatchGroup());
  48                         CMatchGroup &matchGroup = MatchPairs.back();
  49
  50                         // Get the first matching pair
  51                         matchGroup.Pairs.reserve (CIXml::countChildren (matchGroups, "MATCH"));
  52                         xmlNodePtr match = CIXml::getFirstChildNode (matchGroups, "MATCH");
  53                         if (match)
  54                         {
  55                                 do
  56                                 {
  57                                         // Add the match
  58                                         matchGroup.Pairs.resize (matchGroup.Pairs.size()+1);
  59                                         std::pair<std::string, std::string> &pair = matchGroup.Pairs.back();
  60
  61                                         // Get the match name
  62                                         std::string name;
  63                                         if (config.getPropertyString (name, filename, match, "NAME"))
  64                                         {
  65                                                 pair.first = name;
  66                                         }
  67                                         else
  68                                         {
  69                                                 config.syntaxError (filename, match, "Missing match name in configuration (%s)", name.c_str());
  70                                                 return false;
  71                                         }
  72
  73                                         // Get the match value
  74                                         if (config.getPropertyString (name, filename, match, "VALUE"))
  75                                         {
  76                                                 pair.second = name;
  77                                         }
  78
  79                                         match = CIXml::getNextChildNode (match, "MATCH");
  80                                 }
  81                                 while (match);
  82                         }
  83
  84                         matchGroups = CIXml::getNextChildNode (matchGroups, "MATCH_GROUP");
  85                 }
  86                 while (matchGroups);
  87         }
  88         return true;
  89 }
  90
  91 // ***************************************************************************
  92
  93 bool    CPrimitiveConfigurations::belong (const IPrimitive &primitive) const
  94 {
  95         // For each match group
  96         uint group;
  97         const uint numGroup = (uint)MatchPairs.size();
  98         for (group=0; group<numGroup; group++)
  99         {
 100                 const CMatchGroup &matchGroup = MatchPairs[group];
 101
 102                 // For each rules
 103                 uint rules;
 104                 const uint numRules = (uint)matchGroup.Pairs.size();
 105                 for (rules=0; rules<numRules; rules++)
 106                 {
 107                         const std::pair<std::string, std::string> &pairs = matchGroup.Pairs[rules];
 108                         string key = toLowerAscii(pairs.second);
 109
 110                         // Get the property
 111                         string value;
 112                         if (primitive.getPropertyByName (pairs.first.c_str(), value))
 113                         {
 114                                 if (toLowerAscii(value) == key)
 115                                         continue;
 116                         }
 117
 118                         // Get the property
 119                         const std::vector<string> *array = NULL;
 120                         if (primitive.getPropertyByName (pairs.first.c_str(), array) && array)
 121                         {
 122                                 uint i;
 123                                 for (i=0; i<array->size(); i++)
 124                                 {
 125                                         if (toLowerAscii((*array)[i]) == key)
 126                                                 break;
 127                                 }
 128                                 if (i!=array->size())
 129                                         continue;
 130                         }
 131
 132                         // Don't match
 133                         break;
 134                 }
 135
 136                 // Match ?
 137                 if (rules == numRules)
 138                         return true;
 139         }
 140         return false;
 141 }
 142
 143 // ***************************************************************************
 144