2019-10-09 13:13:56 +02:00
|
|
|
;;; bag.el --- Working with bags (aka multi-sets) -*- lexical-binding: t -*-
|
2020-09-01 11:17:43 +02:00
|
|
|
|
2019-10-09 13:13:56 +02:00
|
|
|
;; Author: William Carroll <wpcarro@gmail.com>
|
2020-09-01 11:17:43 +02:00
|
|
|
;; Version: 0.0.1
|
|
|
|
;; URL: https://git.wpcarro.dev/wpcarro/briefcase
|
|
|
|
;; Package-Requires: ((emacs "24.3"))
|
2019-10-09 13:13:56 +02:00
|
|
|
|
|
|
|
;;; Commentary:
|
|
|
|
;; What is a bag? A bag should be thought of as a frequency table. It's a way
|
|
|
|
;; to convert a list of something into a set that allows duplicates. Isn't
|
|
|
|
;; allowing duplicates the whole thing with Sets? Kind of. But the interface
|
|
|
|
;; of Sets is something that bags resemble, so multi-set isn't as bag of a name
|
|
|
|
;; as it may first seem.
|
|
|
|
;;
|
|
|
|
;; If you've used Python's collections.Counter, the concept of a bag should be
|
|
|
|
;; familiar already.
|
|
|
|
;;
|
|
|
|
;; Interface:
|
|
|
|
;; - add :: x -> Bag(x) -> Bag(x)
|
|
|
|
;; - remove :: x -> Bag(x) -> Bag(x)
|
|
|
|
;; - union :: Bag(x) -> Bag(x) -> Bag(x)
|
|
|
|
;; - difference :: Bag(x) -> Bag(x) -> Bag(x)
|
|
|
|
|
|
|
|
;;; Code:
|
|
|
|
|
|
|
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
|
|
;; Dependencies
|
|
|
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
|
|
|
2020-09-02 15:00:43 +02:00
|
|
|
(require 'al)
|
2019-10-09 13:13:56 +02:00
|
|
|
(require 'number)
|
|
|
|
|
|
|
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
|
|
;; Library
|
|
|
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
|
|
|
|
|
|
(cl-defstruct bag xs)
|
|
|
|
|
2020-09-01 11:17:43 +02:00
|
|
|
(defun bag-update (f xs)
|
2019-10-09 13:13:56 +02:00
|
|
|
"Call F on alist in XS."
|
|
|
|
(let ((ys (bag-xs xs)))
|
|
|
|
(setf (bag-xs xs) (funcall f ys))))
|
|
|
|
|
2020-09-01 11:17:43 +02:00
|
|
|
(defun bag-new ()
|
2019-10-09 13:13:56 +02:00
|
|
|
"Create an empty bag."
|
2020-09-02 15:00:43 +02:00
|
|
|
(make-bag :xs (al-new)))
|
2019-10-09 13:13:56 +02:00
|
|
|
|
2020-09-01 11:17:43 +02:00
|
|
|
(defun bag-contains? (x xs)
|
2019-10-09 13:13:56 +02:00
|
|
|
"Return t if XS has X."
|
2020-09-02 15:00:43 +02:00
|
|
|
(al-has-key? x (bag-xs xs)))
|
2019-10-09 13:13:56 +02:00
|
|
|
|
|
|
|
;; TODO: Tabling this for now since working with structs seems to be
|
2020-09-01 00:28:47 +02:00
|
|
|
;; disappointingly difficult. Where is `struct-update'?
|
2020-09-01 11:17:43 +02:00
|
|
|
;; (defun bag-add (x xs)
|
2019-10-09 13:13:56 +02:00
|
|
|
;; "Add X to XS.")
|
|
|
|
|
|
|
|
;; TODO: What do we name delete vs. remove?
|
2020-09-01 11:17:43 +02:00
|
|
|
;; (defun bag-remove (x xs)
|
2019-10-09 13:13:56 +02:00
|
|
|
;; "Remove X from XS.
|
|
|
|
;; This is a no-op is X doesn't exist in XS.")
|
|
|
|
|
2020-09-01 11:17:43 +02:00
|
|
|
(defun bag-from-list (xs)
|
2019-10-09 13:13:56 +02:00
|
|
|
"Map a list of `XS' into a bag."
|
|
|
|
(->> xs
|
2020-09-01 11:17:43 +02:00
|
|
|
(list-reduce
|
|
|
|
(bag-new)
|
2019-10-09 13:13:56 +02:00
|
|
|
(lambda (x acc)
|
2020-09-01 11:17:43 +02:00
|
|
|
(bag-add x 1 #'number-inc acc)))))
|
2019-10-09 13:13:56 +02:00
|
|
|
|
|
|
|
(provide 'bag)
|
|
|
|
;;; bag.el ends here
|