Open Source QR Code Library

I think we can use following:
else if (version >= 14 && version <= 20) {
logicalSeeds = new int[4];
logicalSeeds[0] = 6;
logicalSeeds[1] = 7 + 1 * version / 2;
logicalSeeds[2] = 9 + 2 * version / 2;
logicalSeeds[3] = 10 + 4 * version;
logicalCenters = new Point[logicalSeeds.length][logicalSeeds.length];
}
else if (version >= 21 && version <= 27) {
logicalSeeds = new int[5];
logicalSeeds[0] = 6;
logicalSeeds[1] = 7 + 1 * version;
logicalSeeds[2] = 8 + 2 * version;
logicalSeeds[3] = 9 + 3 * version;
logicalSeeds[4] = 10 + 4 * version;
logicalCenters = new Point[logicalSeeds.length][logicalSeeds.length];
}

But we still need the correct cal for getCenter
Do you know some number for ver >= 28? If we know what it should be, maybe we can fihure out the formula

If we can't find a regular formula, at least we can find a regular... array !

I suggest we used an array containing all the values.

It's fast, it's reliable, it doesn't waste much memory and it allows us to use the same code for all versions.
It just needs patience to write the table... and I already did it.

Something like that :


package jp.sourceforge.qrcode.codec.reader.pattern;

public class LogicalSeed
{

public static int[][] seed;

{
seed=new int[40][];
seed[0] = new int[] { 6 };
seed[1] = new int[] { 6, 18 };
seed[2] = new int[] { 6, 22 };
seed[3] = new int[] { 6, 26 };
seed[4] = new int[] { 6, 30 };
seed[5] = new int[] { 6, 34 };
seed[6] = new int[] { 6, 22, 38 };
seed[7] = new int[] { 6, 24, 42 };
seed[8] = new int[] { 6, 26, 46 };
seed[9] = new int[] { 6, 28, 50 };
seed[10] = new int[] { 6, 30, 54 };
seed[11] = new int[] { 6, 32, 58 };
seed[12] = new int[] { 6, 34, 62 };
seed[13] = new int[] { 6, 26, 46, 66 };
seed[14] = new int[] { 6, 26, 48, 70 };
seed[15] = new int[] { 6, 26, 50, 74 };
seed[16] = new int[] { 6, 30, 54, 78 };
seed[17] = new int[] { 6, 30, 56, 82 };
seed[18] = new int[] { 6, 30, 58, 86 };
seed[19] = new int[] { 6, 34, 62, 90 };
seed[20] = new int[] { 6, 28, 50, 72, 94 };
seed[21] = new int[] { 6, 26, 50, 74, 98 };
seed[22] = new int[] { 6, 30, 54, 78, 102 };
seed[23] = new int[] { 6, 28, 54, 80, 106 };
seed[24] = new int[] { 6, 32, 58, 84, 110 };
seed[25] = new int[] { 6, 30, 58, 86, 114 };
seed[26] = new int[] { 6, 34, 62, 90, 118 };
seed[27] = new int[] { 6, 26, 50, 74, 98, 122 };
seed[28] = new int[] { 6, 30, 54, 78, 102, 126 };
seed[29] = new int[] { 6, 26, 52, 78, 104, 130 };
seed[30] = new int[] { 6, 30, 56, 82, 108, 134 };
seed[31] = new int[] { 6, 34, 60, 86, 112, 138 };
seed[32] = new int[] { 6, 30, 58, 86, 114, 142 };
seed[33] = new int[] { 6, 34, 62, 90, 118, 146 };
seed[34] = new int[] { 6, 30, 54, 78, 102, 126, 150 };
seed[35] = new int[] { 6, 24, 50, 75, 102, 128, 154 };
seed[36] = new int[] { 6, 28, 54, 80, 106, 132, 158 };
seed[37] = new int[] { 6, 32, 58, 84, 110, 136, 162 };
seed[38] = new int[] { 6, 26, 54, 82, 110, 138, 166 };
seed[39] = new int[] { 6, 30, 58, 86, 114, 142, 170 };
}
}


Regards,
Benjamin.