Why the following string fails the test below:
@Pattern(regexp = "^[_a-zA-Z0-9-]+(.[_a-zA-Z0-9-]+)*@[a-zA-Z0-9-]+(.[a-zA-Z0-9-]+)*.(([0-9]{1,3})|" +
"([a-zA-Z]{2,3})|(aero|coop|info|museum|name))$", message = "Not a well-formed email address")
How to map a request URL to a url pattern in deployment descriptor. I got all the answers right, but I am not sure if the thought process is correct.
<servlet>
<servlet-name>One</servlet-name>
<servlet-class>foo.DeployTestOne</servlet-class>
</servlet>
<servlet-mapping>
[Code] .....
1) [URL] ....
Container choice: DeployTestOne (matched the *.do extension pattern)
Exact match check: Is there a URL pattern in DD which is exactly = /MapTest/blue.do ? NO.
Directory match check: Is there any URL pattern in DD for directory /MapTest ? NO.
Extension match: Is there a pattern in DD for files with extension .do ? Yes !
Select DeployTestOne !
Question - When doing an Exact match check, does the container look for blue.do in DD or does it look for /MapTest/blue.do ?
2) [URL] ....
Container choice: DeployTestThree (matched the /fooStuff/* directory pattern)
Exact match check: Is there a URL pattern in DD which is exactly = /MapTest/fooStuff/bar/blue.do ? NO.
Directory match check: Is there any URL pattern in DD for directory /MapTest/fooStuff/bar ? Yes !
Go for the url pattern for longest pat, that is, /fooStuff/*
Question - When doing the directory match check, does the Container look for /MapTest/fooStuff/bar/ or just /fooStuff/bar ?
I'm trying to insert some data of type date into database table using hibernate.i take the input date from an xhtml form as shown below
addEvent.xhtml
Event Date (dd-mon-yy) :
<br/>
<h:inputText id="eventdate" value="#{eventBean.eventDate}" p:required="required"
p:type="date"/>
<p/>
<h:commandButton value="Add Event" actionListener="#{eventBean.addEvent}" />
<p/>
This is my addEvent method in EventBean.java
public void addEvent(ActionEvent evt) {
uname = Util.getUname();
boolean a = EventDAO.add(this);
if ( a) {
message = "Event has been added!";
[Code] ....
While executing this..i get the following error: ORA-01861: literal does not match format string. Could it be due to any mismatch in date format (chrome browser automatically takes date in the format mm-dd-yyyy )? If yes, how do I resolve it? (I'm using Oracle database)
I have a table which contains list of regular expression and its corresponding value.I have to fetch those value and put it HASHMAP where regex as key.I have to compare the each key with the given string(input) and If matches I have to get the corresponding Value for the regex.
View Replies View RelatedI have 2 strings
String value ="/abc_12_1/abc234/abc/filename.txt";
String src="abc"
Sring tgt=xyz
Now I have to replace the string in variable value in case of exact match; I am trying to do the following :
if(value.contains(src)
{
value.replaceall(src,tgt);
}
Now the problem here is it replaces all the occurrence of abc in the string value and I get the below output as :
value=""/xyz_12_1/xyz234/xyz/filename.txt";
However my requirement is only in the case the value exactly matches with source the replacement shd happen. I am expecting the output like this :
String value ="/abc_12_1/abc234/xyz/filename.txt";
Also the above code is in a function which will be called multiple times and the values will keep on changing. However the target and source will remain the same always.
I need a pattern that matches Hello Smith (STL Terminal) (15.0).
View Replies View RelatedI am trying to match the input string with range of values and getting PatternSyntaxException. below is my code
public static void main(String[] args) {
String regex="01[4-6]";
String code="015";
boolean bool=code.matches(regex);
System.out.println(bool);
}
output: true
But when i try to give range in double digits, it throws exception. What if i have to match a number(as string) between 10 to 25 or like that.
public static void main(String[] args) {
String regex="0[14-16]";
String code="015";
boolean bool=code.matches(regex);
System.out.println(bool);
}
Output:
Exception in thread "main" java.util.regex.PatternSyntaxException: Illegal character range near index 5
0[14-16]
^
I have a large text file of 1 GB size. I need to print the line when a matching word is found in a particular line. Below is the code I am using. But if there are many lines that has the matching word, it's taking lot of time. Any solution to print the lines much faster.
Scanner scanner = new Scanner(file);
while (scanner.hasNextLine()) {
String line = scanner.nextLine();
if(line.contains("xyz")) {
System.out.println(line);
}
}
In a code im writing I was curious as to instead of
contains(".")
I wanted to use
matches(" ") method instead but really having issues with the regex
I have tried //. as well as ^[.] but they give me errors.
I am just trying to match a period but was curious as to what the form was. I read a good amount of materials and seemed simple but getting errors.
I am trying to do here is to get as many words as we can to match words from the text file giving the 7 random letters from the arraylist ...
import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Random;
import java.util.Scanner;
public class Scrabble {
public static Scanner scan = new Scanner(System.in);
[Code] .....
Any tips or any way?
View Replies View RelatedWith the code below, I am trying to replace all regex matches for visa cards within a given text file.
My first test was with a text "new3.txt" exclusively containing the visa test card 4111111111111111. My objective was to replace the card with "xxxx-xxxx-xxxx-xxxx". This was successful.
However, when modifying the text file to include other characters and text before and after (ex: " qwerty 4111111111111111 adsf zxcv"), it gives mixed results. Although it successfully validates the match, it replaces the whole text in the file, rather than replacing solely the match.
When trying this search and replace with words (rather than a regex match), it does not have this behavior. What am I missing?
import java.io.*;
import java.util.regex.*;
public class BTest
{
//VISA Test
private final static String PATTERN = "(?s).*4[0-9]{12}(?:[0-9]{3})?.*";
public static void main(String args[])
{
try
[Code]...
I got a phone number problem. I get a list of phone numbers and a word file containing words, how could I need to see if I could match the phone number to 7 letter words, then see if I can match the first 3 numbers to 3 letter words and then the last 4 numbers to 4 number words. I figured all that out so far. The last part of this assignment is to see if I could match a combination of words together to match the phone numbers.
Example:
531 3259
IGETMILK
I am trying to match validate user input via regex comparison. But i fail to do so.
The string that will be inserted will have the following pattern: "digit/s " and it can be repeated a random number of times.
The program will extend to characters in the future but for now i am struggling with digits.
i am using a StringBuilder to build the regex string. Or maybe i could use something else but so far i didn't make it.
So far i have this regex
Java Code: "(d+s+)+" mh_sh_highlight_all('java');
The problem is that the newline character will interfere with the last number.
So if i enter
Java Code: "3 4 555" mh_sh_highlight_all('java');
- it will not match. And the regex will only see 3 4.
But if i enter
Java Code: "3 4 555 " mh_sh_highlight_all('java');
- with an extra space at the end it works. Obviously that is not the desired case.
I did find a workaround, but i fear it is somewhat broken
I changed to
Java Code: "(d+s*)+" mh_sh_highlight_all('java');
But in this case the pattern should see 3 4 5 5 5 as the regular expression. Am i correct?
I also tried some other variants but none of them worked:
Java Code: "d+(s+|*)" mh_sh_highlight_all('java');
Or i could do something like
Java Code: "(d+s){" + i + "}" mh_sh_highlight_all('java');
- where i is the number of values i enter.
Am i on the right track here? What am i forgetting?
So, i got the following code:
@Path("{bill-id}/request")
@Path("{user-id}")
and the following pattern
myhost/c15a856/request
somehow, the container always decides to match it to @Path("{user-id}"). How do I resolve this
I am working on a class that sorts and matches items in a collection of arrays. In the end, elements common to all 3 arrays should be printed. The idea is that as the first array is compared to the second it stores the matched items in tempArray. When all items are compared the tempArray should overwrite the checked array, and the process continues until all arrays are checked. I have set all the checking in a do loop that should run while the value is <= to the array length. This allows all items in the reference array to be checked. I get an index out of bounds message but not where I would expect it. I have tried varying the condition in the do while loop in the match method, but it did not change the result. There may be other issues I have not addressed with solving the algorithm, but this one has me stumped and I am not able to progress.
package testing;
public class TestMatchMain {
public static void main(String[] args) {
Comparable[] innerCollection0 = {1,2,3,4,5};
Comparable[] innerCollection1 = {1,1,5,6,7};
[Code] .....
I have a requirement like to attach most suitable flow to a request
Flows should be like below (eg:Flow1) .We can create n number of flows with any combination of values.
When I tried to create a request that have all the features in the flow. And I have to attach the most suited flow to that request.
Suppose my request have the feature Place = Place1 and company =Comp1 and Job=Job1 .here most suitable flow is Flow1.
So my question is how can I implement the logic in java for getting the most suitable match.
public class Regextest {
public static void main(String a[]){
String stream = "ab34ef";
Pattern pattern = Pattern.compile("d*")
[code]....
My question is: The methods start()will give the indexes into the text where the found match starts .d*, this means if a number found.index must be returned. Why doesn't it print 3? 12345
Another question: Why it prints 6?
0>a
.
.
.
5>f
What is this 6 in out put?
I have this program where I'm supposed to fill an array with 1000 indices with 1000 randomly generated numbers between 1 and 1000. The program is supposed to check if any of the numbers match an index that is the same value (so for example, the number 4 is in index 4). How to check for that condition, especially using a binary search (I'm also told to use a binary search).
Right now the variable index isn't initialized because I don't know what to initialize it to exactly. How do I check to see if any numbers match the value of the same index?
import java.util.*;
public class Identity {
public static void main(String[] args) {
int [] integers = new int [1000];
// Fill array with randomly generated numbers
int [] display = GenerateRandom(integers);
[Code] ....
I have created this program that outputs
1
12
123
1234
12345
123456
I tried looking up some ways to create spaces in between each number, but I failed miserably. Here is what I have right now.
public class Iterations {
public static void main(String[] args){
for(int i=1;i<=6;i++)
{
for(int j=1;j<=i;j++)
System.out.print(j);
[Code] ....
I want to know how to print this type of pattern when a name is given ???
Example:
name given TEJA
Capture.PNG
I am able to get Cpu speed using my GetProcessorSpeed method and It returns this output 1796. How can apply this pattern "#.##". I am trying something like this.
Format formatter=new DecimalFormat("#.##");
formatter.format(MainClass.GetProcessorSpeed());
label2.setText(formatter.toString());
I was reading head first java and the author told to read head first design pattern next.
View Replies View RelatedI have code which validate code enter by user
the requirement say the maxlength=2 and minlength=1 and is a string
the user can enter code as follows
00
A1
HH
12
10
09
I have this Java Code:
public boolean isValidPattern(String s_value, String s_pattern) {
boolean flag = false;
if (Pattern.matches(s_pattern, s_value)) {
flag = true;
}
return flag;
[Code] ....
My problem is when user put
A1 AM geting error
So I'm studying for a test i have coming up on recursion so i was playing around with it. I ended up making a pattern of stars that look that such :
*
**
***
The code i had for that was
public void makePattern(int size){
if(size == 0){
System.out.println();
}
else if(size > 0){
System.out.print("*");
makePattern(size - 1);
}
}
I was wondering if i wanted to expand on this and make it do something like
*
**
***
**
*
What condition would i have to add i was struggling trying to figure it out...
I am in an intro programming class and we got assigned a problem for creating a super class with about a dozen sub classes for generating a random word(via WordGetter class) and then comparing that word to a variety of different patterns(like: does the word contain "re"). We were given the super class which looks like this...
public class Pattern {
public boolean matches(String text) {
return true;
}
public String toString() {
return "(TRUE)";
[code]...
and from this class, we have to write subclasses that override those three methods. I am struggling to understand inheritance and I am not really sure where to even start. Here is the instructions for the first sub class we need to write...
"CONTAINS" SUBCLASS
Constructor: The constructor accepts a String named ‘letters’.
Matches: This pattern matches any text that contains at least one occurrence of each ‘letter’.
toString: produces the text “(CONTAINS <LETTERS>)” where <LETTERS> is the ‘letters’ string.
getLetters(): this method must return letters.
equals(Object): careful on this one. Two Contains are equal if they have the same letters (order is not relevant).
(Example):
Pattern p = new Contains(“re”);
boolean f1 = p.matches(“renew”); // f1 is true
boolean f2 = p.matches(“zoo”); // f2 is false
String s = p.toString(); // s is “(CONTAINS re)”
boolean f3 = p.equals(new Contains(“er”)); // f3 is true.. really..