arpadboda commented on a change in pull request #937: URL: https://github.com/apache/nifi-minifi-cpp/pull/937#discussion_r534122907
########## File path: libminifi/include/utils/CollectionUtils.h ########## @@ -0,0 +1,40 @@ +/** + * Licensed to the Apache Software Foundation (ASF) under one or more + * contributor license agreements. See the NOTICE file distributed with + * this work for additional information regarding copyright ownership. + * The ASF licenses this file to You under the Apache License, Version 2.0 + * (the "License"); you may not use this file except in compliance with + * the License. You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + * See the License for the specific language governing permissions and + * limitations under the License. + */ + +#pragma once + +#include <set> +#include <string> +#include <algorithm> + +namespace org { +namespace apache { +namespace nifi { +namespace minifi { +namespace utils { + +bool haveCommonItem(const std::set<std::string>& a, const std::set<std::string>& b) { Review comment: This is specialised for set with no reason. In case this just requries two iterables with the same underlying type and you use find instead of count, this is going to work with vectors, lists, etc, while keeping the log(N) efficiency for sets. Not to mention unordered sets as well. ---------------------------------------------------------------- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: us...@infra.apache.org
