I am trying to find certain patterns inside a large mixed C/C++ source code. Based on such patterns I would like to make some changes in the code. I tried pygccxml as code parser , but it seems like it need all dependencies, headers and macros to parse. Is there a tool that can help ..
I build an application that should find the best matching images in two directories of image-pairs. The application builds on an ORB-descriptor-extractor and a GMS-matcher. I have a working version in Python and am now in the process of porting the code to C++. The C++-version works as expected with one exception: It doesn’t write ..
How to search for a sequence within ArrayFire. Is it possible to locate occurrence indices? Is it possible to match all occurrences at once? Is it possible to search for multiple sequences (multi-pattern) at once? Is it possible to set a value (ex: -1) as ? wildcard? if no, what’s the trick to do the ..
I have a function which takes a string(matcher) and a file as input arguments(content). The function returns all the strings from content that match with the matcher. Instead of using direct regex, matcher string can use variables that are predefined : symbol_only, number_only, one_more_variable. These variables are associated with certain regex patterns. Each variable can ..
First I should say here I am not asking about string matching algorithms like KMP or boyer-moore algorithms. My question is to find all distinct patterns in a string and algorithm should itself differentiate those patterns. When it comes to suffix tree it can find the longest common substring and other usual string matchings,but it ..