You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
76 lines
3.0 KiB
C
76 lines
3.0 KiB
C
2 years ago
|
// Copyright 2008, Google 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. Neither the name of Google Inc. nor the names of its contributors may be
|
||
|
|
// used to endorse or promote products derived from this software without
|
||
|
|
// specific prior written permission.
|
||
|
|
//
|
||
|
|
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
|
||
|
|
// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
||
|
|
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
|
||
|
|
// EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, 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 file contains the definition of the SchemaParserObserver class.
|
||
|
|
|
||
|
|
#ifndef KML_ENGINE_SCHEMA_PARSER_OBSERVER_H__
|
||
|
|
#define KML_ENGINE_SCHEMA_PARSER_OBSERVER_H__
|
||
|
|
|
||
|
|
#include <map>
|
||
|
|
#include <string>
|
||
|
|
#include "kml/dom.h"
|
||
|
|
#include "kml/dom/parser_observer.h"
|
||
|
|
#include "kml/engine/engine_types.h"
|
||
|
|
|
||
|
|
namespace kmlengine {
|
||
|
|
|
||
|
|
// The SchemaParserObserver is a kmldom::ParserObserver which gathers all
|
||
|
|
// all name'ed <Schema>'s into a SchemaNameMap. This implementation treats
|
||
|
|
// <Schema> as global in scope and as such multiple <Schema>'s in the same file
|
||
|
|
// with the same name= follow a "last one wins" pattern.
|
||
|
|
// TODO: decide if <Schema> is scoped by <Document>
|
||
|
|
class SchemaParserObserver : public kmldom::ParserObserver {
|
||
|
|
public:
|
||
|
|
SchemaParserObserver(SchemaNameMap* schema_name_map)
|
||
|
|
: schema_name_map_(schema_name_map) {}
|
||
|
|
|
||
|
|
virtual ~SchemaParserObserver() {}
|
||
|
|
|
||
|
|
// ParserObserver::AddChild()
|
||
|
|
// Old-style <Schema> looked like this:
|
||
|
|
// <Schema parent="Placemark" name="S_park_boundaries_S">
|
||
|
|
// ...
|
||
|
|
// </Schema>
|
||
|
|
virtual bool AddChild(const kmldom::ElementPtr& parent,
|
||
|
|
const kmldom::ElementPtr& child) {
|
||
|
|
if (kmldom::DocumentPtr document = kmldom::AsDocument(parent)) {
|
||
|
|
if (kmldom::SchemaPtr schema = kmldom::AsSchema(child)) {
|
||
|
|
if (schema->has_name()) {
|
||
|
|
// Last one wins on name collisions.
|
||
|
|
(*schema_name_map_)[schema->get_name()] = schema;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return true; // Keep parsing.
|
||
|
|
}
|
||
|
|
|
||
|
|
private:
|
||
|
|
SchemaNameMap* schema_name_map_;
|
||
|
|
};
|
||
|
|
|
||
|
|
} // end namespace kmlengine
|
||
|
|
|
||
|
|
#endif // KML_ENGINE_SCHEMA_PARSER_OBSERVER_H__
|