朋友及关系

(define set?
  (lambda(lat)
    (cond
      ((null? lat)#t)
      ((member?(car lat)(cdr lat))
       #f)
      (else(set?(cdr lat))))))

(define multirember
        (lambda(a lat)
          (cond
            ((null? lat)(quote()))
            ((eq?(car lat)a)
             (multirember a (cdr lat)))
            (else(cons (car lat)
                       (multirember a
                                   (cdr lat)))))))

(define makeset
  (lambda(lat)
    (cond
      ((null? lat)(quote()))
      ((member?(car lat)(cdr lat))
       (makeset(cdr lat)))
      (else(cons(car lat)
                (makeset(cdr lat)))))))
;对于列表lat中重复出现的原子
; 函数makeset会把首次出现的原子cons
;到一般性递归的结果上,而该递归结果
;事先移除了lat中的剩余的重复出现的原子
(define makeset1
  (lambda(lat)
    (cond
      ((null? lat)(quote()))
      (else
       (cons(car lat)
            (makeset
             (multirember(car lat)
                         (cdr lat))))))))

(define subset?
  (lambda(set1 set2)
    (cond
      ((null? set1)#t)
      (else
       (and(member?(car set1)set2)
           (subset?(cdr set1)set2))
       ))))

(define eqset?
  (lambda(set1 set2)
    (cond
      (else(and(subset? set1 set2)
               (subset? set2 set1))))))

(define intersect
  (lambda(set1 set2)
   (cond
     ((null? set1)(quote()))
     ((member?(car set1)set2)
      (cons(car set1)
           (intersect(cdr set1)set2)))
     (else(intersect(cdr set1)set2)))))

(define union
  (lambda(set1 set2)
    (cond
      ((null? set1)set2)
      ((member?(car set1)set2)
       (union(cdr set1)set2))
      (else(cons(car set1)
                (union(cdr set1)set2))))))

(define intersectall
  (lambda(l-set)
    (cond
      ((null?(cdr l-set))(car l-set))
      (else(intersect(car l-set)
                     (intersectall(cdr l-set)))))))

(define a-pair?
  (lambda(x)
    (cond
      ((atom? x)#f)
      ((null? x)#f)
      ((null? (cdr x))#f)
      ((null? (cdr(cdr x)))#t)
      (else #f))))

(define first
  (lambda(p)
    (cond
      (else(car p)))))

(define second
  (lambda(p)
    (cond
      (else(car(cdr p))))))

(define build
  (lambda(s1 s2)
    (cond
       (else(cons s1
                  (cons s2(quote())))))))

(define third
  (lambda(l)
    (car(cdr(cdr l)))))

(define fun?
  (lambda(rel)
    (set?(first rel))))

(define revrel
  (lambda(rel)
    (cond
      ((null? rel)(quote()))
      (else(cons(build
                 (second(car rel))
                 (first(car rel)))
                (revrel(cdr rel)))))))

(define revpair
  (lambda(rel)
    (cond
      ((null? rel)(quote()))
      (else(cons(revpair(car rel))
                (revrel(cdr rel)))))))

(define one-to-one?
  (lambda(fun)
    (fun?(revrel fun))))
    
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值