I have a problem where I am trying to establish if a String element in a given list A exists in another larger list B. There are obviously a number of ways I can do this in either Jess or in Java. In Jess, I could use the member$ function and iterate through the list B until I have found the element (is there the equivalent of "break" to exit a loop in Jess). In Java, I could create a sorted TreeSet and use the "contains" method.
Which is the most efficient? How are lists represented in Jess and how does the member$ function work? Cheers, Brett -------------------------------------------------------------------- To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]' in the BODY of a message to [EMAIL PROTECTED], NOT to the list (use your own address!) List problems? Notify [EMAIL PROTECTED] --------------------------------------------------------------------
