pub struct Or {}
Expand description
A structure that defines the custom operation Or that is equivalent to the binary Or applied elementwise.
This operation accepts only binary arrays or scalars as input.
If input shapes are different, the broadcasting rules are applied (see the NumPy broadcasting rules).
For example, if input arrays are of shapes [2,3]
, and [1,3]
, the resulting array has shape [2,3]
.
To use this and other custom operations in computation graphs, see Graph::custom_op.
§Custom operation arguments
- Node containing a binary array or scalar
- Node containing a binary array or scalar
§Custom operation returns
New Or node
§Example
let c = create_context().unwrap();
let g = c.create_graph().unwrap();
let t = scalar_type(BIT);
let n1 = g.input(t.clone()).unwrap();
let n2 = g.input(t.clone()).unwrap();
let n3 = g.custom_op(CustomOperation::new(Or {}), vec![n1, n2]).unwrap();
Trait Implementations§
Source§impl CustomOperationBody for Or
impl CustomOperationBody for Or
Source§impl<'de> Deserialize<'de> for Or
impl<'de> Deserialize<'de> for Or
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for Or
impl StructuralPartialEq for Or
Auto Trait Implementations§
impl Freeze for Or
impl RefUnwindSafe for Or
impl Send for Or
impl Sync for Or
impl Unpin for Or
impl UnwindSafe for Or
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.