This paper introduces hinted dictionaries for expressing efficient ordered sets and maps functionally. These dictionaries unify the interfaces of imperative ordered dictionaries (e.g., C++ maps) and functional ones (e.g., Adams’ sets). We show that such dictionaries can use sorted arrays, unbalanced trees, and balanced trees as their underlying representations. As use-cases, we use set-set operations and sparse linear algebra operations.