edge.leftEdge = left;
	private void addEdge( long offset, boolean left )	{		// drop the normalize result		sections = null;		// try to find the first segment will less that left		SegmentEdge edge = null;		ListIterator iter = edges.listIterator( edges.size( ) );		while ( iter.hasPrevious( ) )		{			SegmentEdge next = (SegmentEdge) iter.previous( );			if ( next.offset <= offset )			{				// insert it after the next				edge = new SegmentEdge( offset );				iter.next( );				iter.add( edge );				break;			}		}		if ( edge == null )		{			// insert it at the end of the list			edge = new SegmentEdge( offset );			edges.addFirst( edge );		}		edge.leftEdge = left;	}