[Jprogramming] nonsequential 1s

[Devon McCormick]

I, too, have trouble understanding what you mean by "items in a boolean
table that contain non-contiguous ones" especially since you talk about
items in a table but your code deals with items in a vector.  That is, the
description of the problem makes me think that all the ones in

   3#&>0 1
0 0 0
1 1 1

are non-contiguous since they are bordered by zeroes column-wise.

On 12/20/07, Raul Miller <rauldmiller at gmail.com> wrote:
>
> On Dec 20, 2007 8:37 AM, Tracy Harms <t_b_harms at yahoo.com> wrote:
> > The following code works, and solves the following problem: identify
> >  the items in a boolean table that contain non-contiguous ones.
>
> Could you please define this problem in more detail.
>
...
-- 
Devon McCormick, CFA
^me^ at acm.
org is my
preferred e-mail