@Namespace(value="cv")
public static class opencv_core.Hamming
extends org.bytedeco.javacpp.Pointer
| Modifier and Type | Field and Description |
|---|---|
static int |
normType
enum cv::Hamming::
|
| Constructor and Description |
|---|
Hamming()
Default native constructor.
|
Hamming(long size)
Native array allocator.
|
Hamming(org.bytedeco.javacpp.Pointer p)
Pointer cast constructor.
|
| Modifier and Type | Method and Description |
|---|---|
int |
apply(byte[] a,
byte[] b,
int size) |
int |
apply(ByteBuffer a,
ByteBuffer b,
int size) |
int |
apply(org.bytedeco.javacpp.BytePointer a,
org.bytedeco.javacpp.BytePointer b,
int size)
this will count the bits in a ^ b
|
opencv_core.Hamming |
position(long position) |
address, asBuffer, asByteBuffer, availablePhysicalBytes, calloc, capacity, capacity, close, deallocate, deallocate, deallocateReferences, deallocator, deallocator, equals, fill, formatBytes, free, hashCode, isNull, limit, limit, malloc, maxBytes, maxPhysicalBytes, memchr, memcmp, memcpy, memmove, memset, offsetof, parseBytes, physicalBytes, position, put, realloc, setNull, sizeof, toString, totalBytes, totalPhysicalBytes, withDeallocator, zeropublic static final int normType
public Hamming()
public Hamming(long size)
Pointer.position(long).public Hamming(org.bytedeco.javacpp.Pointer p)
Pointer.Pointer(Pointer).public opencv_core.Hamming position(long position)
position in class org.bytedeco.javacpp.Pointer@Cast(value="cv::Hamming::ResultType")
@Name(value="operator ()")
public int apply(@Cast(value="const unsigned char*")
org.bytedeco.javacpp.BytePointer a,
@Cast(value="const unsigned char*")
org.bytedeco.javacpp.BytePointer b,
int size)
@Cast(value="cv::Hamming::ResultType")
@Name(value="operator ()")
public int apply(@Cast(value="const unsigned char*")
ByteBuffer a,
@Cast(value="const unsigned char*")
ByteBuffer b,
int size)
@Cast(value="cv::Hamming::ResultType")
@Name(value="operator ()")
public int apply(@Cast(value="const unsigned char*")
byte[] a,
@Cast(value="const unsigned char*")
byte[] b,
int size)
Copyright © 2018. All rights reserved.