<?xml version="1.0" encoding="utf-8"?>
<manifest xmlns:android="http://schemas.android.com/apk/res/android"
- package="com.google.zxing.client.android">
-
<application android:icon="@drawable/icon">
-
<activity class=".BarcodeReaderCaptureActivity" android:label="@string/app_name">
- <intent-filter>
- <action android:value="android.intent.action.MAIN" />
- <category android:value="android.intent.category.LAUNCHER" />
- </intent-filter>
- </activity>
- </application>
- <uses-permission id="android.permission.READ_CONTACTS" />
- <uses-permission id="android.permission.WRITE_CONTACTS" />
+ package="com.google.zxing.client.android">
+ <application android:icon="@drawable/icon">
+ <activity class=".BarcodeReaderCaptureActivity" android:label="@string/app_name">
+ <intent-filter>
+ <action android:value="android.intent.action.MAIN"/>
+ <category android:value="android.intent.category.LAUNCHER"/>
+ </intent-filter>
+ </activity>
+ </application>
+ <uses-permission id="android.permission.READ_CONTACTS"/>
+ <uses-permission id="android.permission.WRITE_CONTACTS"/>
</manifest>
\ No newline at end of file
</not>
</condition>
</fail>
- <fail message="Please build 'core' first">
+ <fail message="Please build 'core' first">
<condition>
<not>
<available file="../core/core.jar" type="file"/>
<?xml version="1.0" encoding="utf-8"?>
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
- android:orientation="vertical"
- android:layout_width="fill_parent"
- android:layout_height="fill_parent"
+ android:orientation="vertical"
+ android:layout_width="fill_parent"
+ android:layout_height="fill_parent"
>
</LinearLayout>
<?xml version="1.0" encoding="utf-8"?>
<resources>
<string name="app_name">Barcode Reader</string>
- <string name="button_no">No</string>
+ <string name="button_no">No</string>
<string name="button_ok">OK</string>
<string name="button_yes">Yes</string>
<string name="menu_about">About...</string>
/**
* The barcode reader activity itself. This is loosely based on the CameraPreview
* example included in the Android SDK.
- *
+ *
* @author dswitkin@google.com (Daniel Switkin)
* @author Android Team (for CameraPreview example)
*/
public final class BarcodeReaderCaptureActivity extends Activity {
-
+
private CameraManager cameraManager;
private CameraSurfaceView surfaceView;
private WorkerThread workerThread;
-
+
private static final int ABOUT_ID = Menu.FIRST;
-
+
@Override
public void onCreate(Bundle icicle) {
super.onCreate(icicle);
workerThread.requestPreviewLoop();
workerThread.start();
}
-
+
@Override
protected boolean isFullscreenOpaque() {
// Our main window is set to translucent, but we know that we will
return super.onKeyDown(keyCode, event);
}
}
-
+
@Override
public boolean onCreateOptionsMenu(Menu menu) {
- super.onCreateOptionsMenu(menu);
- menu.add(0, ABOUT_ID, R.string.menu_about);
- return true;
+ super.onCreateOptionsMenu(menu);
+ menu.add(0, ABOUT_ID, R.string.menu_about);
+ return true;
}
-
+
@Override
public boolean onOptionsItemSelected(Menu.Item item) {
switch (item.getId()) {
context.getString(R.string.msg_about),
context.getString(R.string.button_ok), null, true, null);
break;
- }
- return super.onOptionsItemSelected(item);
+ }
+ return super.onOptionsItemSelected(item);
}
-
- Handler messageHandler = new Handler() {
+
+ private final Handler messageHandler = new Handler() {
@Override
public void handleMessage(Message message) {
switch (message.what) {
- case R.id.decoding_succeeded_message:
- handleDecode((Result)message.obj);
- break;
- case R.id.decoding_failed_message:
- Context context = getApplication();
- showAlert(context.getString(R.string.title_no_barcode_detected),
- context.getString(R.string.msg_no_barcode_detected),
- context.getString(R.string.button_ok), null, true, null);
- break;
+ case R.id.decoding_succeeded_message:
+ handleDecode((Result) message.obj);
+ break;
+ case R.id.decoding_failed_message:
+ Context context = getApplication();
+ showAlert(context.getString(R.string.title_no_barcode_detected),
+ context.getString(R.string.msg_no_barcode_detected),
+ context.getString(R.string.button_ok), null, true, null);
+ break;
}
}
};
-
+
public void restartPreview() {
workerThread.requestPreviewLoop();
}
-
+
// TODO(dswitkin): These deprecated showAlert calls need to be updated.
private void handleDecode(Result rawResult) {
ResultPoint[] points = rawResult.getResultPoints();
return R.string.title_barcode_detected;
}
}
-
+
}
\ No newline at end of file
package com.google.zxing.client.android;
-import com.google.zxing.ResultPoint;
-
import android.content.Context;
import android.graphics.Bitmap;
import android.graphics.Canvas;
import android.util.Log;
import android.view.Display;
import android.view.WindowManager;
+import com.google.zxing.ResultPoint;
/**
* This object wraps the CameraDevice and expects to be the only one talking to it. The
* implementation encapsulates the steps needed to take preview-sized images and well as high
* resolution stills.
- *
+ *
* @author dswitkin@google.com (Daniel Switkin)
*/
final class CameraManager {
-
+
private static final String TAG = "CameraManager";
-
+
private Context context;
private Point cameraResolution;
private Point stillResolution;
private CameraDevice camera;
private CameraDevice.CaptureParams params;
private boolean previewMode;
-
+
CameraManager(Context context) {
this.context = context;
calculateStillResolution();
previewMode = false;
setPreviewMode(true);
}
-
+
public void openDriver() {
if (camera == null) {
camera = CameraDevice.open();
}
}
-
+
public void closeDriver() {
if (camera != null) {
camera.close();
camera = null;
}
}
-
+
public void capturePreview(Canvas canvas) {
setPreviewMode(true);
camera.capture(canvas);
}
-
+
public Bitmap captureStill() {
setPreviewMode(false);
Canvas canvas = new Canvas(bitmap);
camera.capture(canvas);
return bitmap;
}
-
+
/**
* Calculates the framing rect which the UI should draw to show the user where to place the
* barcode. The actual captured image should be a bit larger than indicated because they might
* frame the shot too tightly. This target helps with alignment as well as forces the user to hold
* the device far enough away to ensure the image will be in focus.
- *
+ *
* @return The rectangle to draw on screen in window coordinates.
*/
public Rect getFramingRect() {
}
return framingRect;
}
-
+
/**
* Converts the result points from still resolution coordinates to screen coordinates.
- *
+ *
* @param points The points returned by the Reader subclass through Result.getResultPoints().
* @return An array of Points scaled to the size of the framing rect and offset appropriately
* so they can be drawn in screen coordinates.
Point[] output = new Point[count];
for (int x = 0; x < count; x++) {
output[x] = new Point();
- output[x].x = frame.left + (int)(points[x].getX() * frameSize / stillResolution.x + 0.5f);
- output[x].y = frame.top + (int)(points[x].getY() * frameSize / stillResolution.y + 0.5f);
+ output[x].x = frame.left + (int) (points[x].getX() * frameSize / stillResolution.x + 0.5f);
+ output[x].y = frame.top + (int) (points[x].getY() * frameSize / stillResolution.y + 0.5f);
}
return output;
}
-
+
/**
* Images for the live preview are taken at low resolution in RGB. The final stills for the
* decoding step are taken in YUV, since we only need the luminance channel. Other code depends
* on the ability to call this method for free if the correct mode is already set.
- *
+ *
* @param on Setting on true will engage preview mode, setting it false will request still mode.
*/
private void setPreviewMode(boolean on) {
if (on != previewMode) {
if (on) {
params.type = 1; // preview
- if (cameraResolution.x / (float)cameraResolution.y <
- screenResolution.x / (float)screenResolution.y) {
+ if (cameraResolution.x / (float) cameraResolution.y <
+ screenResolution.x / (float) screenResolution.y) {
params.srcWidth = cameraResolution.x;
params.srcHeight = cameraResolution.x * screenResolution.y / screenResolution.x;
params.leftPixel = 0;
previewMode = on;
}
}
-
+
/**
* This method determines how to take the highest quality image (i.e. the one which has the best
* chance of being decoded) given the capabilities of the camera. It is a balancing act between
cameraResolution = getMaximumCameraResolution();
int minDimension = (cameraResolution.x < cameraResolution.y) ? cameraResolution.x :
cameraResolution.y;
- int diagonalResolution = (int)Math.sqrt(cameraResolution.x * cameraResolution.x +
+ int diagonalResolution = (int) Math.sqrt(cameraResolution.x * cameraResolution.x +
cameraResolution.y * cameraResolution.y);
float diagonalFov = getFieldOfView();
-
+
// Determine the field of view in the smaller dimension, then calculate how large an object
// would be at the minimum focus distance.
float fov = diagonalFov * minDimension / diagonalResolution;
double objectSize = Math.tan(Math.toRadians(fov / 2.0)) * getMinimumFocusDistance() * 2;
-
+
// Let's assume the largest barcode we might photograph at this distance is 3 inches across. By
// cropping to this size, we can avoid processing surrounding pixels, which helps with speed and
// accuracy.
// TODO(dswitkin): Handle a device with a great macro mode where objectSize < 4 inches.
double crop = 3.0 / objectSize;
- int nativeResolution = (int)(minDimension * crop);
-
+ int nativeResolution = (int) (minDimension * crop);
+
// The camera driver can only capture images which are a multiple of eight, so it's necessary to
// round up.
nativeResolution = (nativeResolution + 7) / 8 * 8;
if (nativeResolution > minDimension) {
nativeResolution = minDimension;
}
-
+
// There's no point in capturing too much detail, so ask the driver to downsample. I haven't
// tried a non-integer multiple, but it seems unlikely to work.
double dpi = nativeResolution / objectSize;
stillMultiplier = 1;
if (dpi > 200) {
- stillMultiplier = (int)(dpi / 200 + 1);
+ stillMultiplier = (int) (dpi / 200 + 1);
}
stillResolution = new Point(nativeResolution, nativeResolution);
Log.v(TAG, "FOV " + fov + " objectSize " + objectSize + " crop " + crop + " dpi " + dpi +
" nativeResolution " + nativeResolution + " stillMultiplier " + stillMultiplier);
}
-
+
// FIXME(dswitkin): These three methods have temporary constants until the new Camera API can
// provide the real values for the current device.
// Temporary: the camera's maximum resolution in pixels.
private static Point getMaximumCameraResolution() {
return new Point(1280, 1024);
}
-
+
// Temporary: the diagonal field of view in degrees.
private static float getFieldOfView() {
return 60.0f;
}
-
+
// Temporary: the minimum focus distance in inches.
private static float getMinimumFocusDistance() {
return 12.0f;
}
-
+
private Point getScreenResolution() {
if (screenResolution == null) {
- WindowManager manager = (WindowManager)context.getSystemService(Context.WINDOW_SERVICE);
+ WindowManager manager = (WindowManager) context.getSystemService(Context.WINDOW_SERVICE);
Display display = manager.getDefaultDisplay();
screenResolution = new Point(display.getWidth(), display.getHeight());
}
return screenResolution;
}
-
+
}
package com.google.zxing.client.android;
-import com.google.zxing.ResultPoint;
-
import android.content.Context;
import android.graphics.Canvas;
import android.graphics.Color;
import android.graphics.Rect;
import android.view.SurfaceHolder;
import android.view.SurfaceView;
+import com.google.zxing.ResultPoint;
/**
* @author dswitkin@google.com (Daniel Switkin)
*/
final class CameraSurfaceView extends SurfaceView implements SurfaceHolder.Callback {
- private static int[] SCANNER_ALPHA = { 0, 64, 128, 192, 255, 192, 128, 64 };
-
+ private static int[] SCANNER_ALPHA = {0, 64, 128, 192, 255, 192, 128, 64};
+
private CameraManager cameraManager;
private SurfaceHolder surfaceHolder;
private boolean hasSurface;
private int scannerAlpha;
-
- CameraSurfaceView(Context context, CameraManager cameraManager) {
- super(context);
- this.cameraManager = cameraManager;
-
- // Install a SurfaceHolder.Callback so we get notified when the underlying surface is created
- // and destroyed.
- surfaceHolder = getHolder();
- surfaceHolder.setCallback(this);
- hasSurface = false;
- scannerAlpha = 0;
-
- // FIXME(dswitkin): This resolution needs to be made dynamic to handle different devices and
- // orientations.
- surfaceHolder.setFixedSize(320, 240);
- }
- public boolean surfaceCreated(SurfaceHolder holder) {
- hasSurface = true;
+ CameraSurfaceView(Context context, CameraManager cameraManager) {
+ super(context);
+ this.cameraManager = cameraManager;
- // Tell the system that we filled the surface in this call. This is a lie to prevent the system
- // from filling the surface for us automatically. THIS IS REQUIRED because otherwise we'll
- // access the Surface object from 2 different threads which is not allowed.
- return true;
- }
+ // Install a SurfaceHolder.Callback so we get notified when the underlying surface is created
+ // and destroyed.
+ surfaceHolder = getHolder();
+ surfaceHolder.setCallback(this);
+ hasSurface = false;
+ scannerAlpha = 0;
- public void surfaceDestroyed(SurfaceHolder holder) {
- // FIXME(dswitkin): The docs say this surface will be destroyed when this method returns. In
- // practice this has not been a problem so far. I need to investigate.
- hasSurface = false;
- }
+ // FIXME(dswitkin): This resolution needs to be made dynamic to handle different devices and
+ // orientations.
+ surfaceHolder.setFixedSize(320, 240);
+ }
- public void surfaceChanged(SurfaceHolder holder, int format, int w, int h) {
- // Surface size or format has changed. This won't happen because of the setFixedSize() call.
- }
-
- /**
- * This method is only called from the WorkerThread. It's job is to grab the next preview frame
- * from the camera, draw the framing rectangle, and blit everything to the screen.
- */
- public void capturePreviewAndDraw() {
+ public boolean surfaceCreated(SurfaceHolder holder) {
+ hasSurface = true;
+
+ // Tell the system that we filled the surface in this call. This is a lie to prevent the system
+ // from filling the surface for us automatically. THIS IS REQUIRED because otherwise we'll
+ // access the Surface object from 2 different threads which is not allowed.
+ return true;
+ }
+
+ public void surfaceDestroyed(SurfaceHolder holder) {
+ // FIXME(dswitkin): The docs say this surface will be destroyed when this method returns. In
+ // practice this has not been a problem so far. I need to investigate.
+ hasSurface = false;
+ }
+
+ public void surfaceChanged(SurfaceHolder holder, int format, int w, int h) {
+ // Surface size or format has changed. This won't happen because of the setFixedSize() call.
+ }
+
+ /**
+ * This method is only called from the WorkerThread. It's job is to grab the next preview frame
+ * from the camera, draw the framing rectangle, and blit everything to the screen.
+ */
+ public void capturePreviewAndDraw() {
if (hasSurface) {
Canvas canvas = surfaceHolder.lockCanvas();
cameraManager.capturePreview(canvas);
Rect frame = cameraManager.getFramingRect();
int width = canvas.getBitmapWidth();
int height = canvas.getBitmapHeight();
-
+
// Draw the exterior (i.e. outside the framing rect) as half darkened
Paint paint = new Paint();
paint.setColor(Color.BLACK);
canvas.drawRect(box, paint);
box.set(0, frame.bottom + 1, width, height);
canvas.drawRect(box, paint);
-
+
// Draw a two pixel solid black border inside the framing rect
paint.setAlpha(255);
box.set(frame.left, frame.top, frame.right + 1, frame.top + 2);
canvas.drawRect(box, paint);
box.set(frame.left, frame.bottom - 1, frame.right + 1, frame.bottom + 1);
canvas.drawRect(box, paint);
-
+
// Draw a red "laser scanner" line through the middle
paint.setColor(Color.RED);
paint.setAlpha(SCANNER_ALPHA[scannerAlpha]);
int middle = frame.height() / 2 + frame.top;
box.set(frame.left + 2, middle - 1, frame.right - 1, middle + 2);
canvas.drawRect(box, paint);
-
+
surfaceHolder.unlockCanvasAndPost(canvas);
-
+
// This cheap animation is tied to the rate at which we pull previews from the camera.
scannerAlpha = (scannerAlpha + 1) % SCANNER_ALPHA.length;
}
- }
-
- /**
- * Draw a line for 1D barcodes (which return two points) or otherwise a set of points returned
- * from the decoder to indicate what we found.
- * TODO(dswitkin): It might be nice to clear the framing rect and zoom in on the actual still that
- * was captured, then paint the green points on it. This would also clear the red scanner line
- * which doesn't make sense after the capture.
- *
- * @param resultPoints An array of points from the decoder, whose coordinates are expressed
- * relative to the still image from the camera.
- */
- public void drawResultPoints(ResultPoint[] resultPoints) {
+ }
+
+ /**
+ * Draw a line for 1D barcodes (which return two points) or otherwise a set of points returned
+ * from the decoder to indicate what we found.
+ * TODO(dswitkin): It might be nice to clear the framing rect and zoom in on the actual still that
+ * was captured, then paint the green points on it. This would also clear the red scanner line
+ * which doesn't make sense after the capture.
+ *
+ * @param resultPoints An array of points from the decoder, whose coordinates are expressed
+ * relative to the still image from the camera.
+ */
+ public void drawResultPoints(ResultPoint[] resultPoints) {
if (hasSurface) {
Canvas canvas = surfaceHolder.lockCanvas();
Paint paint = new Paint();
paint.setColor(Color.GREEN);
paint.setAlpha(128);
-
+
Point[] points = cameraManager.convertResultPoints(resultPoints);
if (points.length == 2) {
paint.setStrokeWidth(4);
canvas.drawPoint(points[x].x, points[x].y, paint);
}
}
-
+
surfaceHolder.unlockCanvasAndPost(canvas);
}
}
Intent intent = null;
ParsedReaderResultType type = result.getType();
if (type == ParsedReaderResultType.ADDRESSBOOK) {
- AddressBookDoCoMoResult addressResult = (AddressBookDoCoMoResult)result;
+ AddressBookDoCoMoResult addressResult = (AddressBookDoCoMoResult) result;
intent = new Intent(Contacts.Intents.Insert.ACTION, Contacts.People.CONTENT_URI);
putExtra(intent, Contacts.Intents.Insert.NAME, addressResult.getName());
putExtra(intent, Contacts.Intents.Insert.PHONE, addressResult.getPhoneNumbers()[0]);
// For now, we can only open the browser, and not actually add a bookmark
try {
intent = new Intent(Intent.VIEW_ACTION,
- new ContentURI(((BookmarkDoCoMoResult)result).getURI()));
+ new ContentURI(((BookmarkDoCoMoResult) result).getURI()));
} catch (URISyntaxException e) {
return;
}
} else if (type == ParsedReaderResultType.EMAIL) {
- EmailDoCoMoResult emailResult = (EmailDoCoMoResult)result;
+ EmailDoCoMoResult emailResult = (EmailDoCoMoResult) result;
try {
intent = new Intent(Intent.SENDTO_ACTION, new ContentURI(emailResult.getTo()));
} catch (URISyntaxException e) {
putExtra(intent, "subject", emailResult.getSubject());
putExtra(intent, "body", emailResult.getBody());
} else if (type == ParsedReaderResultType.EMAIL_ADDRESS) {
- EmailAddressResult emailResult = (EmailAddressResult)result;
+ EmailAddressResult emailResult = (EmailAddressResult) result;
try {
intent = new Intent(Intent.SENDTO_ACTION, new ContentURI(emailResult.getEmailAddress()));
} catch (URISyntaxException e) {
return;
}
} else if (type == ParsedReaderResultType.UPC) {
- UPCParsedResult upcResult = (UPCParsedResult)result;
+ UPCParsedResult upcResult = (UPCParsedResult) result;
try {
ContentURI uri = new ContentURI("http://www.upcdatabase.com/item.asp?upc=" +
upcResult.getUPC());
return;
}
} else if (type == ParsedReaderResultType.URI) {
- URIParsedResult uriResult = (URIParsedResult)result;
+ URIParsedResult uriResult = (URIParsedResult) result;
try {
intent = new Intent(Intent.VIEW_ACTION, new ContentURI(uriResult.getURI()));
} catch (URISyntaxException e) {
package com.google.zxing.client.android;
+import android.graphics.Bitmap;
+import android.os.Handler;
+import android.os.Message;
import com.google.zxing.MonochromeBitmapSource;
import com.google.zxing.MultiFormatReader;
import com.google.zxing.ReaderException;
import com.google.zxing.Result;
-import android.graphics.Bitmap;
-import android.os.Handler;
-import android.os.Message;
-
/**
* This thread does all the heavy lifting, both during preview and for the final capture and
* decoding. That leaves the main thread free to handle UI tasks.
- *
+ *
* @author dswitkin@google.com (Daniel Switkin)
*/
final class WorkerThread extends Thread {
-
+
private CameraSurfaceView surfaceView;
private CameraManager cameraManager;
private Handler handler;
+
private enum State {
IDLE,
PREVIEW_LOOP,
STILL_AND_DECODE,
DONE
}
+
private State state;
-
+
WorkerThread(CameraSurfaceView surfaceView, CameraManager cameraManager, Handler handler) {
this.surfaceView = surfaceView;
this.cameraManager = cameraManager;
this.handler = handler;
state = State.IDLE;
}
-
+
@Override
public void run() {
while (true) {
case IDLE:
try {
sleep(50);
- } catch (InterruptedException e) { }
+ } catch (InterruptedException e) {
+ }
break;
case PREVIEW_LOOP:
surfaceView.capturePreviewAndDraw();
}
}
}
-
+
public void requestPreviewLoop() {
state = State.PREVIEW_LOOP;
}
-
+
public void requestStillAndDecode() {
state = State.STILL_AND_DECODE;
}
-
+
public void requestExitAndWait() {
state = State.DONE;
try {
} catch (InterruptedException e) {
}
}
-
+
}
package com.google.zxing.client.android;
-import com.google.zxing.MonochromeBitmapSource;
+import android.graphics.Bitmap;
import com.google.zxing.BlackPointEstimationMethod;
+import com.google.zxing.MonochromeBitmapSource;
import com.google.zxing.common.BitArray;
import com.google.zxing.common.BlackPointEstimator;
-import android.graphics.Bitmap;
-
/**
* This object implements MonochromeBitmapSource around an Android Bitmap. Rather than capturing an
* RGB image and calculating the grey value at each pixel, we ask the camera driver for YUV data and
* strip out the luminance channel directly. This should be faster but provides fewer bits, i.e.
* fewer grey levels.
- *
+ *
* @author dswitkin@google.com (Daniel Switkin)
* @author srowen@google.com (Sean Owen)
*/
private int blackPoint;
private BlackPointEstimationMethod lastMethod;
private int lastArgument;
-
+
private static final int LUMINANCE_BITS = 5;
private static final int LUMINANCE_SHIFT = 8 - LUMINANCE_BITS;
private static final int LUMINANCE_BUCKETS = 1 << LUMINANCE_BITS;
<ant dir="javame" target="build"/>
<ant dir="javase" target="build"/>
</target>
-
- <target name="buildwithoutj2me">
-
<ant dir="core" target="build"/>
-
<ant dir="javase" target="build"/>
- </target>
+
+ <target name="buildwithoutj2me">
+ <ant dir="core" target="build"/>
+ <ant dir="javase" target="build"/>
+ </target>
<target name="clean">
<ant dir="core" target="clean"/>
<target name="javadoc">
<mkdir dir="docs/javadoc"/>
- <javadoc destdir="docs/javadoc" footer="<script src="http://www.google-analytics.com/urchin.js" type="text/javascript"></script><script type="text/javascript">_uacct = "UA-788492-5"; urchinTracker();</script>">
+ <javadoc destdir="docs/javadoc"
+ footer="<script src="http://www.google-analytics.com/urchin.js" type="text/javascript"></script><script type="text/javascript">_uacct = "UA-788492-5"; urchinTracker();</script>">
<sourcepath>
<pathelement location="core/src"/>
<pathelement location="javame/src"/>
<pathelement location="${WTK-home}/lib/cldcapi11.jar"/>
<pathelement location="${WTK-home}/lib/midpapi20.jar"/>
<pathelement location="${WTK-home}/lib/mmapi.jar"/>
- <pathelement location="${WTK-home}/lib/jsr234.jar"/>
+ <pathelement location="${WTK-home}/lib/jsr234.jar"/>
</classpath>
</javadoc>
</target>
<batchtest>
<fileset dir="test/src">
<include name="**/*TestCase.java"/>
- <exclude name="com/google/zxing/common/AbstractBlackBoxTestCase.java"/>
+ <exclude name="com/google/zxing/common/AbstractBlackBoxTestCase.java"/>
</fileset>
</batchtest>
</junit>
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0//EN">
<HTML>
<HEAD>
-<TITLE>Common Public License - v 1.0</TITLE>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+ <TITLE>Common Public License - v 1.0</TITLE>
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
</HEAD>
<BODY BGCOLOR="#FFFFFF" VLINK="#800000">
<P ALIGN="CENTER"><B>Common Public License - v 1.0</B>
+
<P><B></B><FONT SIZE="3"></FONT>
-<P><FONT SIZE="3"></FONT><FONT SIZE="2">THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS COMMON PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.</FONT>
+
+<P><FONT SIZE="3"></FONT><FONT SIZE="2">THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS COMMON PUBLIC
+ LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS
+ AGREEMENT.</FONT>
+
<P><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2"><B>1. DEFINITIONS</B></FONT>
+
+<P><FONT SIZE="2"><B>1. DEFINITIONS</B></FONT>
+
<P><FONT SIZE="2">"Contribution" means:</FONT>
-<UL><FONT SIZE="2">a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and<BR CLEAR="LEFT">
-b) in the case of each subsequent Contributor:</FONT></UL>
+<UL><FONT SIZE="2">a) in the case of the initial Contributor, the initial code and documentation distributed under this
+ Agreement, and<BR CLEAR="LEFT">
+ b) in the case of each subsequent Contributor:</FONT></UL>
-<UL><FONT SIZE="2">i) changes to the Program, and</FONT></UL>
+<UL><FONT SIZE="2">i) changes to the Program, and</FONT></UL>
-<UL><FONT SIZE="2">ii) additions to the Program;</FONT></UL>
+<UL><FONT SIZE="2">ii) additions to the Program;</FONT></UL>
-<UL><FONT SIZE="2">where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. </FONT><FONT SIZE="2">A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. </FONT><FONT SIZE="2">Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. </FONT></UL>
+<UL><FONT SIZE="2">where such changes and/or additions to the Program originate from and are distributed by that
+ particular Contributor. </FONT><FONT SIZE="2">A Contribution 'originates' from a Contributor if it was added to the
+ Program by such Contributor itself or anyone acting on such Contributor's behalf. </FONT><FONT SIZE="2">Contributions
+ do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with
+ the Program under their own license agreement, and (ii) are not derivative works of the Program. </FONT></UL>
<P><FONT SIZE="2"></FONT>
+
<P><FONT SIZE="2">"Contributor" means any person or entity that distributes the Program.</FONT>
+
<P><FONT SIZE="2"></FONT><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2">"Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. </FONT>
+
+<P><FONT SIZE="2">"Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by
+ the use or sale of its Contribution alone or when combined with the Program. </FONT>
+
<P><FONT SIZE="2"></FONT><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2"></FONT><FONT SIZE="2">"Program" means the Contributions distributed in accordance with this Agreement.</FONT>
+
+<P><FONT SIZE="2"></FONT><FONT SIZE="2">"Program" means the Contributions distributed in accordance with this
+ Agreement.</FONT>
+
<P><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2">"Recipient" means anyone who receives the Program under this Agreement, including all Contributors.</FONT>
+
+<P><FONT SIZE="2">"Recipient" means anyone who receives the Program under this Agreement, including all
+ Contributors.</FONT>
+
<P><FONT SIZE="2"><B></B></FONT>
-<P><FONT SIZE="2"><B>2. GRANT OF RIGHTS</B></FONT>
-<UL><FONT SIZE="2"></FONT><FONT SIZE="2">a) </FONT><FONT SIZE="2">Subject to the terms of this Agreement, each Contributor hereby grants</FONT><FONT SIZE="2"> Recipient a non-exclusive, worldwide, royalty-free copyright license to</FONT><FONT SIZE="2" COLOR="#FF0000"> </FONT><FONT SIZE="2">reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form.</FONT></UL>
+<P><FONT SIZE="2"><B>2. GRANT OF RIGHTS</B></FONT>
+
+<UL><FONT SIZE="2"></FONT><FONT SIZE="2">a) </FONT><FONT SIZE="2">Subject to the terms of this Agreement, each
+ Contributor hereby grants</FONT><FONT SIZE="2"> Recipient a non-exclusive, worldwide, royalty-free copyright license
+ to</FONT><FONT SIZE="2" COLOR="#FF0000"> </FONT><FONT SIZE="2">reproduce, prepare derivative works of, publicly
+ display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative
+ works, in source code and object code form.</FONT></UL>
<UL><FONT SIZE="2"></FONT></UL>
-<UL><FONT SIZE="2"></FONT><FONT SIZE="2">b) Subject to the terms of this Agreement, each Contributor hereby grants </FONT><FONT SIZE="2">Recipient a non-exclusive, worldwide,</FONT><FONT SIZE="2" COLOR="#008000"> </FONT><FONT SIZE="2">royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. </FONT></UL>
+<UL><FONT SIZE="2"></FONT><FONT SIZE="2">b) Subject to the terms of this Agreement, each Contributor hereby
+ grants </FONT><FONT SIZE="2">Recipient a non-exclusive, worldwide,</FONT><FONT SIZE="2" COLOR="#008000"> </FONT><FONT
+ SIZE="2">royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise
+ transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall
+ apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the
+ Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The
+ patent license shall not apply to any other combinations which include the Contribution. No hardware per se is
+ licensed hereunder. </FONT></UL>
<UL><FONT SIZE="2"></FONT></UL>
-<UL><FONT SIZE="2">c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program.</FONT></UL>
+<UL><FONT SIZE="2">c) Recipient understands that although each Contributor grants the licenses to its Contributions set
+ forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other
+ intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims
+ brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to
+ exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any
+ other intellectual property rights needed, if any. For example, if a third party patent license is required to allow
+ Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the
+ Program.</FONT></UL>
<UL><FONT SIZE="2"></FONT></UL>
-<UL><FONT SIZE="2">d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. </FONT></UL>
+<UL><FONT SIZE="2">d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its
+ Contribution, if any, to grant the copyright license set forth in this Agreement. </FONT></UL>
<UL><FONT SIZE="2"></FONT></UL>
-<P><FONT SIZE="2"><B>3. REQUIREMENTS</B></FONT>
-<P><FONT SIZE="2"><B></B>A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that:</FONT>
+<P><FONT SIZE="2"><B>3. REQUIREMENTS</B></FONT>
-<UL><FONT SIZE="2">a) it complies with the terms and conditions of this Agreement; and</FONT></UL>
+<P><FONT SIZE="2"><B></B>A Contributor may choose to distribute the Program in object code form under its own license
+ agreement, provided that:</FONT>
+<UL><FONT SIZE="2">a) it complies with the terms and conditions of this Agreement; and</FONT></UL>
-<UL><FONT SIZE="2">b) its license agreement:</FONT></UL>
+<UL><FONT SIZE="2">b) its license agreement:</FONT></UL>
-<UL><FONT SIZE="2">i) effectively disclaims</FONT><FONT SIZE="2"> on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; </FONT></UL>
+<UL><FONT SIZE="2">i) effectively disclaims</FONT><FONT SIZE="2"> on behalf of all Contributors all warranties and
+ conditions, express and implied, including warranties or conditions of title and non-infringement, and implied
+ warranties or conditions of merchantability and fitness for a particular purpose; </FONT></UL>
-<UL><FONT SIZE="2">ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; </FONT></UL>
+<UL><FONT SIZE="2">ii) effectively excludes on behalf of all Contributors all liability for damages, including direct,
+ indirect, special, incidental and consequential damages, such as lost profits; </FONT></UL>
-<UL><FONT SIZE="2">iii)</FONT><FONT SIZE="2"> states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and</FONT></UL>
+<UL><FONT SIZE="2">iii)</FONT><FONT SIZE="2"> states that any provisions which differ from this Agreement are offered by
+ that Contributor alone and not by any other party; and</FONT></UL>
-<UL><FONT SIZE="2">iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange.</FONT><FONT SIZE="2" COLOR="#0000FF"> </FONT><FONT SIZE="2" COLOR="#FF0000"></FONT></UL>
+
+<UL><FONT SIZE="2">iv) states that source code for the Program is available from such Contributor, and informs licensees
+ how to obtain it in a reasonable manner on or through a medium customarily used for software exchange.</FONT><FONT
+ SIZE="2" COLOR="#0000FF"> </FONT><FONT SIZE="2" COLOR="#FF0000"></FONT></UL>
<UL><FONT SIZE="2" COLOR="#FF0000"></FONT><FONT SIZE="2"></FONT></UL>
<P><FONT SIZE="2">When the Program is made available in source code form:</FONT>
-<UL><FONT SIZE="2">a) it must be made available under this Agreement; and </FONT></UL>
+<UL><FONT SIZE="2">a) it must be made available under this Agreement; and </FONT></UL>
-<UL><FONT SIZE="2">b) a copy of this Agreement must be included with each copy of the Program. </FONT></UL>
+<UL><FONT SIZE="2">b) a copy of this Agreement must be included with each copy of the Program. </FONT></UL>
<P><FONT SIZE="2"></FONT><FONT SIZE="2" COLOR="#0000FF"><STRIKE></STRIKE></FONT>
-<P><FONT SIZE="2" COLOR="#0000FF"><STRIKE></STRIKE></FONT><FONT SIZE="2">Contributors may not remove or alter any copyright notices contained within the Program. </FONT>
+
+<P><FONT SIZE="2" COLOR="#0000FF"><STRIKE></STRIKE></FONT><FONT SIZE="2">Contributors may not remove or alter any
+ copyright notices contained within the Program. </FONT>
+
<P><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2">Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution. </FONT>
+
+<P><FONT SIZE="2">Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that
+ reasonably allows subsequent Recipients to identify the originator of the Contribution. </FONT>
+
<P><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2"><B>4. COMMERCIAL DISTRIBUTION</B></FONT>
-<P><FONT SIZE="2">Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense.</FONT>
+
+<P><FONT SIZE="2"><B>4. COMMERCIAL DISTRIBUTION</B></FONT>
+
+<P><FONT SIZE="2">Commercial distributors of software may accept certain responsibilities with respect to end users,
+ business partners and the like. While this license is intended to facilitate the commercial use of the Program, the
+ Contributor who includes the Program in a commercial product offering should do so in a manner which does not create
+ potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product
+ offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor
+ ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims,
+ lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by
+ the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a
+ commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any
+ actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a)
+ promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to
+ control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The
+ Indemnified Contributor may participate in any such claim at its own expense.</FONT>
+
<P><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2">For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages.</FONT>
+
+<P><FONT SIZE="2">For example, a Contributor might include the Program in a commercial product offering, Product X. That
+ Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers
+ warranties related to Product X, those performance claims and warranties are such Commercial Contributor's
+ responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other
+ Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay
+ any damages as a result, the Commercial Contributor must pay those damages.</FONT>
+
<P><FONT SIZE="2"></FONT><FONT SIZE="2" COLOR="#0000FF"></FONT>
-<P><FONT SIZE="2" COLOR="#0000FF"></FONT><FONT SIZE="2"><B>5. NO WARRANTY</B></FONT>
-<P><FONT SIZE="2">EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is</FONT><FONT SIZE="2"> solely responsible for determining the appropriateness of using and distributing </FONT><FONT SIZE="2">the Program</FONT><FONT SIZE="2"> and assumes all risks associated with its exercise of rights under this Agreement</FONT><FONT SIZE="2">, including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, </FONT><FONT SIZE="2">programs or equipment, and unavailability or interruption of operations</FONT><FONT SIZE="2">. </FONT><FONT SIZE="2"></FONT>
+
+<P><FONT SIZE="2" COLOR="#0000FF"></FONT><FONT SIZE="2"><B>5. NO WARRANTY</B></FONT>
+
+<P><FONT SIZE="2">EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT
+ WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR
+ CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient
+ is</FONT><FONT SIZE="2"> solely responsible for determining the appropriateness of using and distributing </FONT><FONT
+ SIZE="2">the Program</FONT><FONT SIZE="2"> and assumes all risks associated with its exercise of rights under this
+ Agreement</FONT><FONT SIZE="2">, including but not limited to the risks and costs of program errors, compliance with
+ applicable laws, damage to or loss of data, </FONT><FONT SIZE="2">programs or equipment, and unavailability or
+ interruption of operations</FONT><FONT SIZE="2">. </FONT><FONT SIZE="2"></FONT>
+
<P><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2"></FONT><FONT SIZE="2"><B>6. DISCLAIMER OF LIABILITY</B></FONT>
-<P><FONT SIZE="2"></FONT><FONT SIZE="2">EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES </FONT><FONT SIZE="2">(INCLUDING WITHOUT LIMITATION LOST PROFITS),</FONT><FONT SIZE="2"> HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.</FONT>
+
+<P><FONT SIZE="2"></FONT><FONT SIZE="2"><B>6. DISCLAIMER OF LIABILITY</B></FONT>
+
+<P><FONT SIZE="2"></FONT><FONT SIZE="2">EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY
+ CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES </FONT><FONT SIZE="2">(INCLUDING WITHOUT LIMITATION LOST PROFITS),</FONT><FONT SIZE="2"> HOWEVER CAUSED AND ON
+ ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
+ ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED
+ OF THE POSSIBILITY OF SUCH DAMAGES.</FONT>
+
<P><FONT SIZE="2"></FONT><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2"><B>7. GENERAL</B></FONT>
-<P><FONT SIZE="2"></FONT><FONT SIZE="2">If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable.</FONT>
+
+<P><FONT SIZE="2"><B>7. GENERAL</B></FONT>
+
+<P><FONT SIZE="2"></FONT><FONT SIZE="2">If any provision of this Agreement is invalid or unenforceable under applicable
+ law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without
+ further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such
+ provision valid and enforceable.</FONT>
+
<P><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2">If Recipient institutes patent litigation against a Contributor with respect to a patent applicable to software (including a cross-claim or counterclaim in a lawsuit), then any patent licenses granted by that Contributor to such Recipient under this Agreement shall terminate as of the date such litigation is filed. In addition, if Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. </FONT><FONT SIZE="2"></FONT>
+
+<P><FONT SIZE="2">If Recipient institutes patent litigation against a Contributor with respect to a patent applicable to
+ software (including a cross-claim or counterclaim in a lawsuit), then any patent licenses granted by that Contributor
+ to such Recipient under this Agreement shall terminate as of the date such litigation is filed. In addition, if
+ Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit)
+ alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes
+ such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date
+ such litigation is filed. </FONT><FONT SIZE="2"></FONT>
+
<P><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2">All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. </FONT><FONT SIZE="2"></FONT>
+
+<P><FONT SIZE="2">All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the
+ material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after
+ becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to
+ cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under
+ this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. </FONT><FONT
+ SIZE="2"></FONT>
+
<P><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2"></FONT><FONT SIZE="2">Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to </FONT><FONT SIZE="2">publish new versions (including revisions) of this Agreement from time to </FONT><FONT SIZE="2">time. No one other than the Agreement Steward has the right to modify this Agreement. IBM is the initial Agreement Steward. IBM may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. </FONT><FONT SIZE="2">Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new </FONT><FONT SIZE="2">version. </FONT><FONT SIZE="2">Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, </FONT><FONT SIZE="2">by implication, estoppel or otherwise</FONT><FONT SIZE="2">.</FONT><FONT SIZE="2"> All rights in the Program not expressly granted under this Agreement are reserved.</FONT>
+
+<P><FONT SIZE="2"></FONT><FONT SIZE="2">Everyone is permitted to copy and distribute copies of this Agreement, but in
+ order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The
+ Agreement Steward reserves the right to </FONT><FONT SIZE="2">publish new versions (including revisions) of this
+ Agreement from time to </FONT><FONT SIZE="2">time. No one other than the Agreement Steward has the right to modify
+ this Agreement. IBM is the initial Agreement Steward. IBM may assign the responsibility to serve as the Agreement
+ Steward to a suitable separate entity. </FONT><FONT SIZE="2">Each new version of the Agreement will be given a
+ distinguishing version number. The Program (including Contributions) may always be distributed subject to the version
+ of the Agreement under which it was received. In addition, after a new version of the Agreement is published,
+ Contributor may elect to distribute the Program (including its Contributions) under the new </FONT><FONT SIZE="2">version. </FONT><FONT
+ SIZE="2">Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the
+ intellectual property of any Contributor under this Agreement, whether expressly, </FONT><FONT SIZE="2">by
+ implication, estoppel or otherwise</FONT><FONT SIZE="2">.</FONT><FONT SIZE="2"> All rights in the Program not
+ expressly granted under this Agreement are reserved.</FONT>
+
<P><FONT SIZE="2"></FONT>
-<P><FONT SIZE="2">This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation.</FONT>
+
+<P><FONT SIZE="2">This Agreement is governed by the laws of the State of New York and the intellectual property laws of
+ the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one
+ year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation.</FONT>
+
<P><FONT SIZE="2"></FONT><FONT SIZE="2"></FONT>
+
<P><FONT SIZE="2"></FONT>
</BODY>
// No, we can't use an enum here. J2ME doesn't support it.
- /** 1D barcode format family. */
+ /**
+ * 1D barcode format family.
+ */
public static final BarcodeFormat ONED = new BarcodeFormat();
- /** QR Code 2D barcode format */
+ /**
+ * QR Code 2D barcode format
+ */
public static final BarcodeFormat QR_CODE = new BarcodeFormat();
- /** DataMatrix 2D barcode format */
+ /**
+ * DataMatrix 2D barcode format
+ */
public static final BarcodeFormat DATAMATRIX = new BarcodeFormat();
-
- private BarcodeFormat() {}
+
+ private BarcodeFormat() {
+ }
}
\ No newline at end of file
/**
* <p>Enumerates different methods of sampling an imagine to estimate a black point.</p>
- *
+ *
* @author srowen@google.com (Sean Owen), dswitkin@google.com (Daniel Switkin)
*/
public final class BlackPointEstimationMethod {
- /** Method probably most suitable for use with 2D barcdoe format. */
+ /**
+ * Method probably most suitable for use with 2D barcdoe format.
+ */
public static final BlackPointEstimationMethod TWO_D_SAMPLING = new BlackPointEstimationMethod();
- /** Method probably most suitable for 1D barcode decoding, where one row at a time is sampled. */
+ /**
+ * Method probably most suitable for 1D barcode decoding, where one row at a time is sampled.
+ */
public static final BlackPointEstimationMethod ROW_SAMPLING = new BlackPointEstimationMethod();
private BlackPointEstimationMethod() {
// No, we can't use an enum here. J2ME doesn't support it.
- /** Unspecified, application-specific hint. */
+ /**
+ * Unspecified, application-specific hint.
+ */
public static final DecodeHintType OTHER = new DecodeHintType();
- /** Image is a pure monochrome image of a barcode. */
+ /**
+ * Image is a pure monochrome image of a barcode.
+ */
public static final DecodeHintType PURE_BARCODE = new DecodeHintType();
/**
* Image is known to be of one of a few possible formats.
*/
public static final DecodeHintType POSSIBLE_FORMATS = new DecodeHintType();
- private DecodeHintType() {}
+ private DecodeHintType() {
+ }
}
*
* @param y vertical offset, from top, of the row of pixels
* @param row if not null, {@link BitArray} to write pixels into. If null, a new {@link BitArray}
- * is allocated and returned.
+ * is allocated and returned.
* @param startX horizontal offset, from left, from which to start getting pixels
* @param getWidth number of pixels to get from the row
* @return {@link BitArray} representing the (subset of the) row of pixels. If row parameter
- * was not null, it is returned.
+ * was not null, it is returned.
*/
BitArray getBlackRow(int y, BitArray row, int startX, int getWidth);
} catch (ReaderException re) {
}
}
-
+
// Then fall through to QR codes.
if (tryQR) {
try {
} catch (ReaderException re) {
}
}
-
+
throw new ReaderException("No barcode was detected in this image.");
}
*
* @param image image of barcode to decode
* @param hints passed as a {@link Hashtable} from {@link DecodeHintType} to aribtrary data. The
- * meaning of the data depends upon the hint type. The implementation may or may not do
- * anything with these hints.
+ * meaning of the data depends upon the hint type. The implementation may or may not do
+ * anything with these hints.
* @return String which the barcode encodes
* @throws ReaderException if the barcode cannot be located or decoded for any reason
*/
* The general exception class throw when something goes wrong during decoding of a barcode.
* This includes, but is not limited to, failing checksums / error correction algorithms, being
* unable to locate finder timing patterns, and so on.
- *
+ *
* @author srowen@google.com (Sean Owen)
*/
public final class ReaderException extends Exception {
/**
* @return points related to the barcode in the image. These are typically points
- * identifying finder patterns or the corners of the barcode. The exact meaning is
- * specific to the type of barcode that was decoded.
+ * identifying finder patterns or the corners of the barcode. The exact meaning is
+ * specific to the type of barcode that was decoded.
*/
public ResultPoint[] getResultPoints() {
return resultPoints;
/**
* <p>Encapsulates a point of interest in an image containing a barcode. Typically, this
* would be the location of a finder pattern or the corner of the barcode, for example.</p>
- *
+ *
* @author srowen@google.com (Sean Owen)
*/
public interface ResultPoint {
float getX();
+
float getY();
}
// No terminating semicolon? uh, done. Set i such that loop terminates and break
i = rawText.length();
done = true;
- } else if (rawText.charAt(i-1) == '\\') {
+ } else if (rawText.charAt(i - 1) == '\\') {
// semicolon was escaped so continue
i++;
} else {
/**
* Represents the type of data encoded by a barcode -- from plain text, to a
* URI, to an e-mail address, etc.
- *
+ *
* @author srowen@google.com (Sean Owen)
*/
public final class ParsedReaderResultType {
public static final ParsedReaderResultType BOOKMARK = new ParsedReaderResultType();
public static final ParsedReaderResultType ADDRESSBOOK = new ParsedReaderResultType();
public static final ParsedReaderResultType EMAIL = new ParsedReaderResultType();
- public static final ParsedReaderResultType EMAIL_ADDRESS = new ParsedReaderResultType();
+ public static final ParsedReaderResultType EMAIL_ADDRESS = new ParsedReaderResultType();
public static final ParsedReaderResultType UPC = new ParsedReaderResultType();
public static final ParsedReaderResultType URI = new ParsedReaderResultType();
public static final ParsedReaderResultType TEXT = new ParsedReaderResultType();
this.bits = makeArray(size);\r
}\r
\r
- public int getSize() {\r
- return size;\r
- }\r
+ public int getSize() {\r
+ return size;\r
+ }\r
\r
/**\r
* @param i bit to get\r
*\r
* @param i first bit to set\r
* @param newBits the new value of the next 32 bits. Note again that the least-significant bit\r
- * corresponds to bit i, the next-least-significant to i+1, and so on.\r
+ * corresponds to bit i, the next-least-significant to i+1, and so on.\r
*/\r
public void setBulk(int i, int newBits) {\r
bits[i >> 5] = newBits;\r
\r
/**\r
* @return underlying array of ints. The first element holds the first 32 bits, and the least\r
- * significant bit is bit 0.\r
+ * significant bit is bit 0.\r
*/\r
public int[] getBitArray() {\r
return bits;\r
}\r
- \r
+\r
/**\r
* Reverses all bits in the array.\r
*/\r
}\r
bits = newBits;\r
}\r
- \r
+\r
private static int[] makeArray(int size) {\r
int arraySize = size >> 5;\r
if ((size & 0x1F) != 0) {\r
*\r
* @param histogram an array of <em>counts</em> of luminance values\r
* @param biasTowardsWhite values higher than 1.0 suggest that a higher black point is desirable (e.g.\r
- * more values are considered black); less than 1.0 suggests that lower is desirable. Must be greater\r
- * than 0.0; 1.0 is a good "default"\r
+ * more values are considered black); less than 1.0 suggests that lower is desirable. Must be greater\r
+ * than 0.0; 1.0 is a good "default"\r
* @return index within argument of bucket corresponding to brightest values which should be\r
- * considered "black"\r
+ * considered "black"\r
*/\r
public static int estimate(int[] histogram, float biasTowardsWhite) {\r
\r
- if (Float.isNaN(biasTowardsWhite) || biasTowardsWhite <= 0.0f) {\r
- throw new IllegalArgumentException("Illegal biasTowardsWhite: " + biasTowardsWhite);\r
- }\r
+ if (Float.isNaN(biasTowardsWhite) || biasTowardsWhite <= 0.0f) {\r
+ throw new IllegalArgumentException("Illegal biasTowardsWhite: " + biasTowardsWhite);\r
+ }\r
\r
int numBuckets = histogram.length;\r
\r
/**
* Sorts its argument (destructively) using insert sort; in the context of this package
* insertion sort is simple and efficient given its relatively small inputs.
- *
+ *
* @param vector vector to sort
* @param comparator comparator to define sort ordering
*/
/**
* <p>Simple implementation of {@link ResultPoint} for applications that don't need
* to use anything more complex.</p>
- *
+ *
* @author dswitkin@google.com (Daniel Switkin)
*/
public final class GenericResultPoint implements ResultPoint {
private static final int PRIMITIVE = 0x011D;
private static final int[] exp = new int[256];
private static final int[] log = new int[256];
+
static {
int x = 1;
for (int i = 0; i < 256; i++) {
/**
* Implements both addition and subtraction -- they are the same in GF(256).
- *
+ *
* @return sum/difference of a and b
*/
static int addOrSubtract(int a, int b) {
}
/**
- *
* @param a
* @param b
* @return product of a and b in GF(256)
*/
final class GF256Poly {
- /** Polynimal representing the monomial 0. */
- static final GF256Poly ZERO = new GF256Poly(new int[] { 0 });
- /** Polynimal representing the monomial 1. */
- static final GF256Poly ONE = new GF256Poly(new int[] { 1 });
+ /**
+ * Polynimal representing the monomial 0.
+ */
+ static final GF256Poly ZERO = new GF256Poly(new int[]{0});
+ /**
+ * Polynimal representing the monomial 1.
+ */
+ static final GF256Poly ONE = new GF256Poly(new int[]{1});
private final int[] coefficients;
/**
* @param coefficients coefficients as ints representing elements of GF(256), arranged
- * from most significant (highest-power term) coefficient to least significant
+ * from most significant (highest-power term) coefficient to least significant
* @throws IllegalArgumentException if argument is null or empty,
- * or if leading coefficient is 0 and this is not a
- * constant polynomial (that is, it is not the monomial "0")
+ * or if leading coefficient is 0 and this is not a
+ * constant polynomial (that is, it is not the monomial "0")
*/
GF256Poly(int[] coefficients) {
if (coefficients == null || coefficients.length == 0) {
} else {
this.coefficients = new int[coefficients.length - firstNonZero];
System.arraycopy(coefficients,
- firstNonZero,
- this.coefficients,
- 0,
- this.coefficients.length);
+ firstNonZero,
+ this.coefficients,
+ 0,
+ this.coefficients.length);
}
} else {
this.coefficients = coefficients;
int aCoeff = aCoefficients[i];
for (int j = 0; j < bLength; j++) {
product[i + j] = GF256.addOrSubtract(product[i + j],
- GF256.multiply(aCoeff, bCoefficients[j]));
+ GF256.multiply(aCoeff, bCoefficients[j]));
}
}
return new GF256Poly(product);
if (coefficient == 0) {
return ZERO;
}
- int size = coefficients.length;
+ int size = coefficients.length;
int[] product = new int[size + degree];
System.arraycopy(coefficients, 0, product, 0, size);
for (int i = 0; i < size; i++) {
*
* <ul>
* <li>Bruce Maggs.
- *
<a href="http://www.cs.cmu.edu/afs/cs.cmu.edu/project/pscico-guyb/realworld/www/rs_decode.ps">
- * "Decoding Reed-Solomon Codes"</a> (see discussion of Forney's Formula)</li>
+ * <a href="http://www.cs.cmu.edu/afs/cs.cmu.edu/project/pscico-guyb/realworld/www/rs_decode.ps">
+ * "Decoding Reed-Solomon Codes"</a> (see discussion of Forney's Formula)</li>
* <li>J.I. Hall. <a href="www.mth.msu.edu/~jhall/classes/codenotes/GRS.pdf">
* "Chapter 5. Generalized Reed-Solomon Codes"</a>
* (see discussion of Euclidean algorithm)</li>
* @author William Rucklidge
*/
public final class ReedSolomonDecoder {
-
+
private ReedSolomonDecoder() {
}
int inverse = GF256.inverse(sigmaTildeAtZero);
GF256Poly sigma = t.multiply(inverse);
GF256Poly omega = r.multiply(inverse);
- return new GF256Poly[] { sigma, omega };
+ return new GF256Poly[]{sigma, omega};
}
private static int[] findErrorLocations(GF256Poly errorLocator)
}
}
result[i] = GF256.multiply(errorEvaluator.evaluateAt(xiInverse),
- GF256.inverse(denominator));
+ GF256.inverse(denominator));
}
return result;
}
/**
* <p>Thrown when an exception occurs during Reed-Solomon decoding, such as when
* there are too many errors to correct.</p>
- *
+ *
* @author srowen@google.com (Sean Owen)
*/
public final class ReedSolomonException extends Exception {
package com.google.zxing.oned;
+import com.google.zxing.ReaderException;
import com.google.zxing.Result;
import com.google.zxing.ResultPoint;
-import com.google.zxing.ReaderException;
import com.google.zxing.common.BitArray;
import com.google.zxing.common.GenericResultPoint;
private static final float MAX_VARIANCE = 0.4f;
- /** Start/end guard pattern. */
+ /**
+ * Start/end guard pattern.
+ */
protected static final int[] START_END_PATTERN = {1, 1, 1,};
- /** Pattern marking the middle of a UPC/EAN pattern, separating the two halves. */
+ /**
+ * Pattern marking the middle of a UPC/EAN pattern, separating the two halves.
+ */
protected static final int[] MIDDLE_PATTERN = {1, 1, 1, 1, 1};
- /** "Odd", or "L" patterns used to encode UPC/EAN digits. */
+ /**
+ * "Odd", or "L" patterns used to encode UPC/EAN digits.
+ */
protected static final int[][] L_PATTERNS = {
{3, 2, 1, 1}, // 0
{2, 2, 2, 1}, // 1
{3, 1, 1, 2} // 9
};
- /** As above but also including the "even", or "G" patterns used to encode UPC/EAN digits. */
+ /**
+ * As above but also including the "even", or "G" patterns used to encode UPC/EAN digits.
+ */
protected static final int[][] L_AND_G_PATTERNS;
static {
* @param row row of black/white values to search
* @param rowOffset position to start search
* @param whiteFirst if true, indicates that the pattern specifies white/black/white/...
- * pixel counts, otherwise, it is interpreted as black/white/black/...
+ * pixel counts, otherwise, it is interpreted as black/white/black/...
* @param pattern pattern of counts of number of black and white pixels that are being
- * searched for as a pattern
+ * searched for as a pattern
* @return start/end horizontal offset of guard pattern, as an array of two ints
* @throws ReaderException if pattern is not found
*/
} else {
if (counterPosition == patternLength - 1) {
if (patternMatchVariance(counters, pattern) < MAX_VARIANCE) {
- return new int[] {patternStart, x};
+ return new int[]{patternStart, x};
}
patternStart += counters[0] + counters[1];
for (int y = 2; y < patternLength; y++) {
* @param counters the counts of runs of observed black/white/black/... values
* @param rowOffset horizontal offset to start decoding from
* @param patterns the set of patterns to use to decode -- sometimes different encodings
- * for the digits 0-9 are used, and this indicates the encodings for 0 to 9 that should
- * be used
+ * for the digits 0-9 are used, and this indicates the encodings for 0 to 9 that should
+ * be used
* @return horizontal offset of first pixel beyond the decoded digit
* @throws ReaderException if digit cannot be decoded
*/
package com.google.zxing.oned;
-import com.google.zxing.Result;
import com.google.zxing.ReaderException;
+import com.google.zxing.Result;
import com.google.zxing.ResultPoint;
import com.google.zxing.common.BitArray;
import com.google.zxing.common.GenericResultPoint;
if (counterPosition == patternLength - 1) {
for (int startCode = CODE_START_A; startCode <= CODE_START_C; startCode++) {
if (patternMatchVariance(counters, CODE_PATTERNS[startCode]) < MAX_VARIANCE) {
- return new int[] {patternStart, i, startCode};
+ return new int[]{patternStart, i, startCode};
}
}
patternStart += counters[0] + counters[1];
* Creates a reader that can be configured to check the last character as a check digit.
*
* @param usingCheckDigit if true, treat the last data character as a check digit, not
- * data, and verify that the checksum passes
+ * data, and verify that the checksum passes
*/
public Code39Reader(boolean usingCheckDigit) {
this.usingCheckDigit = usingCheckDigit;
if (counterPosition == patternLength - 1) {
try {
if (toNarrowWidePattern(counters) == ASTERISK_ENCODING) {
- return new int[] {patternStart, i};
+ return new int[]{patternStart, i};
}
} catch (ReaderException re) {
// no match, continue
*
* @param resultString string to insert decoded first digit into
* @param lgPatternFound int whose bits indicates the pattern of odd/even L/G patterns used to
- * encode digits
+ * encode digits
* @throws ReaderException if first digit cannot be determined
*/
private static void determineFirstDigit(StringBuffer resultString, int lgPatternFound) throws ReaderException {
* Reader implementations to which this implementation delegates, in the order
* they will be attempted. Order is important.
*/
- private final UPCEANReader[] readers = new UPCEANReader[] {
+ private final UPCEANReader[] readers = new UPCEANReader[]{
new EAN13Reader(), new UPCAReader(), new EAN8Reader(), new UPCEReader()
};
* an image.</p>
*
* @param rowNumber row number from top of the row
- * @param row the black/white pixel data of the row
+ * @param row the black/white pixel data of the row
* @return {@link Result} containing encoded string and start/end of barcode
* @throws ReaderException if an error occurs or barcode cannot be found
*/
*\r
* @return {@link FormatInformation} encapsulating the QR Code's format info\r
* @throws ReaderException if both format information locations cannot be parsed as\r
- * the valid encoding of format information\r
+ * the valid encoding of format information\r
*/\r
FormatInformation readFormatInformation() throws ReaderException {\r
\r
*\r
* @return {@link Version} encapsulating the QR Code's version\r
* @throws ReaderException if both version information locations cannot be parsed as\r
- * the valid encoding of version information\r
+ * the valid encoding of version information\r
*/\r
Version readVersion() throws ReaderException {\r
\r
\r
/**\r
* @param bytes bytes from which this will read bits. Bits will be read from the first byte first.\r
- * Bits are read within a byte from most-significant to least-significant bit.\r
+ * Bits are read within a byte from most-significant to least-significant bit.\r
*/\r
BitSource(byte[] bytes) {\r
this.bytes = bytes;\r
/**\r
* @param numBits number of bits to read\r
* @return int representing the bits read. The bits will appear as the least-significant\r
- * bits of the int\r
+ * bits of the int\r
* @throws IllegalArgumentException if numBits isn't in [1,32]\r
*/\r
int readBits(int numBits) {\r
* @param version version of the QR Code\r
* @param ecLevel error-correction level of the QR Code\r
* @return {@link DataBlock}s containing original bytes, "de-interleaved" from representation in the\r
- * QR Code\r
+ * QR Code\r
*/\r
static DataBlock[] getDataBlocks(byte[] rawCodewords,\r
Version version,\r
\r
/**\r
* @param reference a value between 0 and 7 indicating one of the eight possible\r
- * data mask patterns a QR Code may use\r
+ * data mask patterns a QR Code may use\r
* @return {@link DataMask} encapsulating the data mask pattern\r
*/\r
static DataMask forReference(int reference) {\r
// No, we can't use an enum here. J2ME doesn't support it.
- /** L = ~7% correction */
+ /**
+ * L = ~7% correction
+ */
static final ErrorCorrectionLevel L = new ErrorCorrectionLevel(0);
- /** M = ~15% correction */
+ /**
+ * M = ~15% correction
+ */
static final ErrorCorrectionLevel M = new ErrorCorrectionLevel(1);
- /** Q = ~25% correction */
+ /**
+ * Q = ~25% correction
+ */
static final ErrorCorrectionLevel Q = new ErrorCorrectionLevel(2);
- /** H = ~30% correction */
+ /**
+ * H = ~30% correction
+ */
static final ErrorCorrectionLevel H = new ErrorCorrectionLevel(3);
- private static final ErrorCorrectionLevel[] FOR_BITS = new ErrorCorrectionLevel[] { M, L, H, Q };
+ private static final ErrorCorrectionLevel[] FOR_BITS = new ErrorCorrectionLevel[]{M, L, H, Q};
private final int ordinal;
{0x2BED, 0x1F},
};
- /** Offset i holds the number of 1 bits in the binary representation of i */
+ /**
+ * Offset i holds the number of 1 bits in the binary representation of i
+ */
private static final int[] BITS_SET_IN_HALF_BYTE =
new int[]{0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4};
static int numBitsDiffering(int a, int b) {
a ^= b; // a now has a 1 bit exactly where its bit differs with b's
// Count bits set quickly with a series of lookups:
- return BITS_SET_IN_HALF_BYTE[a & 0x0F] +
- BITS_SET_IN_HALF_BYTE[(a >>> 4 & 0x0F)] +
- BITS_SET_IN_HALF_BYTE[(a >>> 8 & 0x0F)] +
- BITS_SET_IN_HALF_BYTE[(a >>> 12 & 0x0F)] +
- BITS_SET_IN_HALF_BYTE[(a >>> 16 & 0x0F)] +
- BITS_SET_IN_HALF_BYTE[(a >>> 20 & 0x0F)] +
- BITS_SET_IN_HALF_BYTE[(a >>> 24 & 0x0F)] +
- BITS_SET_IN_HALF_BYTE[(a >>> 28 & 0x0F)];
+ return BITS_SET_IN_HALF_BYTE[a & 0x0F] +
+ BITS_SET_IN_HALF_BYTE[(a >>> 4 & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(a >>> 8 & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(a >>> 12 & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(a >>> 16 & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(a >>> 20 & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(a >>> 24 & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(a >>> 28 & 0x0F)];
}
/**
- *
* @param rawFormatInfo
* @return
*/
final class Mode {
// No, we can't use an enum here. J2ME doesn't support it.
-
- static final Mode TERMINATOR = new Mode(new int[] {0, 0, 0}); // Not really a mode...
- static final Mode NUMERIC = new Mode(new int[] {10, 12, 14});
- static final Mode ALPHANUMERIC = new Mode(new int[] {9, 11, 13});
- static final Mode BYTE = new Mode(new int[] {8, 16, 16});
- static final Mode KANJI = new Mode(new int[] {8, 10, 12});
+
+ static final Mode TERMINATOR = new Mode(new int[]{0, 0, 0}); // Not really a mode...
+ static final Mode NUMERIC = new Mode(new int[]{10, 12, 14});
+ static final Mode ALPHANUMERIC = new Mode(new int[]{9, 11, 13});
+ static final Mode BYTE = new Mode(new int[]{8, 16, 16});
+ static final Mode KANJI = new Mode(new int[]{8, 10, 12});
private int[] characterCountBitsForVersions;
/**
* @param version version in question
* @return number of bits used, in this QR Code symbol {@link Version}, to encode the
- * count of characters that will follow encoded in this {@link Mode}
+ * count of characters that will follow encoded in this {@link Mode}
*/
int getCharacterCountBits(Version version) {
int number = version.getVersionNumber();
ECBlocks ecBlocks4) {\r
this.versionNumber = versionNumber;\r
this.alignmentPatternCenters = alignmentPatternCenters;\r
- this.ecBlocks = new ECBlocks[] { ecBlocks1, ecBlocks2, ecBlocks3, ecBlocks4 };\r
+ this.ecBlocks = new ECBlocks[]{ecBlocks1, ecBlocks2, ecBlocks3, ecBlocks4};\r
int total = 0;\r
ECBlocks levelLECBlocks = ecBlocks1; // L,M,Q,H -- all the same total\r
int ecCodewords = levelLECBlocks.ecCodewords;\r
\r
private ECBlocks(int ecCodewords, ECB ecBlocks) {\r
this.ecCodewords = ecCodewords;\r
- this.ecBlocks = new ECB[] { ecBlocks };\r
+ this.ecBlocks = new ECB[]{ecBlocks};\r
}\r
\r
private ECBlocks(int ecCodewords, ECB ecBlocks1, ECB ecBlocks2) {\r
this.ecCodewords = ecCodewords;\r
- this.ecBlocks = new ECB[] { ecBlocks1, ecBlocks2 };\r
+ this.ecBlocks = new ECB[]{ecBlocks1, ecBlocks2};\r
}\r
\r
int getECCodewords() {\r
boolean aboutEquals(float moduleSize, float i, float j) {
return
Math.abs(i - posY) <= moduleSize &&
- Math.abs(j - posX) <= moduleSize &&
- (Math.abs(moduleSize - estimatedModuleSize) <= 1.0f ||
- Math.abs(moduleSize - estimatedModuleSize) / estimatedModuleSize <= 0.1f);
+ Math.abs(j - posX) <= moduleSize &&
+ (Math.abs(moduleSize - estimatedModuleSize) <= 1.0f ||
+ Math.abs(moduleSize - estimatedModuleSize) / estimatedModuleSize <= 0.1f);
}
}
\ No newline at end of file
/**\r
* @param stateCount count of black/white/black pixels just read\r
* @return true iff the proportions of the counts is close enough to the 1/1/1 ratios\r
- * used by alignment patterns to be considered a match\r
+ * used by alignment patterns to be considered a match\r
*/\r
private boolean foundPatternCross(int[] stateCount) {\r
float moduleSize = this.moduleSize;\r
* @param startI row where an alignment pattern was detected\r
* @param centerJ center of the section that appears to cross an alignment pattern\r
* @param maxCount maximum reasonable number of modules that should be\r
- * observed in any reading state, based on the results of the horizontal scan\r
+ * observed in any reading state, based on the results of the horizontal scan\r
* @return vertical center of alignment pattern, or {@link Float#NaN} if not found\r
*/\r
private float crossCheckVertical(int startI, int centerJ, int maxCount) {\r
this.image = image;
}
- /**
-
* <p>Detects a QR Code in an image, simply.</p>
- *
- * @return {@link DetectorResult} encapsulating results of detecting a QR Code
- * @throws ReaderException if no QR Code can be found
- */
+ /**
+ * <p>Detects a QR Code in an image, simply.</p>
+ *
+ * @return {@link DetectorResult} encapsulating results of detecting a QR Code
+ * @throws ReaderException if no QR Code can be found
+ */
public DetectorResult detect() throws ReaderException {
MonochromeBitmapSource image = this.image;
ResultPoint[] points;
if (alignmentPattern == null) {
- points = new ResultPoint[] { bottomLeft, topLeft, topRight };
+ points = new ResultPoint[]{bottomLeft, topLeft, topRight};
} else {
- points = new ResultPoint[] { bottomLeft, topLeft, topRight, alignmentPattern };
+ points = new ResultPoint[]{bottomLeft, topLeft, topRight, alignmentPattern};
}
return new DetectorResult(bits, points);
}
case 0:
dimension++;
break;
- // 1? do nothing
+ // 1? do nothing
case 2:
dimension--;
break;
private float calculateModuleSize(ResultPoint topLeft, ResultPoint topRight, ResultPoint bottomLeft) {
// Take the average
return (calculateModuleSizeOneWay(topLeft, topRight) +
- calculateModuleSizeOneWay(topLeft, bottomLeft)) / 2.0f;
+ calculateModuleSizeOneWay(topLeft, bottomLeft)) / 2.0f;
}
- /**
-
* <p>Estimates module size based on two finder patterns -- it uses
- * {@link #sizeOfBlackWhiteBlackRunBothWays(int, int, int, int)} to figure the
- * width of each, measuring along the axis between their centers.</p>
- */
+ /**
+ * <p>Estimates module size based on two finder patterns -- it uses
+ * {@link #sizeOfBlackWhiteBlackRunBothWays(int, int, int, int)} to figure the
+ * width of each, measuring along the axis between their centers.</p>
+ */
private float calculateModuleSizeOneWay(ResultPoint pattern, ResultPoint otherPattern) {
float moduleSizeEst1 = sizeOfBlackWhiteBlackRunBothWays((int) pattern.getX(),
- (int) pattern.getY(),
- (int) otherPattern.getX(),
- (int) otherPattern.getY());
+ (int) pattern.getY(),
+ (int) otherPattern.getX(),
+ (int) otherPattern.getY());
float moduleSizeEst2 = sizeOfBlackWhiteBlackRunBothWays((int) otherPattern.getX(),
- (int) otherPattern.getY(),
- (int) pattern.getX(),
- (int) pattern.getY());
+ (int) otherPattern.getY(),
+ (int) pattern.getX(),
+ (int) pattern.getY());
if (Float.isNaN(moduleSizeEst1)) {
return moduleSizeEst2;
}
*/
boolean aboutEquals(float moduleSize, float i, float j) {
return Math.abs(i - posY) <= moduleSize &&
- Math.abs(j - posX) <= moduleSize &&
- (Math.abs(moduleSize - estimatedModuleSize) <= 1.0f ||
+ Math.abs(j - posX) <= moduleSize &&
+ (Math.abs(moduleSize - estimatedModuleSize) <= 1.0f ||
Math.abs(moduleSize - estimatedModuleSize) / estimatedModuleSize <= 0.1f);
}
/**\r
* @param stateCount count of black/white/black/white/black pixels just read\r
* @return true iff the proportions of the counts is close enough to the 1/13/1/1 ratios\r
- * used by finder patterns to be considered a match\r
+ * used by finder patterns to be considered a match\r
*/\r
private static boolean foundPatternCross(int[] stateCount) {\r
int totalModuleSize = 0;\r
float moduleSize = (float) totalModuleSize / 7.0f;\r
float maxVariance = moduleSize / 2.5f;\r
// Allow less than 40% variance from 1-1-3-1-1 proportions\r
- return Math.abs(moduleSize - stateCount[0]) < maxVariance &&\r
- Math.abs(moduleSize - stateCount[1]) < maxVariance &&\r
- Math.abs(3.0f * moduleSize - stateCount[2]) < 3.0f * maxVariance &&\r
- Math.abs(moduleSize - stateCount[3]) < maxVariance &&\r
- Math.abs(moduleSize - stateCount[4]) < maxVariance;\r
+ return Math.abs(moduleSize - stateCount[0]) < maxVariance &&\r
+ Math.abs(moduleSize - stateCount[1]) < maxVariance &&\r
+ Math.abs(3.0f * moduleSize - stateCount[2]) < 3.0f * maxVariance &&\r
+ Math.abs(moduleSize - stateCount[3]) < maxVariance &&\r
+ Math.abs(moduleSize - stateCount[4]) < maxVariance;\r
}\r
\r
/**\r
* @param startI row where a finder pattern was detected\r
* @param centerJ center of the section that appears to cross a finder pattern\r
* @param maxCount maximum reasonable number of modules that should be\r
- * observed in any reading state, based on the results of the horizontal scan\r
+ * observed in any reading state, based on the results of the horizontal scan\r
* @return vertical center of finder pattern, or {@link Float#NaN} if not found\r
*/\r
private float crossCheckVertical(int startI, int centerJ, int maxCount) {\r
centerJ = crossCheckHorizontal((int) centerJ, (int) centerI, stateCount[2]);\r
if (!Float.isNaN(centerJ)) {\r
float estimatedModuleSize =\r
- (float) (stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4]) / 7.0f;\r
+ (float) (stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4]) / 7.0f;\r
boolean found = false;\r
int max = possibleCenters.size();\r
for (int index = 0; index < max; index++) {\r
\r
/**\r
* @return number of rows we could safely skip during scanning, based on the first\r
- * two finder patterns that have been located. In some cases their position will\r
- * allow us to infer that the third pattern must lie below a certain point farther\r
- * down in the image.\r
+ * two finder patterns that have been located. In some cases their position will\r
+ * allow us to infer that the third pattern must lie below a certain point farther\r
+ * down in the image.\r
*/\r
private int findRowSkip() {\r
int max = possibleCenters.size();\r
// This is the case where you find top left first. Draw it out.\r
hasSkipped = true;\r
return (int) Math.abs(Math.abs(firstConfirmedCenter.getX() - center.getX()) -\r
- Math.abs(firstConfirmedCenter.getY() - center.getY()));\r
+ Math.abs(firstConfirmedCenter.getY() - center.getY()));\r
}\r
}\r
}\r
\r
/**\r
* @return true iff we have found at least 3 finder patterns that have been detected\r
- * at least {@link #CENTER_QUORUM} times each\r
+ * at least {@link #CENTER_QUORUM} times each\r
*/\r
private boolean haveMulitplyConfirmedCenters() {\r
int count = 0;\r
\r
/**\r
* @return the 3 best {@link FinderPattern}s from our list of candidates. The "best" are\r
- * those that have been detected at least {@link #CENTER_QUORUM} times, and whose module\r
- * size differs from the average among those patterns the least\r
+ * those that have been detected at least {@link #CENTER_QUORUM} times, and whose module\r
+ * size differs from the average among those patterns the least\r
* @throws ReaderException if 3 such finder patterns do not exist\r
*/\r
private FinderPattern[] selectBestPatterns() throws ReaderException {\r
\r
if (size == 3) {\r
// Found just enough -- hope these are good!\r
- return new FinderPattern[] {\r
- (FinderPattern) possibleCenters.elementAt(0),\r
- (FinderPattern) possibleCenters.elementAt(1),\r
- (FinderPattern) possibleCenters.elementAt(2) \r
+ return new FinderPattern[]{\r
+ (FinderPattern) possibleCenters.elementAt(0),\r
+ (FinderPattern) possibleCenters.elementAt(1),\r
+ (FinderPattern) possibleCenters.elementAt(2)\r
};\r
}\r
\r
// We don't have java.util.Collections in J2ME\r
Collections.insertionSort(possibleCenters, new ClosestToAverageComparator(averageModuleSize));\r
\r
- return new FinderPattern[] {\r
- (FinderPattern) possibleCenters.elementAt(0),\r
- (FinderPattern) possibleCenters.elementAt(1),\r
- (FinderPattern) possibleCenters.elementAt(2)\r
+ return new FinderPattern[]{\r
+ (FinderPattern) possibleCenters.elementAt(0),\r
+ (FinderPattern) possibleCenters.elementAt(1),\r
+ (FinderPattern) possibleCenters.elementAt(2)\r
};\r
}\r
\r
bottomLeft = temp;\r
}\r
\r
- return new FinderPattern[] {bottomLeft, topLeft, topRight};\r
+ return new FinderPattern[]{bottomLeft, topLeft, topRight};\r
}\r
\r
/**\r
*/\r
private static class ClosestToAverageComparator implements Comparator {\r
private final float averageModuleSize;\r
+\r
private ClosestToAverageComparator(float averageModuleSize) {\r
this.averageModuleSize = averageModuleSize;\r
}\r
+\r
public int compare(Object center1, Object center2) {\r
return Math.abs(((FinderPattern) center1).getEstimatedModuleSize() - averageModuleSize) <\r
- Math.abs(((FinderPattern) center2).getEstimatedModuleSize() - averageModuleSize) ?\r
- -1 :\r
- 1;\r
+ Math.abs(((FinderPattern) center2).getEstimatedModuleSize() - averageModuleSize) ?\r
+ -1 :\r
+ 1;\r
}\r
}\r
\r
/**
* <p>Encapsulates information about finder patterns in an image, including the location of
* the three finder patterns, and their estimated module size.</p>
- *
+ *
* @author srowen@google.com (Sean Owen)
*/
final class FinderPatternInfo {
/**
* @return the current implementation of {@link GridSampler}, instantiating one if one does
- * not already exist. The class which is instantied may be set by
- * {@link #setGridSamplerClassName(String)}
+ * not already exist. The class which is instantied may be set by
+ * {@link #setGridSamplerClassName(String)}
*/
public static GridSampler getInstance() {
if (gridSampler == null) {
* @param dimension dimension of QR Code
* @return {@link BitMatrix} representing QR Code's modules
* @throws ReaderException if QR Code cannot be reasonably sampled -- for example if the location
- * of the finder patterns imply a transformation that would require sampling off the image
+ * of the finder patterns imply a transformation that would require sampling off the image
*/
protected abstract BitMatrix sampleGrid(MonochromeBitmapSource image,
FinderPattern topLeft,
float a21 = this.a21;\r
float a22 = this.a22;\r
float a23 = this.a23;\r
- float a31 = this.a31;\r
- float a32 = this.a32;\r
- float a33 = this.a33;\r
+ float a31 = this.a31;\r
+ float a32 = this.a32;\r
+ float a33 = this.a33;\r
for (int i = 0; i < max; i += 2) {\r
float x = points[i];\r
- float y = points[i+1];\r
- float denominator = a13*x + a23*y + a33;\r
- points[i] = (a11*x + a21*y + a31) / denominator;\r
- points[i+1] = (a12*x + a22*y + a32) / denominator;\r
+ float y = points[i + 1];\r
+ float denominator = a13 * x + a23 * y + a33;\r
+ points[i] = (a11 * x + a21 * y + a31) / denominator;\r
+ points[i + 1] = (a12 * x + a22 * y + a32) / denominator;\r
}\r
}\r
\r
static PerspectiveTransform squareToQuadrilateral(float x0, float y0,\r
- float x1, float y1,\r
- float x2, float y2,\r
- float x3, float y3) {\r
+ float x1, float y1,\r
+ float x2, float y2,\r
+ float x3, float y3) {\r
float dy2 = y3 - y2;\r
float dy3 = y0 - y1 + y2 - y3;\r
if (dy2 == 0.0f && dy3 == 0.0f) {\r
return new PerspectiveTransform(x1 - x0, x2 - x1, x0,\r
- y1 - y0, y2 - y1, y0,\r
- 0.0f, 0.0f, 1.0f);\r
+ y1 - y0, y2 - y1, y0,\r
+ 0.0f, 0.0f, 1.0f);\r
} else {\r
float dx1 = x1 - x2;\r
float dx2 = x3 - x2;\r
float dx3 = x0 - x1 + x2 - x3;\r
float dy1 = y1 - y2;\r
- float denominator = dx1*dy2 - dx2*dy1;\r
- float a13 = (dx3*dy2 - dx2*dy3) / denominator;\r
- float a23 = (dx1*dy3 - dx3*dy1) / denominator;\r
- return new PerspectiveTransform(x1 - x0 + a13*x1, x3 - x0 + a23*x3, x0,\r
- y1 - y0 + a13*y1, y3 - y0 + a23*y3, y0,\r
- a13, a23, 1.0f);\r
+ float denominator = dx1 * dy2 - dx2 * dy1;\r
+ float a13 = (dx3 * dy2 - dx2 * dy3) / denominator;\r
+ float a23 = (dx1 * dy3 - dx3 * dy1) / denominator;\r
+ return new PerspectiveTransform(x1 - x0 + a13 * x1, x3 - x0 + a23 * x3, x0,\r
+ y1 - y0 + a13 * y1, y3 - y0 + a23 * y3, y0,\r
+ a13, a23, 1.0f);\r
}\r
}\r
\r
static PerspectiveTransform quadrilateralToSquare(float x0, float y0,\r
- float x1, float y1,\r
- float x2, float y2,\r
- float x3, float y3) {\r
+ float x1, float y1,\r
+ float x2, float y2,\r
+ float x3, float y3) {\r
// Here, the adjoint serves as the inverse:\r
return squareToQuadrilateral(x0, y0, x1, y1, x2, y2, x3, y3).buildAdjoint();\r
}\r
\r
PerspectiveTransform buildAdjoint() {\r
// Adjoint is the transpose of the cofactor matrix:\r
- return new PerspectiveTransform(a22*a33 - a23*a32,\r
- a23*a31 - a21*a33,\r
- a21*a32 - a22*a31,\r
- a13*a32 - a12*a33,\r
- a11*a33 - a13*a31,\r
- a12*a31 - a11*a32,\r
- a12*a23 - a13*a22,\r
- a13*a21 - a11*a23,\r
- a11*a22 - a12*a21);\r
+ return new PerspectiveTransform(a22 * a33 - a23 * a32,\r
+ a23 * a31 - a21 * a33,\r
+ a21 * a32 - a22 * a31,\r
+ a13 * a32 - a12 * a33,\r
+ a11 * a33 - a13 * a31,\r
+ a12 * a31 - a11 * a32,\r
+ a12 * a23 - a13 * a22,\r
+ a13 * a21 - a11 * a23,\r
+ a11 * a22 - a12 * a21);\r
}\r
\r
PerspectiveTransform times(PerspectiveTransform other) {\r
- return new PerspectiveTransform(a11*other.a11 + a21*other.a12 + a31*other.a13,\r
- a11*other.a21 + a21*other.a22 + a31*other.a23,\r
- a11*other.a31 + a21*other.a32 + a31*other.a33,\r
- a12*other.a11 + a22*other.a12 + a32*other.a13,\r
- a12*other.a21 + a22*other.a22 + a32*other.a23,\r
- a12*other.a31 + a22*other.a32 + a32*other.a33,\r
- a13*other.a11 + a23*other.a12 + a33*other.a13,\r
- a13*other.a21 + a23*other.a22 + a33*other.a23,\r
- a13*other.a31 + a23*other.a32 + a33*other.a33);\r
+ return new PerspectiveTransform(a11 * other.a11 + a21 * other.a12 + a31 * other.a13,\r
+ a11 * other.a21 + a21 * other.a22 + a31 * other.a23,\r
+ a11 * other.a31 + a21 * other.a32 + a31 * other.a33,\r
+ a12 * other.a11 + a22 * other.a12 + a32 * other.a13,\r
+ a12 * other.a21 + a22 * other.a22 + a32 * other.a23,\r
+ a12 * other.a31 + a22 * other.a32 + a32 * other.a33,\r
+ a13 * other.a11 + a23 * other.a12 + a33 * other.a13,\r
+ a13 * other.a21 + a23 * other.a22 + a33 * other.a23,\r
+ a13 * other.a31 + a23 * other.a32 + a33 * other.a33);\r
\r
}\r
\r
doTestResult("MATMSG:TO:srowen@example.org;SUB:Stuff;;", ParsedReaderResultType.EMAIL);
doTestResult("MATMSG:TO:srowen@example.org;SUB:Stuff;BODY:This is some text;;", ParsedReaderResultType.EMAIL);
doTestResult("MATMSG:SUB:Stuff;BODY:This is some text;TO:srowen@example.org;;", ParsedReaderResultType.EMAIL);
- doTestResult("TO:srowen@example.org;SUB:Stuff;BODY:This is some text;;", ParsedReaderResultType.TEXT);
+ doTestResult("TO:srowen@example.org;SUB:Stuff;BODY:This is some text;;", ParsedReaderResultType.TEXT);
}
public void testEmailAddressType() {
doTestResult("MECARD:N:Sean Owen;;", ParsedReaderResultType.ADDRESSBOOK);
doTestResult("MECARD:TEL:+12125551212;N:Sean Owen;;", ParsedReaderResultType.ADDRESSBOOK);
doTestResult("MECARD:TEL:+12125551212;N:Sean Owen;URL:google.com;;", ParsedReaderResultType.ADDRESSBOOK);
- doTestResult("TEL:+12125551212;N:Sean Owen;;", ParsedReaderResultType.TEXT);
+ doTestResult("TEL:+12125551212;N:Sean Owen;;", ParsedReaderResultType.TEXT);
}
public void testUPC() {
doTestResult("HTTP://google.com", ParsedReaderResultType.URI);
doTestResult("http://google.com/foobar", ParsedReaderResultType.URI);
doTestResult("https://google.com:443/foobar", ParsedReaderResultType.URI);
- doTestResult("google.com:443/foobar", ParsedReaderResultType.URI);
+ doTestResult("google.com:443/foobar", ParsedReaderResultType.URI);
}
private static void doTestResult(String text, ParsedReaderResultType type) {
String lowerCase = name.toLowerCase();
return
lowerCase.endsWith(".jpg") || lowerCase.endsWith(".jpeg") ||
- lowerCase.endsWith(".gif") || lowerCase.endsWith(".png") ||
- lowerCase.endsWith(".url");
+ lowerCase.endsWith(".gif") || lowerCase.endsWith(".png") ||
+ lowerCase.endsWith(".url");
}
};
private final File testBase;
private final Reader barcodeReader;
- private final double passPercent;
+ private final double passPercent;
protected AbstractBlackBoxTestCase(File testBase, Reader barcodeReader, double passPercent) {
this.testBase = testBase;
this.barcodeReader = barcodeReader;
- this.passPercent = passPercent;
+ this.passPercent = passPercent;
}
public void testBlackBox() throws IOException {
for (File testImage : imageFiles) {
System.out.println("Starting " + testImage.getAbsolutePath());
- BufferedImage image;
- if (testImage.getName().endsWith(".url")) {
- String urlString = readFileAsString(testImage);
- image = ImageIO.read(new URL(urlString));
- } else {
- image = ImageIO.read(testImage);
- }
+ BufferedImage image;
+ if (testImage.getName().endsWith(".url")) {
+ String urlString = readFileAsString(testImage);
+ image = ImageIO.read(new URL(urlString));
+ } else {
+ image = ImageIO.read(testImage);
+ }
MonochromeBitmapSource source = new BufferedImageMonochromeBitmapSource(image);
Result result;
try {
}
});
for (int i = 1; i < 100; i++) {
- assertTrue("Element " + i, ((Integer) v.elementAt(i-1)).intValue() <=
- ((Integer) v.elementAt(i)).intValue());
+ assertTrue("Element " + i, ((Integer) v.elementAt(i - 1)).intValue() <=
+ ((Integer) v.elementAt(i)).intValue());
}
}
package com.google.zxing.oned;
-import com.google.zxing.common.AbstractBlackBoxTestCase;
import com.google.zxing.MultiFormatReader;
+import com.google.zxing.common.AbstractBlackBoxTestCase;
import java.io.File;
public final class BitSourceTestCase extends TestCase {
public void testSource() {
- byte[] bytes = new byte[] { (byte) 1, (byte) 2, (byte) 3, (byte) 4, (byte) 5 };
+ byte[] bytes = new byte[]{(byte) 1, (byte) 2, (byte) 3, (byte) 4, (byte) 5};
BitSource source = new BitSource(bytes);
assertEquals(40, source.available());
assertEquals(0, source.readBits(1));
public void testMask4() {
testMaskAcrossDimensions(4, new MaskCondition() {
public boolean isMasked(int i, int j) {
- return (i/2 + j/3) % 2 == 0;
+ return (i / 2 + j / 3) % 2 == 0;
}
});
}
public void testMask5() {
testMaskAcrossDimensions(5, new MaskCondition() {
public boolean isMasked(int i, int j) {
- return (i*j) % 2 + (i*j) % 3 == 0;
+ return (i * j) % 2 + (i * j) % 3 == 0;
}
});
}
public void testMask6() {
testMaskAcrossDimensions(6, new MaskCondition() {
public boolean isMasked(int i, int j) {
- return ((i*j) % 2 + (i*j) % 3) % 2 == 0;
+ return ((i * j) % 2 + (i * j) % 3) % 2 == 0;
}
});
}
public void testMask7() {
testMaskAcrossDimensions(7, new MaskCondition() {
public boolean isMasked(int i, int j) {
- return ((i+j) % 2 + (i*j) % 3) % 2 == 0;
+ return ((i + j) % 2 + (i * j) % 3) % 2 == 0;
}
});
}
MaskCondition condition) {
DataMask mask = DataMask.forReference(reference);
for (int version = 1; version <= 40; version++) {
- int dimension = 17 + 4*version;
+ int dimension = 17 + 4 * version;
testMask(mask, dimension, condition);
}
}
for (int i = 0; i < dimension; i++) {
for (int j = 0; j < dimension; j++) {
assertEquals(
- "(" + i + ',' + j + ')',
+ "(" + i + ',' + j + ')',
condition.isMasked(i, j),
bits.get(i, j));
}
assertEquals(0, FormatInformation.numBitsDiffering(1, 1));
assertEquals(1, FormatInformation.numBitsDiffering(0, 2));
assertEquals(2, FormatInformation.numBitsDiffering(1, 2));
- assertEquals(32, FormatInformation.numBitsDiffering(-1,0));
+ assertEquals(32, FormatInformation.numBitsDiffering(-1, 0));
}
public void testDecode() {
assertPointEquals(290.0f, 270.0f, 16.0f, 15.0f, pt);
assertPointEquals(150.0f, 280.0f, 4.0f, 9.0f, pt);
assertPointEquals(7.1516876f, -64.60185f, 0.5f, 0.5f, pt);
- assertPointEquals(328.09116f, 334.16385f,50.0f, 50.0f, pt);
+ assertPointEquals(328.09116f, 334.16385f, 50.0f, 50.0f, pt);
}
private static void assertPointEquals(float expectedX, float expectedY, float sourceX, float sourceY, PerspectiveTransform pt) {
- float[] points = new float[] { sourceX, sourceY };
+ float[] points = new float[]{sourceX, sourceY};
pt.transformPoints(points);
assertEquals(expectedX, points[0], EPSILON);
assertEquals(expectedY, points[1], EPSILON);
</not>
</condition>
</fail>
- <fail message="Please build 'core' first">
+ <fail message="Please build 'core' first">
<condition>
<not>
<available file="../core/core.jar" type="file"/>
debug="true"
deprecation="true"
fork="true">
- <classpath refid="wtk-build-path"/>
+ <classpath refid="wtk-build-path"/>
</javac>
<javac srcdir="src"
destdir="build"
</fileset>
</copy>
- <copy file="src/com/google/zxing/client/j2me/MANIFEST.MF.template" tofile="src/com/google/zxing/client/j2me/MANIFEST.MF" overwrite="true">
+ <copy file="src/com/google/zxing/client/j2me/MANIFEST.MF.template"
+ tofile="src/com/google/zxing/client/j2me/MANIFEST.MF" overwrite="true">
<filterset>
<filter token="APP_NAME" value="${jar-name}"/>
<filter token="VERSION" value="${version}"/>
</filterset>
</copy>
- <jar jarfile="${jar-name}.jar" basedir="build-j2me" manifest="src/com/google/zxing/client/j2me/MANIFEST.MF" level="9"/>
+ <jar jarfile="${jar-name}.jar" basedir="build-j2me" manifest="src/com/google/zxing/client/j2me/MANIFEST.MF"
+ level="9"/>
<move file="${jar-name}.jar" tofile="temp.jar"/>
<java jar="${WTK-home}/bin/proguard.jar" fork="true" failonerror="true">
* JSR-234 methods. The other does nothing. The build script creates two build products then
* one compiled with this class and one with other, to create both the JSR-234 version
* and the "basic" non-JSR-234 version.</p>
- *
+ *
* @author Sean Owen (srowen@google.com)
*/
final class AdvancedMultimediaManager {
static void setFocus(Controllable player) throws MediaException, InterruptedException {
FocusControl focusControl = (FocusControl)
- player.getControl("javax.microedition.amms.control.camera.FocusControl");
+ player.getControl("javax.microedition.amms.control.camera.FocusControl");
if (focusControl != null) {
if (focusControl.isMacroSupported() && !focusControl.getMacro()) {
focusControl.setMacro(true);
package com.google.zxing.client.j2me;
-import com.google.zxing.MonochromeBitmapSource;
import com.google.zxing.BlackPointEstimationMethod;
+import com.google.zxing.MonochromeBitmapSource;
import com.google.zxing.common.BitArray;
import com.google.zxing.common.BlackPointEstimator;
/**
* <p>An implementation based on Java ME's {@link Image} representation.</p>
- *
+ *
* @author Sean Owen (srowen@google.com), Daniel Switkin (dswitkin@google.com)
*/
public final class LCDUIImageMonochromeBitmapSource implements MonochromeBitmapSource {
private int blackPoint;
private BlackPointEstimationMethod lastMethod;
private int lastArgument;
-
+
private static final int LUMINANCE_BITS = 5;
private static final int LUMINANCE_SHIFT = 8 - LUMINANCE_BITS;
private static final int LUMINANCE_BUCKETS = 1 << LUMINANCE_BITS;
public void estimateBlackPoint(BlackPointEstimationMethod method, int argument) {
if (!method.equals(lastMethod) || argument != lastArgument) {
int[] histogram = new int[LUMINANCE_BUCKETS];
- float biasTowardsWhite = 1.0f;
+ float biasTowardsWhite = 1.0f;
if (method.equals(BlackPointEstimationMethod.TWO_D_SAMPLING)) {
int minDimension = width < height ? width : height;
for (int n = 0, offset = 0; n < minDimension; n++, offset += width + 1) {
if (argument < 0 || argument >= height) {
throw new IllegalArgumentException("Row is not within the image: " + argument);
}
- biasTowardsWhite = 2.0f;
+ biasTowardsWhite = 2.0f;
int offset = argument * width;
for (int x = 0; x < width; x++) {
histogram[computeRGBLuminance(rgbPixels[offset + x]) >> LUMINANCE_SHIFT]++;
Player player = zXingMIDlet.getPlayer();
try {
AdvancedMultimediaManager.setFocus(player);
- try {
- player.stop();
- } catch (MediaException me) {
- // continue
- }
- byte[] snapshot = takeSnapshot();
+ try {
+ player.stop();
+ } catch (MediaException me) {
+ // continue
+ }
+ byte[] snapshot = takeSnapshot();
Image capturedImage = Image.createImage(snapshot, 0, snapshot.length);
MonochromeBitmapSource source = new LCDUIImageMonochromeBitmapSource(capturedImage);
Reader reader = new MultiFormatReader();
Result result = reader.decode(source);
zXingMIDlet.handleDecodedText(result.getText());
} catch (ReaderException re) {
- // Show a friendlier message on a mere failure to read the barcode
- zXingMIDlet.showError("Sorry, no barcode was found.");
+ // Show a friendlier message on a mere failure to read the barcode
+ zXingMIDlet.showError("Sorry, no barcode was found.");
} catch (Throwable t) {
zXingMIDlet.showError(t);
} finally {
- try {
- player.start();
- } catch (MediaException me) {
- // continue
- }
+ try {
+ player.start();
+ } catch (MediaException me) {
+ // continue
+ }
currentThread = null;
}
}
- private byte[] takeSnapshot() throws MediaException {
- VideoControl videoControl = zXingMIDlet.getVideoControl();
- byte[] snapshot = null;
- try {
- snapshot = videoControl.getSnapshot(null);
- } catch (MediaException me) {
- }
- if (snapshot == null) {
- // Fall back on JPEG; seems that some cameras default to PNG even
- // when PNG isn't supported!
- snapshot = videoControl.getSnapshot("encoding=jpeg");
- if (snapshot == null) {
- throw new MediaException("Can't obtain a snapshot");
- }
- }
- return snapshot;
- }
+ private byte[] takeSnapshot() throws MediaException {
+ VideoControl videoControl = zXingMIDlet.getVideoControl();
+ byte[] snapshot = null;
+ try {
+ snapshot = videoControl.getSnapshot(null);
+ } catch (MediaException me) {
+ }
+ if (snapshot == null) {
+ // Fall back on JPEG; seems that some cameras default to PNG even
+ // when PNG isn't supported!
+ snapshot = videoControl.getSnapshot("encoding=jpeg");
+ if (snapshot == null) {
+ throw new MediaException("Can't obtain a snapshot");
+ }
+ }
+ return snapshot;
+ }
}
}
}
- private static Player createPlayer() throws IOException, MediaException {
- // Try a workaround for Nokias, which want to use capture://image in some cases
- Player player = null;
- String platform = System.getProperty("microedition.platform");
- if (platform != null && platform.indexOf("Nokia") >= 0) {
- try {
- player = Manager.createPlayer("capture://image");
- } catch (MediaException me) {
- // if this fails, just continue with capture://video
- } catch (Error e) {
+ private static Player createPlayer() throws IOException, MediaException {
+ // Try a workaround for Nokias, which want to use capture://image in some cases
+ Player player = null;
+ String platform = System.getProperty("microedition.platform");
+ if (platform != null && platform.indexOf("Nokia") >= 0) {
+ try {
+ player = Manager.createPlayer("capture://image");
+ } catch (MediaException me) {
+ // if this fails, just continue with capture://video
+ } catch (Error e) {
// Ugly, but, it seems the Nokia N70 throws "java.lang.Error: 136" here
// We should still try to continue
}
- }
- if (player == null) {
- player = Manager.createPlayer("capture://video");
- }
- return player;
- }
+ }
+ if (player == null) {
+ player = Manager.createPlayer("capture://video");
+ }
+ return player;
+ }
protected void pauseApp() {
if (player != null) {
player.stop();
} catch (MediaException me) {
// continue?
- showError(me);
+ showError(me);
}
}
}
protected void destroyApp(boolean unconditional) {
if (player != null) {
- videoControl = null;
+ videoControl = null;
try {
player.stop();
} catch (MediaException me) {
private void showOpenURL(String title, final String display, final String uri) {
Alert alert = new Alert(title, display, null, AlertType.CONFIRMATION);
alert.setTimeout(Alert.FOREVER);
- Command yes = new Command("Yes", Command.OK, 1);
+ Command yes = new Command("Yes", Command.OK, 1);
alert.addCommand(yes);
Command no = new Command("No", Command.CANCEL, 1);
alert.addCommand(no);
}
}
- void showError(String message) {
- showAlert(new Alert("Error", message, null, AlertType.ERROR));
- }
+ void showError(String message) {
+ showAlert(new Alert("Error", message, null, AlertType.ERROR));
+ }
private void showAlert(Alert alert) {
Display display = Display.getDisplay(this);
String email = ((EmailAddressResult) result).getEmailAddress();
showOpenURL("Compose E-mail?", email, "mailto:" + email);
} else if (type.equals(ParsedReaderResultType.UPC)) {
- String upc = ((UPCParsedResult) result).getUPC();
- String uri = "http://www.upcdatabase.com/item.asp?upc=" + upc;
- showOpenURL("Look Up Barcode Online?", upc, uri);
+ String upc = ((UPCParsedResult) result).getUPC();
+ String uri = "http://www.upcdatabase.com/item.asp?upc=" + upc;
+ showOpenURL("Look Up Barcode Online?", upc, uri);
} else {
showAlert("Barcode Detected", result.getDisplayResult());
}
<target name="init">
<tstamp/>
- <fail message="Please build 'core' first">
+ <fail message="Please build 'core' first">
<condition>
<not>
<available file="../core/core.jar" type="file"/>
package com.google.zxing.client.j2se;
-import com.google.zxing.MonochromeBitmapSource;
import com.google.zxing.BlackPointEstimationMethod;
+import com.google.zxing.MonochromeBitmapSource;
import com.google.zxing.common.BitArray;
import com.google.zxing.common.BlackPointEstimator;
* <p>An implementation based upon {@link BufferedImage}. This provides access to the
* underlying image as if it were a monochrome image. Behind the scenes, it is evaluating
* the luminance of the underlying image by retrieving its pixels' RGB values.</p>
- *
+ *
* @author srowen@google.com (Sean Owen), Daniel Switkin (dswitkin@google.com)
*/
public final class BufferedImageMonochromeBitmapSource implements MonochromeBitmapSource {
private int blackPoint;
private BlackPointEstimationMethod lastMethod;
private int lastArgument;
-
+
private static final int LUMINANCE_BITS = 5;
private static final int LUMINANCE_SHIFT = 8 - LUMINANCE_BITS;
private static final int LUMINANCE_BUCKETS = 1 << LUMINANCE_BITS;
int width = image.getWidth();
int height = image.getHeight();
int[] histogram = new int[LUMINANCE_BUCKETS];
- float biasTowardsWhite = 1.0f;
+ float biasTowardsWhite = 1.0f;
if (method.equals(BlackPointEstimationMethod.TWO_D_SAMPLING)) {
int minDimension = width < height ? width : height;
int startI = height == minDimension ? 0 : (height - width) >> 1;
if (argument < 0 || argument >= height) {
throw new IllegalArgumentException("Row is not within the image: " + argument);
}
- biasTowardsWhite = 2.0f;
+ biasTowardsWhite = 2.0f;
int[] rgbArray = new int[width];
image.getRGB(0, argument, width, 1, rgbArray, 0, width);
for (int x = 0; x < width; x++) {
/**
* Utility application for evaluating the effectiveness of the
* MonochromeBitmapSource. Given a set of images on the command line,
- * converts each to a black-and-white GIF. The result is placed in
+ * converts each to a black-and-white GIF. The result is placed in
* a file based on the input name, with "_converted" appended.
*
* @author alasdair@google.com (Alasdair Mackintosh)
MonochromeBitmapSource src = new BufferedImageMonochromeBitmapSource(image);
int width = src.getWidth();
int height = src.getHeight();
-
+
BufferedImage result = new BufferedImage(width, height, BufferedImage.TYPE_BYTE_BINARY);
for (int i = 0; i < width; i++) {
for (int j = 0; j < height; j++) {
- result.setRGB(i, j, src.isBlack(i,j) ? BLACK : WHITE);
+ result.setRGB(i, j, src.isBlack(i, j) ? BLACK : WHITE);
}
}
String name = uri.getPath();
int slashPos = name.lastIndexOf((int) '/');
String parent, basename;
- if (slashPos != -1 && slashPos != name.length()-1) {
+ if (slashPos != -1 && slashPos != name.length() - 1) {
parent = name.substring(0, slashPos);
- basename = name.substring(slashPos+1);
+ basename = name.substring(slashPos + 1);
} else {
parent = ".";
basename = name;
return null;
}
- File baseFile = new File(parent,basename);
+ File baseFile = new File(parent, basename);
if (!baseFile.exists()) {
return null;
}
</not>
</condition>
</fail>
- <fail message="Please build target 'build-basic' in 'javame' first">
+ <fail message="Please build target 'build-basic' in 'javame' first">
<condition>
<not>
<available file="../javame/ZXingReaderBasic.jar" type="file"/>
projects / zxing.git / commitdiff