|
| 1 | +# Normed{T,f} maps UInts from 0 to 2^f-1 to the range [0.0, 1.0] |
| 2 | +# For example, Normed{UInt8,8} == N0f8 maps 0x00 to 0.0 and 0xff to 1.0 |
| 3 | + |
| 4 | +immutable Normed{T<:Unsigned,f} <: FixedPoint{T,f} |
| 5 | + i::T |
| 6 | + |
| 7 | + Normed(i::Integer,_) = new(i%T) # for setting by raw representation |
| 8 | + Normed(x) = convert(Normed{T,f}, x) |
| 9 | +end |
| 10 | + |
| 11 | + rawtype{T,f}(::Type{Normed{T,f}}) = T |
| 12 | + rawtype(x::Number) = rawtype(typeof(x)) |
| 13 | +nbitsfrac{T,f}(::Type{Normed{T,f}}) = f |
| 14 | +floattype{T<:Normed}(::Type{T}) = floattype(supertype(T)) |
| 15 | +typechar{X<:Normed}(::Type{X}) = 'N' |
| 16 | +signbits{X<:Normed}(::Type{X}) = 0 |
| 17 | + |
| 18 | +for T in (UInt8, UInt16, UInt32, UInt64) |
| 19 | + for f in 0:sizeof(T)*8 |
| 20 | + sym = Symbol(takebuf_string(showtype(_iotypealias, Normed{T,f}))) |
| 21 | + @eval begin |
| 22 | + typealias $sym Normed{$T,$f} |
| 23 | + export $sym |
| 24 | + end |
| 25 | + end |
| 26 | +end |
| 27 | + |
| 28 | +reinterpret{T<:Unsigned, f}(::Type{Normed{T,f}}, x::T) = Normed{T,f}(x, 0) |
| 29 | + |
| 30 | +zero{T,f}(::Type{Normed{T,f}}) = Normed{T,f}(zero(T),0) |
| 31 | +function one{T<:Normed}(::Type{T}) |
| 32 | + T(typemax(rawtype(T)) >> (8*sizeof(T)-nbitsfrac(T)), 0) |
| 33 | +end |
| 34 | +zero(x::Normed) = zero(typeof(x)) |
| 35 | + one(x::Normed) = one(typeof(x)) |
| 36 | +rawone(v) = reinterpret(one(v)) |
| 37 | + |
| 38 | +# Conversions |
| 39 | +convert{T<:Normed}(::Type{T}, x::T) = x |
| 40 | +convert{T1,T2,f}(::Type{Normed{T1,f}}, x::Normed{T2,f}) = Normed{T1,f}(convert(T1, x.i), 0) |
| 41 | +function convert{T,T2,f}(::Type{Normed{T,f}}, x::Normed{T2}) |
| 42 | + U = Normed{T,f} |
| 43 | + y = round((rawone(U)/rawone(x))*reinterpret(x)) |
| 44 | + (0 <= y) & (y <= typemax(T)) || throw_converterror(U, x) |
| 45 | + reinterpret(U, _unsafe_trunc(T, y)) |
| 46 | +end |
| 47 | +convert(::Type{N0f16}, x::N0f8) = reinterpret(N0f16, convert(UInt16, 0x0101*reinterpret(x))) |
| 48 | +convert{U<:Normed}(::Type{U}, x::Real) = _convert(U, rawtype(U), x) |
| 49 | +function _convert{U<:Normed,T}(::Type{U}, ::Type{T}, x) |
| 50 | + y = round(widen1(rawone(U))*x) |
| 51 | + (0 <= y) & (y <= typemax(T)) || throw_converterror(U, x) |
| 52 | + U(_unsafe_trunc(T, y), 0) |
| 53 | +end |
| 54 | +function _convert{U<:Normed}(::Type{U}, ::Type{UInt128}, x) |
| 55 | + y = round(rawone(U)*x) # for UInt128, we can't widen |
| 56 | + (0 <= y) & (y <= typemax(UInt128)) & (x <= Float64(typemax(U))) || throw_converterror(U, x) |
| 57 | + U(_unsafe_trunc(UInt128, y), 0) |
| 58 | +end |
| 59 | + |
| 60 | +rem{T<:Normed}(x::T, ::Type{T}) = x |
| 61 | +rem{T<:Normed}(x::Normed, ::Type{T}) = reinterpret(T, _unsafe_trunc(rawtype(T), round((rawone(T)/rawone(x))*reinterpret(x)))) |
| 62 | +rem{T<:Normed}(x::Real, ::Type{T}) = reinterpret(T, _unsafe_trunc(rawtype(T), round(rawone(T)*x))) |
| 63 | + |
| 64 | +# convert(::Type{AbstractFloat}, x::Normed) = convert(floattype(x), x) |
| 65 | +float(x::Normed) = convert(floattype(x), x) |
| 66 | + |
| 67 | +convert(::Type{BigFloat}, x::Normed) = reinterpret(x)*(1/BigFloat(rawone(x))) |
| 68 | +function convert{T<:AbstractFloat}(::Type{T}, x::Normed) |
| 69 | + y = reinterpret(x)*(one(rawtype(x))/convert(T, rawone(x))) |
| 70 | + convert(T, y) # needed for types like Float16 which promote arithmetic to Float32 |
| 71 | +end |
| 72 | +convert(::Type{Bool}, x::Normed) = x == zero(x) ? false : true |
| 73 | +convert{T<:Integer}(::Type{T}, x::Normed) = convert(T, x*(1/one(T))) |
| 74 | +convert{Ti<:Integer}(::Type{Rational{Ti}}, x::Normed) = convert(Ti, reinterpret(x))//convert(Ti, rawone(x)) |
| 75 | +convert(::Type{Rational}, x::Normed) = reinterpret(x)//rawone(x) |
| 76 | + |
| 77 | +# Traits |
| 78 | +abs(x::Normed) = x |
| 79 | + |
| 80 | +(-){T<:Normed}(x::T) = T(-reinterpret(x), 0) |
| 81 | +(~){T<:Normed}(x::T) = T(~reinterpret(x), 0) |
| 82 | + |
| 83 | ++{T,f}(x::Normed{T,f}, y::Normed{T,f}) = Normed{T,f}(convert(T, x.i+y.i),0) |
| 84 | +-{T,f}(x::Normed{T,f}, y::Normed{T,f}) = Normed{T,f}(convert(T, x.i-y.i),0) |
| 85 | +*{T<:Normed}(x::T, y::T) = convert(T,convert(floattype(T), x)*convert(floattype(T), y)) |
| 86 | +/{T<:Normed}(x::T, y::T) = convert(T,convert(floattype(T), x)/convert(floattype(T), y)) |
| 87 | + |
| 88 | +# Comparisons |
| 89 | + <{T<:Normed}(x::T, y::T) = reinterpret(x) < reinterpret(y) |
| 90 | +<={T<:Normed}(x::T, y::T) = reinterpret(x) <= reinterpret(y) |
| 91 | + |
| 92 | +# Functions |
| 93 | +trunc{T<:Normed}(x::T) = T(div(reinterpret(x), rawone(T))*rawone(T),0) |
| 94 | +floor{T<:Normed}(x::T) = trunc(x) |
| 95 | +function round{T,f}(x::Normed{T,f}) |
| 96 | + mask = convert(T, 1<<(f-1)) |
| 97 | + y = trunc(x) |
| 98 | + return convert(T, reinterpret(x)-reinterpret(y)) & mask>0 ? |
| 99 | + Normed{T,f}(y+one(Normed{T,f})) : y |
| 100 | +end |
| 101 | +function ceil{T,f}(x::Normed{T,f}) |
| 102 | + k = 8*sizeof(T)-f |
| 103 | + mask = (typemax(T)<<k)>>k |
| 104 | + y = trunc(x) |
| 105 | + return convert(T, reinterpret(x)-reinterpret(y)) & (mask)>0 ? |
| 106 | + Normed{T,f}(y+one(Normed{T,f})) : y |
| 107 | +end |
| 108 | + |
| 109 | +trunc{T<:Integer}(::Type{T}, x::Normed) = convert(T, div(reinterpret(x), rawone(x))) |
| 110 | +round{T<:Integer}(::Type{T}, x::Normed) = round(T, reinterpret(x)/rawone(x)) |
| 111 | +floor{T<:Integer}(::Type{T}, x::Normed) = trunc(T, x) |
| 112 | + ceil{T<:Integer}(::Type{T}, x::Normed) = ceil(T, reinterpret(x)/rawone(x)) |
| 113 | + |
| 114 | +isfinite(x::Normed) = true |
| 115 | +isnan(x::Normed) = false |
| 116 | +isinf(x::Normed) = false |
| 117 | + |
| 118 | +bswap{f}(x::Normed{UInt8,f}) = x |
| 119 | +bswap(x::Normed) = typeof(x)(bswap(reinterpret(x)),0) |
| 120 | + |
| 121 | +function minmax{T<:Normed}(x::T, y::T) |
| 122 | + a, b = minmax(reinterpret(x), reinterpret(y)) |
| 123 | + T(a,0), T(b,0) |
| 124 | +end |
| 125 | + |
| 126 | +# Iteration |
| 127 | +# The main subtlety here is that iterating over 0x00uf8:0xffuf8 will wrap around |
| 128 | +# unless we iterate using a wider type |
| 129 | +@inline start{T<:Normed}(r::StepRange{T}) = widen1(reinterpret(r.start)) |
| 130 | +@inline next{T<:Normed}(r::StepRange{T}, i::Integer) = (T(i,0), i+reinterpret(r.step)) |
| 131 | +@inline function done{T<:Normed}(r::StepRange{T}, i::Integer) |
| 132 | + i1, i2 = reinterpret(r.start), reinterpret(r.stop) |
| 133 | + isempty(r) | (i < min(i1, i2)) | (i > max(i1, i2)) |
| 134 | +end |
| 135 | + |
| 136 | +function decompose(x::Normed) |
| 137 | + g = gcd(reinterpret(x), rawone(x)) |
| 138 | + div(reinterpret(x),g), 0, div(rawone(x),g) |
| 139 | +end |
| 140 | + |
| 141 | +# Promotions |
| 142 | +promote_rule{T<:Normed,Tf<:AbstractFloat}(::Type{T}, ::Type{Tf}) = promote_type(floattype(T), Tf) |
| 143 | +promote_rule{T<:Normed, R<:Rational}(::Type{T}, ::Type{R}) = R |
| 144 | +function promote_rule{T<:Normed, Ti<:Union{Signed,Unsigned}}(::Type{T}, ::Type{Ti}) |
| 145 | + floattype(T) |
| 146 | +end |
| 147 | +@generated function promote_rule{T1,T2,f1,f2}(::Type{Normed{T1,f1}}, ::Type{Normed{T2,f2}}) |
| 148 | + f = max(f1, f2) # ensure we have enough precision |
| 149 | + T = promote_type(T1, T2) |
| 150 | + # make sure we have enough integer bits |
| 151 | + i1, i2 = 8*sizeof(T1)-f1, 8*sizeof(T2)-f2 # number of integer bits for each |
| 152 | + i = 8*sizeof(T)-f |
| 153 | + while i < max(i1, i2) |
| 154 | + T = widen1(T) |
| 155 | + i = 8*sizeof(T)-f |
| 156 | + end |
| 157 | + :(Normed{$T,$f}) |
| 158 | +end |
| 159 | + |
| 160 | +_unsafe_trunc{T}(::Type{T}, x::Integer) = x % T |
| 161 | +_unsafe_trunc{T}(::Type{T}, x) = unsafe_trunc(T, x) |
0 commit comments