public CodeMap8 set(final int index, final int value) {
		final int i0 = index >>> 28;
		int[][][][][][][] map1 = map[i0];
		if (map1 == null)
			map[i0] = map1 = new int[MAX_INDEX][][][][][][];

		final int i1 = (index >>> 24) & 0xf;
		int[][][][][][] map2 = map1[i1];
		if (map2 == null)
			map1[i1] = map2 = new int[MAX_INDEX][][][][][];

		final int i2 = (index >>> 20) & 0xf;
		int[][][][][] map3 = map2[i2];
		if (map3 == null)
			map2[i2] = map3 = new int[MAX_INDEX][][][][];

		final int i3 = (index >>> 16) & 0xf;
		int[][][][] map4 = map3[i3];
		if (map4 == null)
			map3[i3] = map4 = new int[MAX_INDEX][][][];

		final int i4 = (index >>> 12) & 0xf;
		int[][][] map5 = map4[i4];
		if (map5 == null)
			map4[i4] = map5 = new int[MAX_INDEX][][];

		final int i5 = (index >>> 8) & 0xf;
		int[][] map6 = map5[i5];
		if (map6 == null)
			map5[i5] = map6 = new int[MAX_INDEX][];

		final int i6 = (index >>> 4) & 0xf;
		int[] map7 = map6[i6];
		if (map7 == null) {
			map6[i6] = map7 = new int[MAX_INDEX];
			for (int i = 0; i < MAX_INDEX; ++i)
				map7[i] = NOT_FOUND;
		}

		map7[index & 0xf] = value;
		return this;
	}