ord

I have a newtype and I want to implement Ord : use std::cmp::{Ord, Ordering}; struct MyType(isize); impl Ord for MyType { fn cmp(&self, &other: Self) -> Ordering { let MyType(ref lhs) = *self; let MyType(ref rhs) = *other; lhs.cmp(rhs) } } When I try to compare two variables of my types, I get errors: error[E0277]: the trait bound `MyType: std::cmp::PartialOrd` is not satisfied --> src/main.rs:5:6 | 5 | impl Ord for MyType { | ^^^ can't compare `MyType` with `MyType` | = help: the trait `std::cmp::PartialOrd` is not implemented for `MyType` error[E0277]: the trait bound `MyType: std::cmp::Eq`

The Hebrew language has unicode representation between 1424 and 1514 (or hex 0590 to 05EA). I'm looking for the right, most efficient and most pythonic way to achieve this. First I came up with this: for c in s: if ord(c) >= 1424 and ord(c) <= 1514: return True return False Then I came with a more elegent implementation: return any(map(lambda c: (ord(c) >= 1424 and ord(c) <= 1514), s)) And maybe: return any([(ord(c) >= 1424 and ord(c) <= 1514) for c in s]) Which of these are the best? Or i should do it differently? You could do: # Python 3. return any("\u0590" <= c <= "\u05EA" for c in s) #

I am trying to do a function that shifts each letter in each word to the right by value and these words will be from a list that I will open it using "open"function I wrote the code, and I am facing some difficulties here here is my code def test(): value=eval(input("Value here!")) with open ("word-text.txt","r") as f: for ord in (f): print (ord) for chr in ord: print (chr) #nice=(chr[len(ord)+value]) ''.join([chr(ord(i)+2) for i in s]) print (i) this is the output I get Value here!2 apples a p p l e s Traceback (most recent call last): File "<pyshell#54>", line 1, in <module> test() File "