Jeanne Boyarsky wrote:Sorry about that. I don't see that plugin packaged anywhere. You could build it yourself. Since there isn't much out there on it, I'd be careful using it. It could be buggy or have other issues.
Jeanne Boyarsky wrote:
Meherdad Bomanbehram wrote:Hi Jeanne ,
I am not able to apply/download this plugin . Can you please let me know where I can get it from.
You can get it from the Jenkins update site. Just download the hpi file. Then you can upload it directly to your Jenkins browser install. (Manage Jenkins > Manage Plugins)
Unsuccessful searches return an int index that represents the insertion point.
The insertion point is the place in the collection/array where the element
would be inserted to keep the collection/array properly sorted. Because positive
return values and 0 indicate successful searches, the binarySearch()
method uses negative numbers to indicate insertion points. Since 0 is a valid
result for a successful search, the first available insertion point is -1. Therefore,
the actual insertion point is represented as (-(insertion point) -1). For
instance, if the insertion point of a search is at element 2, the actual insertion
point returned will be -3.