Kjeld Sigtermans

Thanks Frits (vriendelijk dank )
I looked in to it, and asked the providing party to change their WSDL.
However now I am facing another problem, which I posted here

Cheers,
Kjeld

I would like to access a third party websevice using a Java client that I generated with JAX-WS wsimport, based on the WSDL provided (I am using a Maven plugin).

For quite a while I was unable to retrieve a useful response, not in the Java client and also not in SoapUI, until I found out that I had to enable WS-A on the request. In SoapUI this now results in the expected response, but what must I do to also 'enable' WS-A in the Java client? Do I maybe have to alter the WSDL, or add a parameter to wsimport?

I found some documentation on WS-A online, but so far could not find an answer.

Thanks in advance.

Answering my own question:

I did not find any way that Hibernate will check if the object that I am about to persist somehow already is present in the database table.
So I created a method that recursively checks the object, and all its children, to see if either of them is already there in the database (comparing the columns that are defined to be unique). If so, the persisted 'table' row/object is used instead (replacing the object I was about to persist). If not, the new object is persisted.
I used a lot of Reflection to achieve this, but it works perfectly.

Hi,

I am using a Java program I made, that makes use of Apache HTTP Client, to access a secure website (https).
When sending a request to this https:// url, I get a HTML response with an error message (a text message the site itself returns saying I probably made a typo).
When doing the same in a browser, I do get to see the page that I want. I'd like to get the same result when accessing it using my program.

In both cases, I am using a local debugging proxy, that tells me there is only one thing different: in my Java approach, I am not setting a SSL sessionID: it is 'empty'.
When using the browser, the sessionID is set: it is equal to a SSL sessionID, provided in the response of a previous request.
Now, this program I made works flawlessly with regular http requests and parameters. I just really do not know how to get the SSL sessionID from a response, and to make sure it is there in the next request?

Thanks!
Kjeld

Hi,

I am using Hibernate combined with HSQLDB. It has been a while since I used Hibernate.
Is it possible to have either Hibernate or HSQLDB make sure that rows in a table are unique?
I mean not just using a uniqueness constraint and getting an exception when persisting an object. When persisting an object, I would like one of these products to check if a similar row is already present in the table, and if so, use a reference to the already existing row, instead of the one that was about to be persisted.
Or do I first have to check this myself by retrieving all rows in a Set and then use contains(..), for the object and every child object?


Thanks!
Kjeld

Ok, I created a class called a 'Chain'. It implements Iterable and therefore provides an iterator. For now it only has one other method, add(final T predecessor, final T successor), with which predecessor-successor pairs can be added to the chain.
For example, when adding pairs (B, C) and (A, B) and (null, A), the iterator will return A, B, C. When providing an element that 'breaks the chain', like (D, E), the iterator just stops at C and will never show D or E, because no successor refers to D.
It is not allowed to add the same predecessor twice (illegal argument). When the precedessor is null, it depicts the successor is the first element that should be returned by the iterator. A successor can never be null (illegal argument).
import java.util.HashMap; import java.util.Iterator; import java.util.Map; public class Chain<T> implements Iterable<T> { private final Map<T, T> table = new HashMap<T, T>(); private class ChainIterator implements Iterator<T> { private T currentElement; public ChainIterator() { currentElement = null; } @Override public boolean hasNext() { final boolean more = table.containsKey(currentElement); if (!more && currentElement == null) { throw new IllegalStateException("Chain has no beginning. A predecessor value null must be provided."); } return more; } @Override public T next() { currentElement = table.get(currentElement); if (currentElement == null) { throw new IllegalStateException("No more entries in chain (or broken chain)."); } return currentElement; } @Override public void remove() { throw new IllegalStateException("Remove method not implemented."); } } public void add(final T predecessor, final T successor) { if (successor == null) { throw new IllegalArgumentException("Successor can not be null."); } if (table.containsKey(predecessor)) { throw new IllegalArgumentException("Chain already contains predecessor: " + predecessor); } table.put(predecessor, successor); } @Override public Iterator<T> iterator() { return new ChainIterator(); } }
I can now utilize the Chain class in my test class (see previous code posted here above) like this:
private void sortUsingChain() { final Chain<TE> teChain = new Chain<TE>(); for (final TE element: elements) { teChain.add(element.reference, element); } printIterable(teChain); } private void printIterable(final Iterable<TE> iterable) { for (final TE element: iterable) { System.out.println(element.id); } }
It returns the elements in the correct order.

