(apropos 'map) ;; %make-tree-map (gauche) ;; %tree-map-bound (gauche) ;; %tree-map-check-consistency (gauche) ;; %tree-map-dump (gauche) ;; %tree-map-iter (gauche) ;; <tree-map-meta> (gauche) ;; <tree-map> (gauche) ;; alist->tree-map (gauche) ;; hash-table-map (gauche) ;; library-map (gauche) ;; make-tree-map (gauche) ;; map (scheme) ;; map$ (gauche) ;; port-map (gauche) ;; tree-map->alist (gauche) ;; tree-map-ceiling (gauche) ;; tree-map-ceiling-key (gauche) ;; tree-map-ceiling-value (gauche) ;; tree-map-clear! (gauche) ;; tree-map-copy (gauche) ;; tree-map-delete! (gauche) ;; tree-map-empty? (gauche) ;; tree-map-exists? (gauche) ;; tree-map-floor (gauche) ;; tree-map-floor-key (gauche) ;; tree-map-floor-value (gauche) ;; tree-map-fold (gauche) ;; tree-map-fold-right (gauche) ;; tree-map-get (gauche) ;; tree-map-keys (gauche) ;; tree-map-max (gauche) ;; tree-map-min (gauche) ;; tree-map-num-entries (gauche) ;; tree-map-pop! (gauche) ;; tree-map-pop-max! (gauche) ;; tree-map-pop-min! (gauche) ;; tree-map-predecessor (gauche) ;; tree-map-predecessor-key (gauche) ;; tree-map-predecessor-value (gauche) ;; tree-map-push! (gauche) ;; tree-map-put! (gauche) ;; tree-map-successor (gauche) ;; tree-map-successor-key (gauche) ;; tree-map-successor-value (gauche) ;; tree-map-update! (gauche) ;; tree-map-values (gauche) ;; tree-map? (gauche) |
test
返信削除