Function string_split

framework/src/util/LDAPExpr.cpp:63–106

* @brief split a delimited string into a vector of values * * String split from: https://stackoverflow.com/a/5506223/13030801 * This is the fasted string split algorithm that we could find. * * @param input a delimited string to split * @param delimiter_list a string_view of characters representing delimiters * * @return a std

         * @return a std::vector<std::string> of the delimited items from input
         */
        std::vector<std::string>
        string_split(std::string const& input, std::string_view delimiter_list)
        {
            std::vector<std::string> result;

            // Initialize a set of boolean flags indexed by ascii character value, one bit per
            // character. If the bit is 1, that character is a delimiter.
            std::bitset<255> delim;
            std::for_each(std::begin(delimiter_list), std::end(delimiter_list), [&delim](char c) { delim[c] = true; });

            std::string::const_iterator beg;
            bool in_token = false;
            // Loop through the input string and check each character for a delimiter. If a
            // delimiter is found, add the string processed so far to the result container.
            for (auto it = std::begin(input); it != std::end(input); std::advance(it, 1))
            {
                // If *it is a delimiter, the value marked by the delimiter is the string between
                // "beg" and "it"... save it off into the result container.
                if (delim[*it])
                {
                    if (in_token)
                    {
                        // Only store a token if we're actually parsing a token.
                        result.push_back(std::string(beg, it));
                        in_token = false;
                    }
                }
                else if (!in_token)
                {
                    // Found a non-delimiter character. If we're not currently processing a token,
                    // mark that we've found the beginning of a token so the next characters are
                    // part of the token.
                    beg = it;
                    in_token = true;
                }
            }
            // deal with the boundary condition... the last token in input.
            if (in_token)
            {
                result.push_back(std::string(beg, std::end(input)));
            }

            return result;
        }
#endif

        /**