- Timestamp:
- Jun 29, 2016, 3:11:11 PM (9 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, ctor, deferred_resn, demangler, enum, forall-pointer-decay, gc_noraii, jacob/cs343-translation, jenkins-sandbox, master, memory, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc
- Children:
- 89b686a
- Parents:
- 66999e7
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/working/resolver_design.md
r66999e7 r59f9273 1414 1414 considered if no match was found in the previous class. 1415 1415 1416 Another source of efficiency would be to cache the best given interpretation 1417 of a subexpression within an environment; this may not be incredibly useful 1418 for explict parameters (though it may be useful for, e.g. `f( x, x )`, where 1419 both parameters of `f` have the same type), but should pay some dividends for 1420 the implicit assertion parameters, especially the otype parameters for the 1421 argument of a generic type, which will generally be resolved in duplicate for 1422 (at least) the assignment operator, constructor, copy constructor & destructor 1423 of the generic type. 1424 1416 1425 ## Appendix A: Partial and Total Orders ## 1417 1426 The `<=` relation on integers is a commonly known _total order_, and
Note: See TracChangeset
for help on using the changeset viewer.