299 |
299 |
300 * 'datatype' specifications allow explicit sort constraints. |
300 * 'datatype' specifications allow explicit sort constraints. |
301 |
301 |
302 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY, |
302 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY, |
303 use theory HOL/Library/Nat_Bijection instead. |
303 use theory HOL/Library/Nat_Bijection instead. |
|
304 |
|
305 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black trees is |
|
306 now inside the type class' local context. Names of affected operations and lemmas |
|
307 have been prefixed by rbt_. INCOMPATIBILITY for theories working directly with |
|
308 raw red-black trees, adapt the names as follows: |
|
309 |
|
310 Operations: |
|
311 bulkload -> rbt_bulkload |
|
312 del_from_left -> rbt_del_from_left |
|
313 del_from_right -> rbt_del_from_right |
|
314 del -> rbt_del |
|
315 delete -> rbt_delete |
|
316 ins -> rbt_ins |
|
317 insert -> rbt_insert |
|
318 insertw -> rbt_insert_with |
|
319 insert_with_key -> rbt_insert_with_key |
|
320 map_entry -> rbt_map_entry |
|
321 lookup -> rbt_lookup |
|
322 sorted -> rbt_sorted |
|
323 tree_greater -> rbt_greater |
|
324 tree_less -> rbt_less |
|
325 tree_less_symbol -> rbt_less_symbol |
|
326 union -> rbt_union |
|
327 union_with -> rbt_union_with |
|
328 union_with_key -> rbt_union_with_key |
|
329 |
|
330 Lemmas: |
|
331 balance_left_sorted -> balance_left_rbt_sorted |
|
332 balance_left_tree_greater -> balance_left_rbt_greater |
|
333 balance_left_tree_less -> balance_left_rbt_less |
|
334 balance_right_sorted -> balance_right_rbt_sorted |
|
335 balance_right_tree_greater -> balance_right_rbt_greater |
|
336 balance_right_tree_less -> balance_right_rbt_less |
|
337 balance_sorted -> balance_rbt_sorted |
|
338 balance_tree_greater -> balance_rbt_greater |
|
339 balance_tree_less -> balance_rbt_less |
|
340 bulkload_is_rbt -> rbt_bulkload_is_rbt |
|
341 combine_sorted -> combine_rbt_sorted |
|
342 combine_tree_greater -> combine_rbt_greater |
|
343 combine_tree_less -> combine_rbt_less |
|
344 delete_in_tree -> rbt_delete_in_tree |
|
345 delete_is_rbt -> rbt_delete_is_rbt |
|
346 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater |
|
347 del_from_left_tree_less -> rbt_del_from_left_rbt_less |
|
348 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater |
|
349 del_from_right_tree_less -> rbt_del_from_right_rbt_less |
|
350 del_in_tree -> rbt_del_in_tree |
|
351 del_inv1_inv2 -> rbt_del_inv1_inv2 |
|
352 del_sorted -> rbt_del_rbt_sorted |
|
353 del_tree_greater -> rbt_del_rbt_greater |
|
354 del_tree_less -> rbt_del_rbt_less |
|
355 dom_lookup_Branch -> dom_rbt_lookup_Branch |
|
356 entries_lookup -> entries_rbt_lookup |
|
357 finite_dom_lookup -> finite_dom_rbt_lookup |
|
358 insert_sorted -> rbt_insert_rbt_sorted |
|
359 insertw_is_rbt -> rbt_insertw_is_rbt |
|
360 insertwk_is_rbt -> rbt_insertwk_is_rbt |
|
361 insertwk_sorted -> rbt_insertwk_rbt_sorted |
|
362 insertw_sorted -> rbt_insertw_rbt_sorted |
|
363 ins_sorted -> ins_rbt_sorted |
|
364 ins_tree_greater -> ins_rbt_greater |
|
365 ins_tree_less -> ins_rbt_less |
|
366 is_rbt_sorted -> is_rbt_rbt_sorted |
|
367 lookup_balance -> rbt_lookup_balance |
|
368 lookup_bulkload -> rbt_lookup_rbt_bulkload |
|
369 lookup_delete -> rbt_lookup_rbt_delete |
|
370 lookup_Empty -> rbt_lookup_Empty |
|
371 lookup_from_in_tree -> rbt_lookup_from_in_tree |
|
372 lookup_in_tree -> rbt_lookup_in_tree |
|
373 lookup_ins -> rbt_lookup_ins |
|
374 lookup_insert -> rbt_lookup_rbt_insert |
|
375 lookup_insertw -> rbt_lookup_rbt_insertw |
|
376 lookup_insertwk -> rbt_lookup_rbt_insertwk |
|
377 lookup_keys -> rbt_lookup_keys |
|
378 lookup_map -> rbt_lookup_map |
|
379 lookup_map_entry -> rbt_lookup_rbt_map_entry |
|
380 lookup_tree_greater -> rbt_lookup_rbt_greater |
|
381 lookup_tree_less -> rbt_lookup_rbt_less |
|
382 lookup_union -> rbt_lookup_rbt_union |
|
383 map_entry_color_of -> rbt_map_entry_color_of |
|
384 map_entry_inv1 -> rbt_map_entry_inv1 |
|
385 map_entry_inv2 -> rbt_map_entry_inv2 |
|
386 map_entry_is_rbt -> rbt_map_entry_is_rbt |
|
387 map_entry_sorted -> rbt_map_entry_rbt_sorted |
|
388 map_entry_tree_greater -> rbt_map_entry_rbt_greater |
|
389 map_entry_tree_less -> rbt_map_entry_rbt_less |
|
390 map_tree_greater -> map_rbt_greater |
|
391 map_tree_less -> map_rbt_less |
|
392 map_sorted -> map_rbt_sorted |
|
393 paint_sorted -> paint_rbt_sorted |
|
394 paint_lookup -> paint_rbt_lookup |
|
395 paint_tree_greater -> paint_rbt_greater |
|
396 paint_tree_less -> paint_rbt_less |
|
397 sorted_entries -> rbt_sorted_entries |
|
398 tree_greater_eq_trans -> rbt_greater_eq_trans |
|
399 tree_greater_nit -> rbt_greater_nit |
|
400 tree_greater_prop -> rbt_greater_prop |
|
401 tree_greater_simps -> rbt_greater_simps |
|
402 tree_greater_trans -> rbt_greater_trans |
|
403 tree_less_eq_trans -> rbt_less_eq_trans |
|
404 tree_less_nit -> rbt_less_nit |
|
405 tree_less_prop -> rbt_less_prop |
|
406 tree_less_simps -> rbt_less_simps |
|
407 tree_less_trans -> rbt_less_trans |
|
408 tree_ord_props -> rbt_ord_props |
|
409 union_Branch -> rbt_union_Branch |
|
410 union_is_rbt -> rbt_union_is_rbt |
|
411 unionw_is_rbt -> rbt_unionw_is_rbt |
|
412 unionwk_is_rbt -> rbt_unionwk_is_rbt |
|
413 unionwk_sorted -> rbt_unionwk_rbt_sorted |
304 |
414 |
305 * Session HOL-Word: Discontinued many redundant theorems specific to |
415 * Session HOL-Word: Discontinued many redundant theorems specific to |
306 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems |
416 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems |
307 instead. |
417 instead. |
308 |
418 |