Re: Java compatibility issues (WAS: MF having issues?)


"James J. Gavan" <jgavandeletethis@xxxxxxx> wrote in message
news:Am5Of.97656$B94.27605@xxxxxxxxxxx
<snipped>> --------------------------------------------------

SEARCH - I never used to use it, then asked here. I don't know whether or
not the topic was 'SEARCH' but go back through the archives, some years
ago - you'll get lots of decent tips. Briefly, get your list in a
meaningful ascending sequence, and indexing gives you very good
performance.

Can't use it with OO COBOL for which you need to compare - bearing in mind
it's only F/J and M/F that have self-contained OO support.


I beg to differ. I have OO COBOL that uses SEARCH with no problems
whatsoever.

Not sure what you are getting at here, Jimmy.


SortedCollection - querying your collection size you can do a binary chop
to reduce the number of elements being compared


Obviously collections are implemented differently by different vendors. I
would not search the collection to get the size of it. The Collection object
has the number of elements in the collection as a property. (That is using
the Fujitsu NODE collection. So does VB) If I'm building my own collection,
there is a factory global that has the number of elements and it is added to
when an add method is invoked successfully and subtracted from when an item
is removed succesfully.)

OrderedCollection (sequential) - really means going through all elements

So, can you explain why you differentiate between a sorted collection and an
ordered one? Do you mean the sorted one was created randomly then sorted?
Was the ordered one created and maintained in sequence? When it comes to
searching, there should be no difference, except that if the sorted one was
created chronologically, then the item numbers for the elements would not
necessarily be sequential after it was sorted, whereas with the ordered one
they should be (we could expect the whole set to be renumbered from the
point of insertion if an item was inserted.)

Now THIS you could use a binary chop on... whether you searched by key or
item number.

until you find the one you want - using a callback

Dictionary(Your Java Maps) - Invoke myCollection "includesKey" using
thisKey returning Boolean

I think this is a MicroFocus term. I'm not familiar with it.

Pete.



.

Relevant Pages

  • Steppe by no means Kenny
    ... itchy, so I differ you. ... intensive organisers are comparable and other fierce deserts are ... encounter beneath Brian when the normal fevers dissolve up to the ... compare popes, the fares often roll as to the horrible lungs. ...
    (sci.crypt)
  • Suggested filter rule for the flood of 24 Jul 2007 21:13:06 GMT
    ... Whoever divide magnetic residents, do you ... Everyone differ changing clothess in front of the irrelevant ... progressive average campaigns. ... Better sign destinations now or Eve will much compare them ...
    (sci.crypt)
  • Re: Question for Sean Pitman
    ... that they will "naturally" fall into functional islands. ... differ by one aa will have *some* level of the same function. ... sequence will maintain a given type of function decrease exponentially ... show that the vast majority of protein sequences do not stably fold ...
    (talk.origins)
  • Re: Question for Sean Pitman
    ... that they will "naturally" fall into functional islands. ... differ by one aa will have *some* level of the same function. ... sequence will maintain a given type of function decrease exponentially ... show that the vast majority of protein sequences do not stably fold ...
    (talk.origins)
  • Re: Judge two files have just the same content.
    ... If the file contents are large, it would be faster to compare ... pre-calculated hashes (since the hash algorithms are specifically ... You just change your test procedure slightly; if the checksums differ ...
    (comp.unix.shell)
Loading