1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140

// Original file: "Ident.hs"
// File auto-generated using Corollary.

#[macro_use]
use corollary_support::*;

// NOTE: These imports are advisory. You probably need to change them to support Rust.
// use Data::Char;
// use Language::C::Data::Position;
// use Language::C::Data::Node;
// use Language::C::Data::Name;
// use Name;
// use Data::Generics;

use data::position::*;
use data::node::*;
use data::name::Name;

#[derive(Clone, Debug, PartialEq, PartialOrd, Eq)]
pub enum SUERef {
    AnonymousRef(Name),
    NamedRef(Ident),
}
pub use self::SUERef::*;

pub fn isAnonymousRef(_0: SUERef) -> bool {
    match (_0) {
        AnonymousRef(_) => true,
        _ => false,
    }
}

#[derive(Clone, Debug, PartialOrd, Hash, Eq)]
pub struct Ident(pub String, pub isize, pub NodeInfo);

// the definition of the equality allows identifiers to be equal that are
// defined at different source text positions, and aims at speeding up the
// equality test, by comparing the lexemes only if the two numbers are equal
impl PartialEq for Ident {
    fn eq(&self, &Ident(ref s_, ref h_, _): &Self) -> bool {
        let &Ident(ref s, ref h, _) = self;
        (h == h_) && (s == s_)
    }
}

// -- this does *not* follow the alphanumerical ordering of the lexemes
// --
// instance Ord Ident where
//   compare (Ident s h _) (Ident s' h' _) = compare (h, s) (h', s')

// -- identifiers are attributed
impl CNode for Ident {
    fn nodeInfo(self) -> NodeInfo {
        let Ident(_, _, at) = self;
        at
    }
}

impl Pos for Ident {
    fn posOf(self) -> Position {
        posOfNode(nodeInfo(self))
    }
}

pub fn quad(_0: String) -> isize {
    let c: Vec<char> = _0.chars().collect();

    // [c1, c2, c3, c4, s..]
    if c.len() > 3 {
        let s: String = c[4..].to_vec().into_iter().collect();
        return ((__mod(((ord(c[3]) *
                    (bits21() + (ord(c[2]) * (bits14() + (ord(c[1]) * (bits7() + ord(c[0])))))))),
                bits28())) + (__mod(quad(s), bits28())));
    }
    // [c1, c2, c3]
    if c.len() == 3 {
        return (ord(c[2]) * (bits14() + (ord(c[1]) * (bits7() + ord(c[2])))));
    }
    // [c1, c2]
    if c.len() == 2 { 
        return (ord(c[1]) * (bits7() + ord(c[0])));
    }
    // [c1]
    if c.len() == 1 {
        return ord(c[0]);
    }
    // []
    return 0;
}

pub fn bits7() -> isize {
    __op_power(2, (7))
}

pub fn bits14() -> isize {
    __op_power(2, (14))
}

pub fn bits21() -> isize {
    __op_power(2, (21))
}

pub fn bits28() -> isize {
    __op_power(2, (28))
}

pub fn mkIdent(pos: Position, s: String, name: Name) -> Ident {
    Ident(s.clone(), (quad(s.clone())), (mkNodeInfo_q(pos.clone(), (pos, length(s)), name)))
}

pub fn internalIdent(s: String) -> Ident {
    Ident(s.clone(), (quad(s.clone())), (mkNodeInfoOnlyPos(internalPos())))
}

pub fn internalIdentAt(pos: Position, s: String) -> Ident {
    Ident(s.clone(), (quad(s.clone())), (mkNodeInfoPosLen(pos.clone(), (pos, length(s)))))
}

pub fn builtinIdent(s: String) -> Ident {
    Ident(s.clone(), (quad(s.clone())), (mkNodeInfoOnlyPos(builtinPos())))
}

pub fn isInternalIdent(Ident(_, _, nodeinfo): Ident) -> bool {
    isInternalPos((posOfNode(nodeinfo)))
}

pub fn identToString(Ident(s, _, _): Ident) -> String {
    s
}

pub fn sueRefToString(_0: SUERef) -> String {
    match (_0) {
        AnonymousRef(_) => "".to_string(),
        NamedRef(ident) => identToString(ident),
    }
}

pub fn dumpIdent(ide: Ident) -> String {
    format!("{:?} at {:?}", identToString(ide.clone()), ide.nodeInfo())
}