Consider the following strings which would match:
HELLO WORLD HOW ARE YOU?
HELLO world HOW are YOU?
I am a SERIES OF WORDS that are capital
I am INVALID.
While these would not match:
Hello TV // (tv is not a word)
Come to my BBQ at my 1200 SQ.FT House.
The rule is very simple: No all capital words. (abbreviations are fine, words are not)
Currently I have:
^(?!.*\b[A-Z]{2,}\b).*$
this is the closest question but it is almost opposite of what I am trying to do.
I am not good with regex at all, I have tried various online tools and this is as close as I got. I believe the issue lies with the fact it should be something like \w or \W as I want words, not individual characters and not abbreviations like TV, BBQ, SQ.FT and so on, they have to be full on words as indicated above.
Regular Expressions on their own cannot do this. You would need a separate dictionary with a list of all words that you do not want to be matched, then rule them out afterwards.
Related
AFAIK, nbsp (non-breaking space) is this: . But tab (\t) is also a non-breaking space right? I mean it doesn't create a new line.
If everything above is correct, then how would you call a variable that can contain either or \t ? Something ugly like tabOrNbsp?
I am asking because currently in my code a variable called nbsp is used for that purpose, but the ambiguity makes me sick. Or is it correct as it is now?
P.S. This question is so dumb, but don't hate, now I see how dumb it was. In the end the commenters and the answerer really helped to sort things out!
I think you've misunderstood the term "non-breaking space".
Normally, although a space or tab character doesn't require a line break, it allows line-wrapping. So if a paragraph goes on long enough, it will eventually spread across multiple lines, even if you use lots of spaces and tabs.
A "non-breaking space" is a space that does not allow line-wrapping; if two words have a non-breaking space between them, then those two words will always end up on the same line, even if they're at the end of a line and you would otherwise expect line-wrapping between them. In Unicode, non-breaking space is coded as a specific character, U+00A0 NO-BREAK SPACE, and in HTML, you can use the entity reference to conveniently embed this character. This character is different from the normal space character , which in Unicode is coded as U+0020 SPACE.
If I've correctly understood the idea that you have in mind, the closest term is probably "linear white space" (LWS or LWSP), which means a sequence of space or tab characters (the idea being that these are whitespace characters "within a line", not forcing a line break).
I've been trying to create a RegExp that makes sure a sure has entered at least one word and at least one space. I tried to use this:
/\w+\s+/
But that makes sure that there is a word AFTER a space. I just want to make sure there is both in a string. They don't need to be in the order of the above RegExp.
How can I make the RegExp work, but without matching the order?
/(?=.*?\w)(?=.*?\s)/
?= means "look-ahead", and .* means "any number of characters"
So "find any number of characters then a \w", "find any number of characters and a \s"
Another thing to note about how this works, look-aheads are "non-matching", making it so that this can match in any order.
You have two things:
Is there a word character?
Is there a space?
Two things.
str.match(/\w/)
str.match(/\s/)
So why are you trying to do them as one step?
if( str.match(/\w/) && str.match(/\s/))
There are a lot of answers to my question. However, I do not want to simply pick the one that is upvoted. Please give a detailed explanation of why your regex works, and maybe why mine doesn't.
My answer provides the simplest solution. It is very clear to anyone reading it that we are checking "if it has a word character, and if it contains a space character". It is also very easy to expand on, such as if you want to add another check.
zyklus' answer (/(?=.*?\w)(?=.*?\s)/) is the fastest when speed-tested on a 50Kb string of input. In more common cases (ie. 100 character at most), this speed difference will be practically non-existent. It is twice as fast as my answer, but "2 * very small number = very small number". It's easy enough to add new test cases (just add another (?=.*something) block) but is less humanly-obvious as to what it does.
Jacob's answer ((\w+.*\s+)|(\s+.*\w+)) does quite literally what you asked, checking first if there is a word character and then a space character, then checks the other way around before failing. It works, however it is slower. Furthermore, if you decide to add a new test case, you'd get something like (\w+.*\s+.*\d+)|(\w+.*\d+.*\s)|(\s+.*\w+.*\d+)|(\s+.*\d+.*\w+)|(\d+.*\w+.*\s+)|(\d+.*\s+.*\w+). It only gets worse if you add a fourth test (24 arrangements to check) and is unreadably ugly. Do not use this answer.
Other answers are variants of existing ones.
If you need to do it in one RegEx for some reason:
(\w+.*\s+)|(\s+.*\w+)
Can be handy if you're working with a library that only enables you to use a single regular expression.
I am using software to search inside txt files with Regex, For example
So I want to find files which Contain "Black" under "color" under "clothes", So the regex should highlight "Black" which located in line 7 only.
My aim here is to follow the order no mater how many lines between terms.
I will be more than thankful if you explain "regex" so I know what I have missed.
Thanks in advance
You can use the following regex for matching the given 'Black':
/.+?Clothes.+?Colour.+?(Black)/s
Description
Demo
http://regex101.com/r/gD9iD3
Discussion
The regex here may not fit all your needs. It uses .+? for navigating between the searched elements. This is really imprecise: the "Red" case that you have outputted in your comments is a guenine POC.
The next step here is to determine how elements (Clothes, Colour etc) are structured. Armed with this knowledge, the regex can be strengthened. .+? will be replaced then by more specific elements.
If the regex is used in a Javascript context, the s modifier is not available.
To work around this limitation, the following structure: .+? can be replaced with [\s\S]+?.
It is probably quite simple, but I do not how to do.
I have this regex :
new RegExp("^[A-Za-z\\u00C0-\\u017F][\\- ]?+$");
It validates a first name. The name have to begin with a letter (the range is in unicode and works fine) and then continue with letters or - or space. But it can be just letters, as in most names.
I have searched but I didn't find the right way to do it.
I don't want to duplicate the character range. It is just to have a code more "proper".
If you could help, it would be great :)
Thanks in advance
Right now you only allow one letter and then one or more dashes/spaces. You probably want
new RegExp("^[A-Za-z\\u00C0-\\u017F][A-Za-z\\u00C0-\\u017F -]*$");
But in general, trying to validate a name with regexes isn't such a good idea.
So there have been plenty of questions, and filtering through a few, I still dont know how to go about this...
Pattern for:
Alphabets ONLY, no case sensitivity, no limit on character count or words, minimum 3 characters...
I have
pattern="[A-z]{3,}"
That gives me everything, except that I'm limited to one word only... :-(
Edit: Let me be a little more clear on what I want the validation to achieve for me...
I'm using it to capture a person's name. But I do not want any special characters or numerals involved, so no "John Doe Jr.", as the '.' will get rejected, but I want to be able to capture double, or even single character portions, whilst maintaining 'global' 3 char minimum limit...
All you have to do to allow spaces as well is to add a space to the character pattern where you have [A-z].
So it becomes:
pattern="[A-z ]{3,}"
Hope that helps.
Note, however, that this will prevent other types of white space characters. I assume this is what you want, since you're being quite restrictive with the rest of the character set, but it's worth pointing out that non-breaking spaces, carriage returns, and other white space will be blocked in the above. If you want to allow them, use \s instead of just a space: this will match any white space character.
Finally, it's worth pointing out that the standard alphabet is often insufficient even for plain English text. There are valid English words with accents, as well as apostrophes and other punctuation. You haven't specified what the field is being used for, so I'll assume this is not an issue, but I felt it was worth pointing out nevertheless.
It is difficult to see what is the question. You are matching a String, not a set of words.
If your pattern is "a list of words, each of the words alphabetical only and separated by whitespace", then the regex would be
([A-Za-z]{3,}\\s*)+
Edited to answer to updated question.
[A-Za-z\\s]*([A-Za-z]{3,})+[A-Za-z\\s]* (works in Java)
How about pattern = "[A-z\s]{3,}"?