lbug 0.16.0

An in-process property graph database management system built for query speed and scalability
Documentation 
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

/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
 * Use of this file is governed by the BSD 3-clause license that
 * can be found in the LICENSE.txt file in the project root.
 */

#include "tree/ParseTree.h"
#include "Exceptions.h"

#include "support/Arrays.h"

using namespace antlrcpp;

std::string Arrays::listToString(const std::vector<std::string> &list, const std::string &separator)
{
  std::stringstream ss;
  bool firstEntry = true;

  ss << '[';
  for (const auto &entry : list) {
    ss << entry;
    if (firstEntry) {
      ss << separator;
      firstEntry = false;
    }
  }

  ss << ']';
  return ss.str();
}

template <>
std::string Arrays::toString(const std::vector<antlr4::tree::ParseTree*> &source) {
  std::string result = "[";
  bool firstEntry = true;
  for (auto *value : source) {
    result += value->toStringTree();
    if (firstEntry) {
      result += ", ";
      firstEntry = false;
    }
  }
  return result + "]";
}