1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867
|
/******************************************************************************
*
* Project: OpenGIS Simple Features Reference Implementation
* Purpose: The OGR_SRSNode class.
* Author: Frank Warmerdam, warmerdam@pobox.com
*
******************************************************************************
* Copyright (c) 1999, Les Technologies SoftMap Inc.
* Copyright (c) 2010-2013, Even Rouault <even dot rouault at spatialys.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
****************************************************************************/
#include "cpl_port.h"
#include "ogr_spatialref.h"
#include <cctype>
#include <cstddef>
#include <cstring>
#include "ogr_core.h"
#include "ogr_p.h"
#include "cpl_conv.h"
#include "cpl_error.h"
#include "cpl_string.h"
/************************************************************************/
/* OGR_SRSNode() */
/************************************************************************/
/**
* Constructor.
*
* @param pszValueIn this optional parameter can be used to initialize
* the value of the node upon creation. If omitted the node will be created
* with a value of "". Newly created OGR_SRSNodes have no children.
*/
OGR_SRSNode::OGR_SRSNode(const char *pszValueIn)
: pszValue(CPLStrdup(pszValueIn)), papoChildNodes(nullptr),
poParent(nullptr), nChildren(0)
{
}
/************************************************************************/
/* ~OGR_SRSNode() */
/************************************************************************/
OGR_SRSNode::~OGR_SRSNode()
{
CPLFree(pszValue);
ClearChildren();
}
/************************************************************************/
/* ~Listener() */
/************************************************************************/
OGR_SRSNode::Listener::~Listener() = default;
/************************************************************************/
/* RegisterListener() */
/************************************************************************/
void OGR_SRSNode::RegisterListener(const std::shared_ptr<Listener> &listener)
{
m_listener = listener;
}
/************************************************************************/
/* notifyChange() */
/************************************************************************/
void OGR_SRSNode::notifyChange()
{
auto locked = m_listener.lock();
if (locked)
{
locked->notifyChange(this);
}
}
/************************************************************************/
/* ClearChildren() */
/************************************************************************/
/** Clear children nodes
*/
void OGR_SRSNode::ClearChildren()
{
for (int i = 0; i < nChildren; i++)
{
delete papoChildNodes[i];
}
CPLFree(papoChildNodes);
papoChildNodes = nullptr;
nChildren = 0;
}
/************************************************************************/
/* GetChildCount() */
/************************************************************************/
/**
* \fn int OGR_SRSNode::GetChildCount() const;
*
* Get number of children nodes.
*
* @return 0 for leaf nodes, or the number of children nodes.
*/
/************************************************************************/
/* GetChild() */
/************************************************************************/
/**
* Fetch requested child.
*
* @param iChild the index of the child to fetch, from 0 to
* GetChildCount() - 1.
*
* @return a pointer to the child OGR_SRSNode, or NULL if there is no such
* child.
*/
OGR_SRSNode *OGR_SRSNode::GetChild(int iChild)
{
if (iChild < 0 || iChild >= nChildren)
return nullptr;
return papoChildNodes[iChild];
}
/**
* Fetch requested child.
*
* @param iChild the index of the child to fetch, from 0 to
* GetChildCount() - 1.
*
* @return a pointer to the child OGR_SRSNode, or NULL if there is no such
* child.
*/
const OGR_SRSNode *OGR_SRSNode::GetChild(int iChild) const
{
if (iChild < 0 || iChild >= nChildren)
return nullptr;
return papoChildNodes[iChild];
}
/************************************************************************/
/* GetNode() */
/************************************************************************/
/**
* Find named node in tree.
*
* This method does a pre-order traversal of the node tree searching for
* a node with this exact value (case insensitive), and returns it. Leaf
* nodes are not considered, under the assumption that they are just
* attribute value nodes.
*
* If a node appears more than once in the tree (such as UNIT for instance),
* the first encountered will be returned. Use GetNode() on a subtree to be
* more specific.
*
* @param pszName the name of the node to search for.
*
* @return a pointer to the node found, or NULL if none.
*/
OGR_SRSNode *OGR_SRSNode::GetNode(const char *pszName)
{
if (nChildren > 0 && EQUAL(pszName, pszValue))
return this;
/* -------------------------------------------------------------------- */
/* First we check the immediate children so we will get an */
/* immediate child in preference to a subchild. */
/* -------------------------------------------------------------------- */
for (int i = 0; i < nChildren; i++)
{
if (EQUAL(papoChildNodes[i]->pszValue, pszName) &&
papoChildNodes[i]->nChildren > 0)
return papoChildNodes[i];
}
/* -------------------------------------------------------------------- */
/* Then get each child to check their children. */
/* -------------------------------------------------------------------- */
for (int i = 0; i < nChildren; i++)
{
OGR_SRSNode *poNode = papoChildNodes[i]->GetNode(pszName);
if (poNode != nullptr)
return poNode;
}
return nullptr;
}
/**
* Find named node in tree.
*
* This method does a pre-order traversal of the node tree searching for
* a node with this exact value (case insensitive), and returns it. Leaf
* nodes are not considered, under the assumption that they are just
* attribute value nodes.
*
* If a node appears more than once in the tree (such as UNIT for instance),
* the first encountered will be returned. Use GetNode() on a subtree to be
* more specific.
*
* @param pszName the name of the node to search for.
*
* @return a pointer to the node found, or NULL if none.
*/
const OGR_SRSNode *OGR_SRSNode::GetNode(const char *pszName) const
{
return const_cast<OGR_SRSNode *>(this)->GetNode(pszName);
}
/************************************************************************/
/* AddChild() */
/************************************************************************/
/**
* Add passed node as a child of target node.
*
* Note that ownership of the passed node is assumed by the node on which
* the method is invoked ... use the Clone() method if the original is to
* be preserved. New children are always added at the end of the list.
*
* @param poNew the node to add as a child.
*/
void OGR_SRSNode::AddChild(OGR_SRSNode *poNew)
{
InsertChild(poNew, nChildren);
}
/************************************************************************/
/* InsertChild() */
/************************************************************************/
/**
* Insert the passed node as a child of target node, at the indicated
* position.
*
* Note that ownership of the passed node is assumed by the node on which
* the method is invoked ... use the Clone() method if the original is to
* be preserved. All existing children at location iChild and beyond are
* push down one space to make space for the new child.
*
* @param poNew the node to add as a child.
* @param iChild position to insert, use 0 to insert at the beginning.
*/
void OGR_SRSNode::InsertChild(OGR_SRSNode *poNew, int iChild)
{
if (iChild > nChildren)
iChild = nChildren;
nChildren++;
papoChildNodes = static_cast<OGR_SRSNode **>(
CPLRealloc(papoChildNodes, sizeof(void *) * nChildren));
memmove(papoChildNodes + iChild + 1, papoChildNodes + iChild,
sizeof(void *) * (nChildren - iChild - 1));
papoChildNodes[iChild] = poNew;
poNew->poParent = this;
poNew->m_listener = m_listener;
notifyChange();
}
/************************************************************************/
/* DestroyChild() */
/************************************************************************/
/**
* Remove a child node, and it's subtree.
*
* Note that removing a child node will result in children after it
* being renumbered down one.
*
* @param iChild the index of the child.
*/
void OGR_SRSNode::DestroyChild(int iChild)
{
if (iChild < 0 || iChild >= nChildren)
return;
delete papoChildNodes[iChild];
while (iChild < nChildren - 1)
{
papoChildNodes[iChild] = papoChildNodes[iChild + 1];
iChild++;
}
nChildren--;
notifyChange();
}
/************************************************************************/
/* FindChild() */
/************************************************************************/
/**
* Find the index of the child matching the given string.
*
* Note that the node value must match pszValue with the exception of
* case. The comparison is case insensitive.
*
* @param pszValueIn the node value being searched for.
*
* @return the child index, or -1 on failure.
*/
int OGR_SRSNode::FindChild(const char *pszValueIn) const
{
for (int i = 0; i < nChildren; i++)
{
if (EQUAL(papoChildNodes[i]->pszValue, pszValueIn))
return i;
}
return -1;
}
/************************************************************************/
/* GetValue() */
/************************************************************************/
/**
* \fn const char *OGR_SRSNode::GetValue() const;
*
* Fetch value string for this node.
*
* @return A non-NULL string is always returned. The returned pointer is to
* the internal value of this node, and should not be modified, or freed.
*/
/************************************************************************/
/* SetValue() */
/************************************************************************/
/**
* Set the node value.
*
* @param pszNewValue the new value to assign to this node. The passed
* string is duplicated and remains the responsibility of the caller.
*/
void OGR_SRSNode::SetValue(const char *pszNewValue)
{
CPLFree(pszValue);
pszValue = CPLStrdup(pszNewValue);
notifyChange();
}
/************************************************************************/
/* Clone() */
/************************************************************************/
/**
* Make a duplicate of this node, and it's children.
*
* @return a new node tree, which becomes the responsibility of the caller.
*/
OGR_SRSNode *OGR_SRSNode::Clone() const
{
OGR_SRSNode *poNew = new OGR_SRSNode(pszValue);
for (int i = 0; i < nChildren; i++)
{
poNew->AddChild(papoChildNodes[i]->Clone());
}
poNew->m_listener = m_listener;
return poNew;
}
/************************************************************************/
/* NeedsQuoting() */
/* */
/* Does this node need to be quoted when it is exported to Wkt? */
/************************************************************************/
int OGR_SRSNode::NeedsQuoting() const
{
// Non-terminals are never quoted.
if (GetChildCount() != 0)
return FALSE;
// As per bugzilla bug 201, the OGC spec says the authority code
// needs to be quoted even though it appears well behaved.
if (poParent != nullptr && EQUAL(poParent->GetValue(), "AUTHORITY"))
return TRUE;
// As per bugzilla bug 294, the OGC spec says the direction
// values for the AXIS keywords should *not* be quoted.
if (poParent != nullptr && EQUAL(poParent->GetValue(), "AXIS") &&
this != poParent->GetChild(0))
return FALSE;
if (poParent != nullptr && EQUAL(poParent->GetValue(), "CS") &&
this == poParent->GetChild(0))
return FALSE;
// Strings starting with e or E are not valid numeric values, so they
// need quoting, like in AXIS["E",EAST]
if ((pszValue[0] == 'e' || pszValue[0] == 'E'))
return TRUE;
// Non-numeric tokens are generally quoted while clean numeric values
// are generally not.
for (int i = 0; pszValue[i] != '\0'; i++)
{
if ((pszValue[i] < '0' || pszValue[i] > '9') && pszValue[i] != '.' &&
pszValue[i] != '-' && pszValue[i] != '+' && pszValue[i] != 'e' &&
pszValue[i] != 'E')
return TRUE;
}
return FALSE;
}
/************************************************************************/
/* exportToWkt() */
/************************************************************************/
/**
* Convert this tree of nodes into WKT format.
*
* Note that the returned WKT string should be freed with
* CPLFree() when no longer needed. It is the responsibility of the caller.
*
* @param ppszResult the resulting string is returned in this pointer.
*
* @return currently OGRERR_NONE is always returned, but the future it
* is possible error conditions will develop.
*/
OGRErr OGR_SRSNode::exportToWkt(char **ppszResult) const
{
/* -------------------------------------------------------------------- */
/* Build a list of the WKT format for the children. */
/* -------------------------------------------------------------------- */
char **papszChildrenWkt =
static_cast<char **>(CPLCalloc(sizeof(char *), nChildren + 1));
size_t nLength = strlen(pszValue) + 4;
for (int i = 0; i < nChildren; i++)
{
papoChildNodes[i]->exportToWkt(papszChildrenWkt + i);
nLength += strlen(papszChildrenWkt[i]) + 1;
}
/* -------------------------------------------------------------------- */
/* Allocate the result string. */
/* -------------------------------------------------------------------- */
*ppszResult = static_cast<char *>(CPLMalloc(nLength));
*ppszResult[0] = '\0';
/* -------------------------------------------------------------------- */
/* Capture this nodes value. We put it in double quotes if */
/* this is a leaf node, otherwise we assume it is a well formed */
/* node name. */
/* -------------------------------------------------------------------- */
if (NeedsQuoting())
{
strcat(*ppszResult, "\"");
strcat(*ppszResult, pszValue); // Should we do quoting?
strcat(*ppszResult, "\"");
}
else
strcat(*ppszResult, pszValue);
/* -------------------------------------------------------------------- */
/* Add the children strings with appropriate brackets and commas. */
/* -------------------------------------------------------------------- */
if (nChildren > 0)
strcat(*ppszResult, "[");
for (int i = 0; i < nChildren; i++)
{
strcat(*ppszResult, papszChildrenWkt[i]);
if (i == nChildren - 1)
strcat(*ppszResult, "]");
else
strcat(*ppszResult, ",");
}
CSLDestroy(papszChildrenWkt);
return OGRERR_NONE;
}
/************************************************************************/
/* exportToPrettyWkt() */
/************************************************************************/
/**
* Convert this tree of nodes into pretty WKT format.
*
* Note that the returned WKT string should be freed with
* CPLFree() when no longer needed. It is the responsibility of the caller.
*
* @param ppszResult the resulting string is returned in this pointer.
*
* @param nDepth depth of the node
*
* @return currently OGRERR_NONE is always returned, but the future it
* is possible error conditions will develop.
*/
OGRErr OGR_SRSNode::exportToPrettyWkt(char **ppszResult, int nDepth) const
{
/* -------------------------------------------------------------------- */
/* Build a list of the WKT format for the children. */
/* -------------------------------------------------------------------- */
char **papszChildrenWkt =
static_cast<char **>(CPLCalloc(sizeof(char *), nChildren + 1));
size_t nLength = strlen(pszValue) + 4;
for (int i = 0; i < nChildren; i++)
{
papoChildNodes[i]->exportToPrettyWkt(papszChildrenWkt + i, nDepth + 1);
nLength += strlen(papszChildrenWkt[i]) + 2 + nDepth * 4;
}
/* -------------------------------------------------------------------- */
/* Allocate the result string. */
/* -------------------------------------------------------------------- */
*ppszResult = static_cast<char *>(CPLMalloc(nLength));
*ppszResult[0] = '\0';
/* -------------------------------------------------------------------- */
/* Capture this nodes value. We put it in double quotes if */
/* this is a leaf node, otherwise we assume it is a well formed */
/* node name. */
/* -------------------------------------------------------------------- */
if (NeedsQuoting())
{
strcat(*ppszResult, "\"");
strcat(*ppszResult, pszValue); // Should we do quoting?
strcat(*ppszResult, "\"");
}
else
{
strcat(*ppszResult, pszValue);
}
/* -------------------------------------------------------------------- */
/* Add the children strings with appropriate brackets and commas. */
/* -------------------------------------------------------------------- */
if (nChildren > 0)
strcat(*ppszResult, "[");
for (int i = 0; i < nChildren; i++)
{
if (papoChildNodes[i]->GetChildCount() > 0)
{
strcat(*ppszResult, "\n");
for (int j = 0; j < 4 * nDepth; j++)
strcat(*ppszResult, " ");
}
strcat(*ppszResult, papszChildrenWkt[i]);
if (i < nChildren - 1)
strcat(*ppszResult, ",");
}
if (nChildren > 0)
{
if ((*ppszResult)[strlen(*ppszResult) - 1] == ',')
(*ppszResult)[strlen(*ppszResult) - 1] = '\0';
strcat(*ppszResult, "]");
}
CSLDestroy(papszChildrenWkt);
return OGRERR_NONE;
}
/************************************************************************/
/* importFromWkt() */
/************************************************************************/
/**
* Import from WKT string.
*
* This method will wipe the existing children and value of this node, and
* reassign them based on the contents of the passed WKT string. Only as
* much of the input string as needed to construct this node, and its
* children is consumed from the input string, and the input string pointer
* is then updated to point to the remaining (unused) input.
*
* @param ppszInput Pointer to pointer to input. The pointer is updated to
* point to remaining unused input text.
*
* @return OGRERR_NONE if import succeeds, or OGRERR_CORRUPT_DATA if it
* fails for any reason.
* @deprecated GDAL 2.3. Use importFromWkt(const char**) instead.
*/
OGRErr OGR_SRSNode::importFromWkt(char **ppszInput)
{
int nNodes = 0;
return importFromWkt(const_cast<const char **>(ppszInput), 0, &nNodes);
}
/**
* Import from WKT string.
*
* This method will wipe the existing children and value of this node, and
* reassign them based on the contents of the passed WKT string. Only as
* much of the input string as needed to construct this node, and its
* children is consumed from the input string, and the input string pointer
* is then updated to point to the remaining (unused) input.
*
* @param ppszInput Pointer to pointer to input. The pointer is updated to
* point to remaining unused input text.
*
* @return OGRERR_NONE if import succeeds, or OGRERR_CORRUPT_DATA if it
* fails for any reason.
*
* @since GDAL 2.3
*/
OGRErr OGR_SRSNode::importFromWkt(const char **ppszInput)
{
int nNodes = 0;
return importFromWkt(ppszInput, 0, &nNodes);
}
OGRErr OGR_SRSNode::importFromWkt(const char **ppszInput, int nRecLevel,
int *pnNodes)
{
// Sanity checks.
if (nRecLevel == 10)
{
return OGRERR_CORRUPT_DATA;
}
if (*pnNodes == 1000)
{
return OGRERR_CORRUPT_DATA;
}
const char *pszInput = *ppszInput;
bool bInQuotedString = false;
/* -------------------------------------------------------------------- */
/* Clear any existing children of this node. */
/* -------------------------------------------------------------------- */
ClearChildren();
/* -------------------------------------------------------------------- */
/* Read the ``value'' for this node. */
/* -------------------------------------------------------------------- */
{
char szToken[512]; // do not initialize whole buffer. significant
// overhead
size_t nTokenLen = 0;
szToken[0] = '\0';
while (*pszInput != '\0' && nTokenLen + 1 < sizeof(szToken))
{
if (*pszInput == '"')
{
bInQuotedString = !bInQuotedString;
}
else if (!bInQuotedString &&
(*pszInput == '[' || *pszInput == ']' ||
*pszInput == ',' || *pszInput == '(' || *pszInput == ')'))
{
break;
}
else if (!bInQuotedString &&
(*pszInput == ' ' || *pszInput == '\t' ||
*pszInput == 10 || *pszInput == 13))
{
// Skip over whitespace.
}
else
{
szToken[nTokenLen++] = *pszInput;
}
pszInput++;
}
if (*pszInput == '\0' || nTokenLen == sizeof(szToken) - 1)
return OGRERR_CORRUPT_DATA;
szToken[nTokenLen++] = '\0';
SetValue(szToken);
}
/* -------------------------------------------------------------------- */
/* Read children, if we have a sublist. */
/* -------------------------------------------------------------------- */
if (*pszInput == '[' || *pszInput == '(')
{
do
{
pszInput++; // Skip bracket or comma.
OGR_SRSNode *poNewChild = new OGR_SRSNode();
poNewChild->m_listener = m_listener;
(*pnNodes)++;
const OGRErr eErr =
poNewChild->importFromWkt(&pszInput, nRecLevel + 1, pnNodes);
if (eErr != OGRERR_NONE)
{
delete poNewChild;
return eErr;
}
AddChild(poNewChild);
// Swallow whitespace.
while (isspace(*pszInput))
pszInput++;
} while (*pszInput == ',');
if (*pszInput != ')' && *pszInput != ']')
return OGRERR_CORRUPT_DATA;
pszInput++;
}
*ppszInput = pszInput;
return OGRERR_NONE;
}
/************************************************************************/
/* MakeValueSafe() */
/************************************************************************/
/**
* Massage value string, stripping special characters so it will be a
* database safe string.
*
* The operation is also applies to all subnodes of the current node.
*/
void OGR_SRSNode::MakeValueSafe()
{
/* -------------------------------------------------------------------- */
/* First process subnodes. */
/* -------------------------------------------------------------------- */
for (int iChild = 0; iChild < GetChildCount(); iChild++)
{
GetChild(iChild)->MakeValueSafe();
}
/* -------------------------------------------------------------------- */
/* Skip numeric nodes. */
/* -------------------------------------------------------------------- */
if ((pszValue[0] >= '0' && pszValue[0] <= '9') || pszValue[0] != '.')
return;
/* -------------------------------------------------------------------- */
/* Translate non-alphanumeric values to underscores. */
/* -------------------------------------------------------------------- */
for (int i = 0; pszValue[i] != '\0'; i++)
{
if (!(pszValue[i] >= 'A' && pszValue[i] <= 'Z') &&
!(pszValue[i] >= 'a' && pszValue[i] <= 'z') &&
!(pszValue[i] >= '0' && pszValue[i] <= '9'))
{
pszValue[i] = '_';
}
}
/* -------------------------------------------------------------------- */
/* Remove repeated and trailing underscores. */
/* -------------------------------------------------------------------- */
int j = 0;
for (int i = 1; pszValue[i] != '\0'; i++)
{
if (pszValue[j] == '_' && pszValue[i] == '_')
continue;
pszValue[++j] = pszValue[i];
}
if (pszValue[j] == '_')
pszValue[j] = '\0';
else
pszValue[j + 1] = '\0';
}
/************************************************************************/
/* StripNodes() */
/************************************************************************/
/**
* Strip child nodes matching name.
*
* Removes any descendant nodes of this node that match the given name.
* Of course children of removed nodes are also discarded.
*
* @param pszName the name for nodes that should be removed.
*/
void OGR_SRSNode::StripNodes(const char *pszName)
{
/* -------------------------------------------------------------------- */
/* Strip any children matching this name. */
/* -------------------------------------------------------------------- */
while (FindChild(pszName) >= 0)
DestroyChild(FindChild(pszName));
/* -------------------------------------------------------------------- */
/* Recurse */
/* -------------------------------------------------------------------- */
for (int i = 0; i < GetChildCount(); i++)
GetChild(i)->StripNodes(pszName);
}
|