src/Pure/Tools/find_consts.ML
author wenzelm
Sat Mar 17 11:23:14 2012 +0100 (2012-03-17)
changeset 46979 ef4b0d6b2fb6
parent 46961 5c6955f487e5
child 48646 91281e9472d8
permissions -rw-r--r--
sort via string_ord (as secondary key), not fast_string_ord via Symtab.fold;
tuned;
wenzelm@30143
     1
(*  Title:      Pure/Tools/find_consts.ML
kleing@29884
     2
    Author:     Timothy Bourke and Gerwin Klein, NICTA
kleing@29884
     3
wenzelm@30143
     4
Hoogle-like (http://www-users.cs.york.ac.uk/~ndm/hoogle) searching by
wenzelm@30143
     5
type over constants, but matching is not fuzzy.
kleing@29884
     6
*)
kleing@29884
     7
kleing@29884
     8
signature FIND_CONSTS =
kleing@29884
     9
sig
wenzelm@30143
    10
  datatype criterion =
wenzelm@30143
    11
      Strict of string
wenzelm@30143
    12
    | Loose of string
wenzelm@30143
    13
    | Name of string
kleing@29884
    14
  val find_consts : Proof.context -> (bool * criterion) list -> unit
kleing@29884
    15
end;
kleing@29884
    16
wenzelm@33301
    17
structure Find_Consts : FIND_CONSTS =
kleing@29884
    18
struct
kleing@29884
    19
wenzelm@30143
    20
(* search criteria *)
wenzelm@30143
    21
wenzelm@30143
    22
datatype criterion =
wenzelm@30143
    23
    Strict of string
wenzelm@30143
    24
  | Loose of string
wenzelm@30143
    25
  | Name of string;
kleing@29884
    26
wenzelm@31684
    27
wenzelm@30143
    28
(* matching types/consts *)
kleing@29884
    29
wenzelm@30143
    30
fun matches_subtype thy typat =
wenzelm@38335
    31
  Term.exists_subtype (fn ty => Sign.typ_instance thy (ty, typat));
kleing@29884
    32
wenzelm@38335
    33
fun check_const pred (nm, (ty, _)) =
wenzelm@38335
    34
  if pred (nm, ty) then SOME (Term.size_of_typ ty) else NONE;
kleing@29884
    35
wenzelm@30143
    36
fun opt_not f (c as (_, (ty, _))) =
wenzelm@38335
    37
  if is_some (f c) then NONE else SOME (Term.size_of_typ ty);
kleing@29884
    38
wenzelm@46979
    39
fun filter_const _ _ NONE = NONE
wenzelm@46979
    40
  | filter_const c f (SOME rank) =
wenzelm@31684
    41
      (case f c of
wenzelm@31684
    42
        NONE => NONE
wenzelm@46979
    43
      | SOME i => SOME (Int.min (rank, i)));
wenzelm@30143
    44
wenzelm@30143
    45
wenzelm@30143
    46
(* pretty results *)
kleing@29895
    47
kleing@29895
    48
fun pretty_criterion (b, c) =
kleing@29895
    49
  let
kleing@29895
    50
    fun prfx s = if b then s else "-" ^ s;
kleing@29895
    51
  in
kleing@29895
    52
    (case c of
kleing@29895
    53
      Strict pat => Pretty.str (prfx "strict: " ^ quote pat)
kleing@29895
    54
    | Loose pat => Pretty.str (prfx (quote pat))
kleing@29895
    55
    | Name name => Pretty.str (prfx "name: " ^ quote name))
kleing@29895
    56
  end;
kleing@29895
    57
wenzelm@30143
    58
fun pretty_const ctxt (nm, ty) =
wenzelm@30143
    59
  let
wenzelm@35845
    60
    val ty' = Logic.unvarifyT_global ty;
kleing@29895
    61
  in
wenzelm@30143
    62
    Pretty.block
wenzelm@38336
    63
     [Pretty.str nm, Pretty.str " ::", Pretty.brk 1,
wenzelm@30143
    64
      Pretty.quote (Syntax.pretty_typ ctxt ty')]
kleing@29895
    65
  end;
kleing@29895
    66
wenzelm@31684
    67
wenzelm@30143
    68
(* find_consts *)
wenzelm@30143
    69
wenzelm@30143
    70
fun find_consts ctxt raw_criteria =
wenzelm@30143
    71
  let
wenzelm@42360
    72
    val thy = Proof_Context.theory_of ctxt;
kleing@29884
    73
    val low_ranking = 10000;
kleing@29884
    74
wenzelm@33158
    75
    fun user_visible consts (nm, _) =
wenzelm@33158
    76
      if Consts.is_concealed consts nm then NONE else SOME low_ranking;
Timothy@30206
    77
Timothy@30207
    78
    fun make_pattern crit =
Timothy@30207
    79
      let
Timothy@30207
    80
        val raw_T = Syntax.parse_typ ctxt crit;
wenzelm@31684
    81
        val t =
wenzelm@31684
    82
          Syntax.check_term
wenzelm@42360
    83
            (Proof_Context.set_mode Proof_Context.mode_pattern ctxt)
wenzelm@31684
    84
            (Term.dummy_pattern raw_T);
Timothy@30207
    85
      in Term.type_of t end;
kleing@29884
    86
kleing@29884
    87
    fun make_match (Strict arg) =
kleing@29884
    88
          let val qty = make_pattern arg; in
wenzelm@30143
    89
            fn (_, (ty, _)) =>
wenzelm@30143
    90
              let
kleing@29884
    91
                val tye = Sign.typ_match thy (qty, ty) Vartab.empty;
wenzelm@31684
    92
                val sub_size =
wenzelm@31684
    93
                  Vartab.fold (fn (_, (_, t)) => fn n => Term.size_of_typ t + n) tye 0;
wenzelm@32790
    94
              in SOME sub_size end handle Type.TYPE_MATCH => NONE
kleing@29884
    95
          end
kleing@29884
    96
      | make_match (Loose arg) =
kleing@29884
    97
          check_const (matches_subtype thy (make_pattern arg) o snd)
kleing@29884
    98
      | make_match (Name arg) = check_const (match_string arg o fst);
kleing@29884
    99
kleing@29884
   100
    fun make_criterion (b, crit) = (if b then I else opt_not) (make_match crit);
Timothy@30206
   101
    val criteria = map make_criterion raw_criteria;
kleing@29884
   102
Timothy@30206
   103
    val consts = Sign.consts_of thy;
wenzelm@31684
   104
    val (_, consts_tab) = #constants (Consts.dest consts);
wenzelm@31684
   105
    fun eval_entry c =
wenzelm@46979
   106
      fold (filter_const c) (user_visible consts :: criteria) (SOME low_ranking);
kleing@29884
   107
wenzelm@30143
   108
    val matches =
wenzelm@46979
   109
      Symtab.fold (fn c => (case eval_entry c of NONE => I | SOME rank => cons (rank, c)))
wenzelm@46979
   110
        consts_tab []
wenzelm@46979
   111
      |> sort (prod_ord (rev_order o int_ord) (string_ord o pairself fst))
wenzelm@46979
   112
      |> map (apsnd fst o snd);
kleing@29884
   113
  in
wenzelm@38335
   114
    Pretty.big_list "searched for:" (map pretty_criterion raw_criteria) ::
wenzelm@38335
   115
    Pretty.str "" ::
wenzelm@38335
   116
    Pretty.str
wenzelm@38335
   117
     (if null matches
wenzelm@46716
   118
      then "nothing found"
wenzelm@46716
   119
      else "found " ^ string_of_int (length matches) ^ " constant(s):") ::
wenzelm@38335
   120
    Pretty.str "" ::
wenzelm@38335
   121
    map (pretty_const ctxt) matches
wenzelm@38335
   122
  end |> Pretty.chunks |> Pretty.writeln;
kleing@29884
   123
wenzelm@30142
   124
wenzelm@30143
   125
(* command syntax *)
wenzelm@30142
   126
wenzelm@38334
   127
local
wenzelm@30142
   128
wenzelm@30142
   129
val criterion =
wenzelm@36950
   130
  Parse.reserved "strict" |-- Parse.!!! (Parse.$$$ ":" |-- Parse.xname) >> Strict ||
wenzelm@36950
   131
  Parse.reserved "name" |-- Parse.!!! (Parse.$$$ ":" |-- Parse.xname) >> Name ||
wenzelm@36950
   132
  Parse.xname >> Loose;
wenzelm@30142
   133
wenzelm@38334
   134
in
wenzelm@38334
   135
wenzelm@30142
   136
val _ =
wenzelm@46961
   137
  Outer_Syntax.improper_command ("find_consts", Keyword.diag) "search constants by type pattern"
wenzelm@36950
   138
    (Scan.repeat ((Scan.option Parse.minus >> is_none) -- criterion)
wenzelm@38334
   139
      >> (fn spec => Toplevel.no_timing o
wenzelm@38334
   140
        Toplevel.keep (fn state => find_consts (Toplevel.context_of state) spec)));
wenzelm@30142
   141
kleing@29884
   142
end;
kleing@29884
   143
wenzelm@38334
   144
end;
wenzelm@38334
   145