int function ( boolean [ ] arg0 ) { int loc0 = 0 ; for ( int loc1 = parents . length - 1 ; loc1 >= 0 ; loc1 -- ) { loc0 *= 2 ; loc0 += arg0 [ loc1 ] ? 0 : 1 ; } return loc0 ; }
returns the row for the given combination of parent values . the rows are zero-indexed and are arranged in truth-table fashion , as follows . row 0 is the row where all parents have the value true . the last row row 2 ^ numparents - 1 is the row where all parents have the value false . reading down the truth table , the parent whose value changes most rapidly is the rightmost parent parent numparents - 1 ; the parent whose value changes the most slowly , in fact changes only once halfway down the table , is the leftmost parent parent 0 . this convention is adopted to make it easier to set the values of boolean functions manually ; the majority of truth tables in logic books are set up this way . concode_field_sep long serialVersionUID concode_elem_sep boolean[] lookupTable concode_elem_sep IndexedParent[] parents concode_field_sep Object[] getParents concode_elem_sep BooleanFunction serializableInstance concode_elem_sep boolean getValue concode_elem_sep int getNumRows concode_elem_sep void setValue concode_elem_sep boolean[] getParentValues concode_elem_sep String toString concode_elem_sep boolean isCanalyzing concode_elem_sep void randomize concode_elem_sep boolean isEffective concode_elem_sep void readObject