Furthermore, in the following algorithms, the version ids are thought of as being divided into
tuples, and are normalized to have the same number of elements. For example, 1.4 and
1.2.2.008 , when compared, become respectively (1,4,0,0) and (1,2,2,008).
The algorithm for the exact match is intended to function as follows:
The first parts, v1H and v2H ,must be the same (that is, as in the String 's equals(..) method),
and v1T matches exactly v2T ,or they are both empty ( v1T==V2T==”” ).
Similarly, the algorithm for prefix match is defined as follows:
The first parts, v1H and v2H ,must be the same, and
v1T is a prefix match of v2T ,or v1T is empty ( v1T==”” ).
Version Ids Ordering
For the ordering of two different Version Ids, the algorithm is as follows:
v1 > v2 if at least one of the following is true:
• v1H > v2H ,
• v1H == v2H and v1T !=”” and v2T !=””,
• v1H == v2H and v1T > v2T recursively.
The server-side of the JNLP specification describes the protocol involved in sending the
requested material to the JNLP Client. The protocol is greatly simplified by relying completely
on the HTTP protocol. Basically, the server reacts to GET requests from JNLP Clients.
Due to the different kinds of requests, the JNLP protocol encourages the use of error codes for
the more common problems, as reported in the following table.
Resource Not Found(HTTP error 404)
Could Not Locate Requested Version