109 |
* and which are contiguous (the latter can be appended to the former). |
* and which are contiguous (the latter can be appended to the former). |
110 |
* This is necessary because coniguous spans MUST be appended before |
* This is necessary because coniguous spans MUST be appended before |
111 |
* saving, otherwise we'd generate lots of JUNK! |
* saving, otherwise we'd generate lots of JUNK! |
112 |
|
* <p> |
113 |
|
* Invariants which implementations MUST obey: ( XXX too harsh? ) |
114 |
|
* <ul> |
115 |
|
* <li> For any two enfilades with the same spans in the same |
116 |
|
* order (split or joined in any permissible way), this |
117 |
|
* method must return the same structure. This is so that |
118 |
|
* optimized() enfilades will have the same hash codes. |
119 |
|
* <li> The method must be idempotent (which naturally follows |
120 |
|
* from the previous point). |
121 |
|
* </ul> |
122 |
*/ |
*/ |
123 |
Enfilade1D optimized() ; |
Enfilade1D optimized() ; |
124 |
|
|