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