source: libcfa/src/collections/pair.cfa @ eb5dbfd

// The contents of this file are covered under the licence agreement in the
// file "LICENCE" distributed with Cforall.
//
// pair.c --
//
// Author           : Aaron Moss
// Created On       : Wed Apr 12 15:32:00 2017
// Last Modified By : Peter A. Buhr
// Last Modified On : Wed Aug 30 21:27:12 2023
// Update Count     : 2
//

#include <collections/pair.hfa>

forall(R, S
        | { int ?==?(R, R); int ?<?(R, R); int ?<?(S, S); })
int ?<?(pair(R, S) p, pair(R, S) q) {
        return p.first < q.first || ( p.first == q.first && p.second < q.second );
}

forall(R, S
        | { int ?==?(R, R); int ?<?(R, R); int ?<=?(S, S); })
int ?<=?(pair(R, S) p, pair(R, S) q) {
        return p.first < q.first || ( p.first == q.first && p.second <= q.second );
}

forall(R, S | { int ?==?(R, R); int ?==?(S, S); })
int ?==?(pair(R, S) p, pair(R, S) q) {
        return p.first == q.first && p.second == q.second;
}

forall(R, S | { int ?!=?(R, R); int ?!=?(S, S); })
int ?!=?(pair(R, S) p, pair(R, S) q) {
        return p.first != q.first || p.second != q.second;
}

forall(R, S
        | { int ?==?(R, R); int ?>?(R, R); int ?>?(S, S); })
int ?>?(pair(R, S) p, pair(R, S) q) {
        return p.first > q.first || ( p.first == q.first && p.second > q.second );
}

forall(R, S
        | { int ?==?(R, R); int ?>?(R, R); int ?>=?(S, S); })
int ?>=?(pair(R, S) p, pair(R, S) q) {
        return p.first > q.first || ( p.first == q.first && p.second >= q.second );
}