Skip to main content

Web Service Explorer (An Amazing tool in eclipse IDE)

Web Service Explorer (An Amazing tool in eclipse IDE)



Developer or user who wants to use the web-service has to consume the web-service and invoke the method of the service he/she wants to. Thus there are many potential ways to test the we-service exposed.

• write a CICS program that invokes the Web Service
• consume the WSDL and make a client project in eclipse IDE or My-Eclipse and invoke the service
• generate a Java program using Rational Application Developer (RAD) or WebSphere Developer for  zSeries (WDz),
• use the debugger that comes with WDz,
• use the supplied Web Services Explorer that comes with RAD and WDz,
• use the TCP/IP Monitor that comes with RAD and WDz,
or a combination of these.

Apart from these, one method to test the web-service on the ease using the web service explorer tool available in eclipse IDE.

For the tutorial of how to use visit the below official link of tutorial.

Labels:
Location: Bangalore, Karnataka, India

Comments

Post a Comment

Popular posts from this blog

StackOverFlowError and OutOfMemoryError in java

There are two area inside java virtual machine's memory the heap and the  stack . The  stack  memory is used to store local variables and function call while heap memory is used to store objects in  Java The most common cause of StackOverFlowError is too deep or infinite recursion or many local objects / variables creation inside function call in  Java.  According to the java source documentation,  Java throws  java.lang.StackOverflowError   when a stack overflow occurs because an application recurses too deeply. JVM has a given memory allocation for each stack of each thread, and if an attempt to call a method happens to fill this memory, JVM throws an error. Just like it would do if we try to write at index N of an array of length N.  The point to be noted here is that - These are errors not an exceptions. No memory corruption happens due to the error. Stack can not write into the heap space. A StackOverflowError i...
Post a Comment
Read more

Job Sequencing with Deadlines

Given a set of n jobs Each job i has an integer deadlines di>=0 and a profit pi>0 All jobs requires only one unit time to complete Only one machine is available for processing jobs For job i the profit pi is earned if the job is completed by its deadline.
Post a Comment
Read more