[Libre-soc-bugs] [Bug 176] partitioned dynamic bool/all/any/xor operators

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=176

Luke Kenneth Casson Leighton <lkcl at lkcl.net> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |cestrauss at gmail.com

--- Comment #10 from Luke Kenneth Casson Leighton <lkcl at lkcl.net> ---
https://git.libre-soc.org/?p=ieee754fpu.git;a=blob;f=src/ieee754/part_cmp/experiments/eq_combiner.py;h=f3d299f780618a732debb32faa62221f20240068;hb=4a5f5fedddb68de9704cfb9c9991d93d32af8e47

xor can, i believe be constructed by simply copying (better, adding a parameter
to augment) EqCombiner so that, at line 50, it does an XOR rather than an OR

and a copy of this:

https://git.libre-soc.org/?p=ieee754fpu.git;a=blob;f=src/ieee754/part_cmp/experiments/equal_ortree.py;h=470fb603f48c31c84a13e2cf4e240ea7acd2f590;hb=4a5f5fedddb68de9704cfb9c9991d93d32af8e47

augmented to firstly only have one argument and secondly to produce, at lihe
49, a list of partial XORs

     ...append(self.a[start:end].xor())

and i believe it's done.

-- 
You are receiving this mail because:
You are on the CC list for the bug.