/*
- * Copyright 2007 Google Inc.
+ * Copyright 2007 ZXing authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* more quickly or accurately decode it. It is up to implementations to decide what,
* if anything, to do with the information that is supplied.
*
- * @author srowen@google.com (Sean Owen)
+ * @author Sean Owen
* @author dswitkin@google.com (Daniel Switkin)
- * @see Reader#decode(MonochromeBitmapSource, java.util.Hashtable)
+ * @see Reader#decode(BinaryBitmap,java.util.Hashtable)
*/
public final class DecodeHintType {
public static final DecodeHintType TRY_HARDER = new DecodeHintType();
/**
- * Skip the first n barcodes found. Currently applies only to 1D formats. This
- * enables a caller to repeatedly decode and find multiple barcodes. Maps
- * to an {@link Integer}.
+ * Allowed lengths of encoded data -- reject anything else. Maps to an int[].
*/
- public static final DecodeHintType SKIP_N_BARCODES = new DecodeHintType();
+ public static final DecodeHintType ALLOWED_LENGTHS = new DecodeHintType();
+
+ /**
+ * Assume Code 39 codes employ a check digit. Maps to {@link Boolean}.
+ */
+ public static final DecodeHintType ASSUME_CODE_39_CHECK_DIGIT = new DecodeHintType();
+
+ /**
+ * The caller needs to be notified via callback when a possible {@link ResultPoint}
+ * is found. Maps to a {@link ResultPointCallback}.
+ */
+ public static final DecodeHintType NEED_RESULT_POINT_CALLBACK = new DecodeHintType();
private DecodeHintType() {
}