Document AbstractDict and AbstractSet

Author: kshyatt

base/essentials.jl

@@ -6,7 +6,20 @@ const Callable = Union{Function,Type}
 
 const Bottom = Union{}
 
+"""
+    AbstractSet{T}
+
+Supertype for set-like types whose elements are of type `T`.
+[`Set`](@ref), [`BitSet`](@ref) and other types are subtypes of this.
+"""
 abstract type AbstractSet{T} end
+
+"""
+    AbstractDict{K, V}
+
+Supertype for dictionary-like types with keys of type `K` and values of type `V`.
+[`Dict`](@ref), [`IdDict`](@ref) and other types are subtypes of this.
+"""
 abstract type AbstractDict{K,V} end
 
 # The real @inline macro is not available until after array.jl, so this

doc/src/base/collections.md

@@ -40,6 +40,7 @@ Fully implemented by:
   * `Number`
   * [`AbstractArray`](@ref)
   * [`BitSet`](@ref)
+  * [`Dict`](@ref)
   * [`IdDict`](@ref)
   * [`Dict`](@ref)
   * [`WeakKeyDict`](@ref)
@@ -191,6 +192,7 @@ for the key `x`).  Multiple arguments to `D[...]` are converted to tuples; for e
 `D[x,y]`  is equivalent to `D[(x,y)]`, i.e. it refers to the value keyed by the tuple `(x,y)`.
 
 ```@docs
+Base.AbstractDict
 Base.Dict
 Base.IdDict
 Base.WeakKeyDict
@@ -233,6 +235,7 @@ Partially implemented by:
 ## Set-Like Collections
 
 ```@docs
+Base.AbstractSet
 Base.Set
 Base.BitSet
 Base.union

doc/src/manual/conversion-and-promotion.md

@@ -194,7 +194,7 @@ already of the requested type:
 convert(::Type{T}, x::T) where {T<:Number} = x
 ```
 
-Similar definitions exist for `AbstractString`, `AbstractArray`, and `AbstractDict`.
+Similar definitions exist for `AbstractString`, [`AbstractArray`](@ref), and [`AbstractDict`](@ref).
 
 ## Promotion