search for: laurikari

...by this old Stack Overflow question https://stackoverflow.com/questions/19765610/when-does-locale-affect-rs-regular-expressions I was wondering why this is TRUE: Sys.setlocale("LC_ALL", "et_EE") grepl("[A-Z]", "T") TRE's documentation at <https://laurikari.net/tre/documentation/regex-syntax/> says that a range "is shorthand for the full range of characters between those two [endpoints] (inclusive) in the collating sequence". Yet, T is *not* between A and Z in the Estonian collating sequence: sort(LETTERS) [1] "A" "...

...://stackoverflow.com/questions/19765610/when-does-locale-affect-rs-regular-expressions > > > I was wondering why this is TRUE: > > Sys.setlocale("LC_ALL", "et_EE") > grepl("[A-Z]", "T") > > TRE's documentation at > <https://laurikari.net/tre/documentation/regex-syntax/> says that a > range "is shorthand for the full range of characters between those two > [endpoints] (inclusive) in the collating sequence". > > Yet, T is *not* between A and Z in the Estonian collating sequence: > > ?sort(LETTERS)...

...procedures so I don't know how involved that is. > > The advantage to the second approach is that we keep the POSIX interfaces > in the rest of the LLVM code, we don't have to design another set of > interfaces and we just use the OpenBSD library when we have to. <http://www.laurikari.net/tre/> looks somewhat promising as a POSIX-compatible regex library with a suitable license. deep

...ternally). PCRE could easily blow the stack in some cases, sadly. FWIW: Most people are much more familiar with perl tyle regexps, than they are familiar with posix style. That said, if you really have the urge to have a BSD'd implementation of regexec, at least choose something like http://laurikari.net/tre/ which is a linear time in size of string. I've never performance timed it myself, but Russ Cox says it is "efficient" ;) The Google impl was, at least if i remember right, made up of 3 engines: 1 that was a special case matcher that handled plain old anchored strings super...

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

Hello everybody, this might be a trivial question, but I have been unable to find this using Google. I am trying to replace double backslashes with single backslashes using gsub. There seems to be some unexpected behaviour with regards to the replacement string "\\". The following example uses the string C:\\ which should be converted to C:\ . > gsub("\\\\",

...een different versions of the same > platform (IE different glibc versions, etc) I am more concerned about bugginess, but I doubt that affects simple regexes. > That said, if you really have the urge to have a BSD'd implementation > of regexec, at least choose something like http://laurikari.net/tre/ > which is a linear time in size of string. Nice, we need something for windows. > The Google impl was, at least if i remember right, made up of 3 > engines: 1 that was a special case matcher that handled plain old > anchored strings super fast, 1 that dealt with regular expr...

We would like to have access to some kind of regular expression library inside LLVM. For example, we need this to extend the FileCheck test case checking tool to support regular expressions. There are three obvious options: 1. Roll our own library. Multiple unnamed individuals may even already have implementations lying around! :) 2. Use POSIX regcomp facilities. This implies importing some

...ses for every possible aspect of it, thoroughly tested and well proven. On Sun, Aug 23, 2009 at 10:28 PM, Chris Lattner<clattner at apple.com> wrote: >> That said, if you really have the urge to have a BSD'd implementation >> of regexec, at least choose something like http://laurikari.net/tre/ >> which is a linear time in size of string. > > Nice, we need something for windows. This is my whole push, if just one thing is used for all platforms, then you do not have to worry about something working correctly on one platform, but being slightly different on another an...

....ac.at:epub-wu-01_8a1,1,academic src/library/base/man/sprintf.Rd,https://developer.r-project.org/Portability.html,3,private src/library/base/man/regex.Rd,http://www.pcre.org,2,private src/library/base/man/regex.Rd,http://www.pcre.org/original/doc/html/,2,private src/library/base/man/regex.Rd,http://laurikari.net/tre/documentation/regex-syntax/,2,private src/library/base/man/regex.Rd,http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/V1_chap09.html,1,private src/library/base/man/regex.Rd,http://www.pcre.org/original/pcre.txt,1,private src/library/base/man/regex.Rd,http://perldoc.perl.org/perlre.ht...

...n in the appropriate mode (as other functions using connections directly already did). REGULAR EXPRESSIONS o A different regular expression engine is used for basic and extended regexps and is also for approximate matching. This is based on the TRE library of Ville Laurikari, a modifed copy of which is included in the R sources. This is often faster, especially in a MBCS locale. Some known differences are that it is less tolerant of invalid inputs in MBCS locales, and in its interpretation of undefined (extended) regexps such a...

...n in the appropriate mode (as other functions using connections directly already did). REGULAR EXPRESSIONS o A different regular expression engine is used for basic and extended regexps and is also for approximate matching. This is based on the TRE library of Ville Laurikari, a modifed copy of which is included in the R sources. This is often faster, especially in a MBCS locale. Some known differences are that it is less tolerant of invalid inputs in MBCS locales, and in its interpretation of undefined (extended) regexps such a...

...n in the appropriate mode (as other functions using connections directly already did). REGULAR EXPRESSIONS o A different regular expression engine is used for basic and extended regexps and is also for approximate matching. This is based on the TRE library of Ville Laurikari, a modifed copy of which is included in the R sources. This is often faster, especially in a MBCS locale. Some known differences are that it is less tolerant of invalid inputs in MBCS locales, and in its interpretation of undefined (extended) regexps such a...

...n in the appropriate mode (as other functions using connections directly already did). REGULAR EXPRESSIONS o A different regular expression engine is used for basic and extended regexps and is also for approximate matching. This is based on the TRE library of Ville Laurikari, a modifed copy of which is included in the R sources. This is often faster, especially in a MBCS locale. Some known differences are that it is less tolerant of invalid inputs in MBCS locales, and in its interpretation of undefined (extended) regexps such a...

>>>>> Thomas Levine <_ at thomaslevine.com> >>>>> on Fri, 28 Jul 2017 18:53:16 +0000 writes: > The attached patch corrects a dead link in the treering > documentation. The URL in the manual [1] refers to a > personal home page belonging to Christine Hallman (user > "hallman") on the website of the University of Arizona