similar to: Use C++11 Regular Expressions

Displaying 20 results from an estimated 30000 matches similar to: "Use C++11 Regular Expressions"

2009 Jun 09
0
[LLVMdev] Regular Expressions
> On Tuesday 09 June 2009 04:35, Török Edwin wrote: > > On 2009-06-09 12:27, Howard Su wrote: > > > This change break the MSVC build since no regex by default in Windows > > > MSVC platform. > > > > Perhaps we should add a regex implementation to lib/System? > > That's potentially a lot of work. I started looking at it and it would > involve
2009 Jun 09
6
[LLVMdev] Regular Expressions
On Tuesday 09 June 2009 04:35, Török Edwin wrote: > On 2009-06-09 12:27, Howard Su wrote: > > This change break the MSVC build since no regex by default in Windows > > MSVC platform. > > Perhaps we should add a regex implementation to lib/System? That's potentially a lot of work. I started looking at it and it would involve hiding the OpenBSD library under some other
2009 Jun 09
0
[LLVMdev] Regular Expressions
On Tue, Jun 9, 2009 at 12:00 PM, David Greene<dag at cray.com> wrote: > On Tuesday 09 June 2009 04:35, Török Edwin wrote: >> On 2009-06-09 12:27, Howard Su wrote: >> > This change break the MSVC build since no regex by default in Windows >> > MSVC platform. >> >> Perhaps we should add a regex implementation to lib/System? > > That's
2009 Jun 11
1
[LLVMdev] PEG parsers? (was Re: Regular Expressions)
Hello everybody, I don't quite understand how the proposed regex library works but I know that PEG parser generators use a super-set of regex functionality to define their parsers. There's also a nice one on Google code called YARDparser that uses templates based on PEGs to generate efficient recursive-decent parsers. Furthermore, my partner and I am working on an interpreter for PEG
2008 Dec 02
1
Question to regular expressions
Hi there, I know, this question is not directly an R-help question but probably someone can give me a hint how to deal with the following problem. I have a vector with file/folder names and want to filter for all entries which have 6 numbers in a row and nothing else. folders <- c("folder1", "f2", "F234562", "12345678", "234567",
2016 Oct 02
3
Using C++14 code in LLVM
On Sat, Oct 1, 2016 at 11:46 PM Joerg Sonnenberger via llvm-dev < llvm-dev at lists.llvm.org> wrote: > On Sun, Oct 02, 2016 at 05:33:40AM +0000, Zachary Turner via llvm-dev > wrote: > > While GCC doesn't claim to "fully" support C++14 until 5.2 (which is only > > about 1 year old), you can get all of the above features with GCC 4.9 > > I do care quite a
2008 Nov 08
3
Parsing regular expressions differently - feature request
Hi there, I rejoiced when I realized that you can use Perl regex from within R. However, as the FAQ states "Some functions, particularly those involving regular expression matching, themselves use metacharacters, which may need to be escaped by the backslash mechanism. In those cases you may need a quadruple backslash to represent a single literal one. " I was wondering if that is
2016 Oct 02
15
Using C++14 code in LLVM
A thread was started over the summer to discuss the timeline for bumping LLVM up to Visual Studio 2015 to enable the use of various new language features. Currently the ETA for this is sometime in mid-October, so within 2-3 weeks. With this happening imminently, I thought it would be worth tossing this out there and seeing what people think. With VS on 2015, the major lagging compiler is going
2009 Jun 11
0
[LLVMdev] Regular Expressions
On Jun 9, 2009, at 12:39 PM, David Greene wrote: > On Tuesday 09 June 2009 14:34, Dan Gohman wrote: >> Can you describe what problem you're trying to solve here? Does it >> really need Regular Expressions? > > Yes. I want TableGen to be able to infer lots of stuff > programmatically. > This helps tremendously when specifying things like, oh, AVX. :) I
2015 Feb 13
2
[LLVMdev] SIGILL in regex::assign()
Hi, I have this simple program: #include <regex> int main() { std::regex re; re.assign(std::regex("foo")); // SIGILL return 0; } It runs smoothly if compiled with g++ but raises "illegal instruction" when compiled with clang++: g++ -std=c++11 -O0 -g -o test-g++ test.cpp clang++ -std=c++11 -O0 -g -o test-clang++ test.cpp ptomulik at barakus:$ ./test-g++ ptomulik
2004 Feb 27
1
Regular expressions & large strings (PR#6617)
A possible regex bug when working with large strings. The following code snippet t5 <- paste( c( "# === TEST", rep(' ', 2452294) ), collapse='') str( sub("^.*TEST", "xyz", t5) ) str( sub("^.*TEST", "xyz", substr(t5,0,200)) ) doesn't behave right; on one machine, the second and third lines print different results [the
2009 Aug 25
0
[LLVMdev] Regular Expression lib support
On 2009-08-24 20:14, Chris Lattner wrote: > On Aug 23, 2009, at 11:59 PM, Török Edwin wrote: >> If LLVM is going to have an integrated regex library I suggest using it >> regardless if the platform has one. >> The LLVM integrated regex library will provide consistent behaviour and >> execution time, the system one will not. > > Hi Edwin, > > Can you propose
2009 Aug 24
0
[LLVMdev] Regular Expression lib support
On Sun, Aug 23, 2009 at 10:20 PM, Chris Lattner<clattner at apple.com> wrote: > On Aug 23, 2009, at 9:11 PM, OvermindDL1 wrote: >>> >>> Again, forget boost regex. :) >> >> What about std::regex? > > No, we have to build with c++'98 compilers. I think you're missing the > point here. We care about code size in llvm, and the best code size
2009 Aug 25
0
[LLVMdev] Regular Expression lib support
On 2009-08-25 21:18, Daniel Dunbar wrote: > Woot! Thanks a bunch Edwin! > > Some comments on the patch: > -- > I'm not sure if it makes sense to import the man pages, if we only > expose Regex.h. > I'd like to keep re_format.7, it describes the format of the regex as accepted by this implementation. I'll remove regex.3 since its not exposed. > >>
2009 Aug 24
1
[LLVMdev] Regular Expression lib support
On Aug 23, 2009, at 9:50 PM, OvermindDL1 wrote: > On Sun, Aug 23, 2009 at 10:20 PM, Chris Lattner<clattner at apple.com> > wrote: >> On Aug 23, 2009, at 9:11 PM, OvermindDL1 wrote: >>>> >>>> Again, forget boost regex. :) >>> >>> What about std::regex? >> >> No, we have to build with c++'98 compilers. I think you're
2009 Jun 11
2
[LLVMdev] Regular Expressions
On Thursday 11 June 2009 12:28, Chris Lattner wrote: > On Jun 9, 2009, at 12:39 PM, David Greene wrote: > > On Tuesday 09 June 2009 14:34, Dan Gohman wrote: > >> Can you describe what problem you're trying to solve here? Does it > >> really need Regular Expressions? > > > > Yes. I want TableGen to be able to infer lots of stuff > >
2009 Aug 25
6
[LLVMdev] Regular Expression lib support
Woot! Thanks a bunch Edwin! Some comments on the patch: -- I'm not sure if it makes sense to import the man pages, if we only expose Regex.h. > diff --git a/include/llvm/Support/Regex.h b/include/llvm/Support/Regex.h > new file mode 100644 > index 0000000..314bff4 > --- /dev/null > +++ b/include/llvm/Support/Regex.h > @@ -0,0 +1,49 @@ > +//===-- Regex.h - Regular
2009 Aug 27
0
[LLVMdev] Regular Expression lib support
On 2009-08-27 09:06, Daniel Dunbar wrote: > 2009/8/25 Török Edwin <edwintorok at gmail.com>: > >> On 2009-08-25 21:18, Daniel Dunbar wrote: >> >>> Woot! Thanks a bunch Edwin! >>> >>> Some comments on the patch: >>> -- >>> I'm not sure if it makes sense to import the man pages, if we only >>> expose Regex.h.
2009 Aug 27
2
[LLVMdev] Regular Expression lib support
2009/8/25 Török Edwin <edwintorok at gmail.com>: > On 2009-08-25 21:18, Daniel Dunbar wrote: >> Woot! Thanks a bunch Edwin! >> >> Some comments on the patch: >> -- >> I'm not sure if it makes sense to import the man pages, if we only >> expose Regex.h. >> > > I'd like to keep re_format.7, it describes the format of the regex as >
2009 Aug 24
0
[LLVMdev] Regular Expression lib support
Hello LLVM Devs, I thought I'd weigh in on some of these non-backtracking linear time RegEx algorithms. If they're anything like the PackRat parsing algorithms they take at least 4x the amount of memory in terms of storage as the string length itself by not backtracking. That should be fine for small RegExes but it wouldn't do so well for more elaborate and long expressions. If