- if (!temp.find (base,0)) {
-
- if ((suffix = atoi (temp.substr(l,3))) != 0) {
- taken.insert (make_pair (suffix,true));
- }
- }
- }
- }
-
- /* Now search for an un-used suffix to add to "base". This
- will find "holes" in the numbering sequence when a location
- was deleted.
-
- This must start at 1, both for human-numbering reasons
- and also because the call to atoi() above would return
- zero if there is no recognizable numeric suffix, causing
- "base 0" not to be inserted into the "taken" map.
- */
-
- n = 1;
-
- while (n < UINT32_MAX) {
- if (taken.find (n) == taken.end()) {
- snprintf (buf, sizeof(buf), "%d", n);
- result += buf;
- return 1;
- }
- ++n;
- }
+ if (!temp.find (base,0)) {
+
+ if ((suffix = atoi (temp.substr(l,3))) != 0) {
+ taken.insert (make_pair (suffix,true));
+ }
+ }
+ }
+ }
+
+ /* Now search for an un-used suffix to add to "base". This
+ will find "holes" in the numbering sequence when a location
+ was deleted.
+
+ This must start at 1, both for human-numbering reasons
+ and also because the call to atoi() above would return
+ zero if there is no recognizable numeric suffix, causing
+ "base 0" not to be inserted into the "taken" map.
+ */
+
+ n = 1;
+
+ while (n < UINT32_MAX) {
+ if (taken.find (n) == taken.end()) {
+ snprintf (buf, sizeof(buf), "%d", n);
+ result += buf;
+ return 1;
+ }
+ ++n;
+ }