Thanks. I really like the map solution and also the idea of leaving the collection unsorted: I could create my own List implementation of unsorted elements, with an iterator that returns them in the correct order. I am going to try that.

Cheers, K

I have come up with the code herebelow. The method 'sortManually()' works for me.
The for statement iterates through each element in the original list. The element is always added to a new, sorted list, it is just a question at what index.
The inline statement clarified (gotta love 'em): when the reference (the other element this element refers to) is null, the element is placed at the very beginning. Otherwise, when the reference already exists in the new list, this element is placed just after it. Otherwise, the element is just placed at the end.
This code assumes all elements are each referred to by one other element, or not at all.

import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.List; public class TestReferenceComparison { /** * Test Element (TE) */ private class TE { // For identification private final String id; // Has a reference to another TE private final TE reference; public TE(final String id, final TE reference) { this.id = id; this.reference = reference; } } // Test elements in the order in which they should appear // Each element is referred to by one other element only private final TE first = new TE("1st", null); private final TE second = new TE("2nd", first); private final TE third = new TE("3rd", second); private final TE fourth = new TE("4th", third); private final TE fifth = new TE("5th", fourth); // Unsorted array of elements private final List<TE> elements = Arrays.asList(new TE[] { second, fifth, third, first, fourth }); private class TEComparator implements Comparator<TE> { @Override public int compare(final TE element1, final TE element2) { if (isFirstElementReferredToBySecondElement(element1, element2)) { // element1 should be the predecessor of element2 return -1; } else if (isFirstElementReferredToBySecondElement(element2, element1)) { // element2 should be the predecessor of element1 return 1; } else { return 0; } } private boolean isFirstElementReferredToBySecondElement(final TE te1, final TE te2) { return te1.equals(te2.reference); } } public static void main(String[] args) { new TestReferenceComparison().sortManually(); } private void sortUsingComparator() { Collections.sort(elements, new TEComparator()); printIterable(elements); } private void sortManually() { final List<TE> sortedElements = new ArrayList<TE>(); int index; for (final TE element: elements) { final TE reference = element.reference; index = reference == null ? 0 : (index = sortedElements.indexOf(reference)) > -1 ? index + 1 : sortedElements.size(); sortedElements.add(index, element); } printIterable(sortedElements); } private void printIterable(final Iterable<TE> iterable) { for (final TE element: iterable) { System.out.println(element.id); } } }

I believe equality of classes in Java is how we define them to be, and furthermore, a comparator's results are not per se based on some sort of equality, so I don't agree on that part.
However, the solution I mentioned before does not work. I hoped it would. So now I'm trying something other than using a comparator.

Well, now I am thinking what if the comparator returns 0 if the two elements do not refer to each other, returns 1 if element B refers to A, or -1 if A refers to B? Something like that. I haven't tried it yet.

Hi,

I am trying to find a way to sort a collection of elements. These elements are all of the same type, and refer to each other, in such a way that each of them refer to their predecessor (the elements have an id, and a 'previousId', which refers to the id of the previous element. The first element is indicated with previousId = null).
Given that the collection has these elements in random order (unsorted), how can I sort them to be able to display them in the right order? Is it possible to sort them using a comparator, or should I look for alternatives?

Cheers,
Kjeld

Better late than never: I finally went with the psexec solution, since I was unable to find a framework with which I could accomplish the same thing.

Thanks!

Thank you for this; but what I am looking for is a Java API, so I can do exactly that from my Java program. Sorry if I was unclear about that.
Installing something like PsExec and then run it from my code is also not an option for me. I am really looking for a API equivalent to something like PsExec.

Cheers,
K

Hi,

Is it possible to run an executable file (e.g. bat or exe or runnable jar) on another Windows machine than the one where I am running my Java program (in the same network)?
The executable file is already on that remote machine, and I have the credentials to log in as an admin on that machine (i.o.w. I can log in as an admin on that machine using Remote Desktop).
I am trying to automate running a script on several Windows machines in my network. So I don't want to run the file manually or set up a scheduled task, but I want to start it from my client pc where I am running my Java program.

Cheers,
Kjeld

Nevermind. I resolved it by removing the interaction sequence from the script.