# Conflicts:
#	.travis.yml

…7-bit Strings.

…Strings with unknown code ranges.

…kup.cache

…cases.

While this may have had value with ByteLists, it seems to just duplicate work for Ropes. Moreover, StringSupport.force_encoding is a slow-path helper, so we should avoid it on fast paths if possible.

ConstantLookupSite now handles all constant lookup cases:

* Lexical+hierarchical search in searchConst
* Hierarchical search in inheritanceSearchConst
* LexicalSearch in lexicalSearchConst (for defined?)

Up to now, all three forms would cache one recent constant and
replace that binding on invalidation. This is obviously slow
when there are more than one possible constant value (lookups in
different hierarchies, for example) so I have modified it to chain
a series of bindings. This chain is currently not limited, and
that should be fixed; but the current logic improves red/black by
around 12%.

This works for both field-based (reified) and array-based instance
variables. Performance of red/black improves by about 30% with
this change.

The logic here to bind initialize when calling the basic Class#new
is as follows:

* Filter the incoming self (the class we're newing) with the class
  allocator.
* Fold in a call site for the initialize method. This binds like
  a normal dynamic call with all appropriate guards.
* Return the self produced by the allocate call.

With this change, any Class#new call that uses the base new logic
should go directly via MethodHandles to the associated initialize
method, allowing everything to inline.