EMPTY_ARRAY, MEMORY_CALCULATE| 限定符和类型 | 方法和说明 |
|---|---|
void |
commit()
This record has been committed.
|
int |
getByteCount(Data dummy)
Get the number of bytes required for the data.
|
int |
getColumnCount()
Get the column count.
|
Row |
getCopy()
Get a copy of the row that is distinct from (not equal to) this row.
|
long |
getKey()
Get the unique key of the row.
|
int |
getMemory()
Get the estimated memory used for this row, in bytes.
|
int |
getSessionId()
Get session id.
|
Value |
getValue(int i)
Get the value for the column
|
Value[] |
getValueList()
Get values.
|
int |
getVersion()
Get the version of the row.
|
boolean |
isDeleted()
Check if the row is deleted.
|
boolean |
isEmpty()
Check if this is an empty row.
|
void |
setDeleted(boolean deleted)
Mark the row as deleted.
|
void |
setKey(long key)
Set the unique key of the row.
|
void |
setKeyAndVersion(SearchRow row)
Set the position and version to match another row.
|
void |
setSessionId(int sessionId)
Set session id.
|
void |
setValue(int i,
Value v)
Set the value for given column
|
void |
setVersion(int version)
Set version.
|
String |
toString() |
public RowImpl(Value[] data, int memory)
public Row getCopy()
public void setKeyAndVersion(SearchRow row)
SearchRowsetKeyAndVersion 在接口中 SearchRowrow - the other row.public int getVersion()
SearchRowgetVersion 在接口中 SearchRowpublic void setVersion(int version)
RowsetVersion 在接口中 Rowversion - row versionpublic long getKey()
SearchRowpublic void setKey(long key)
SearchRowpublic int getByteCount(Data dummy)
getByteCount 在接口中 Rowdummy - the template bufferpublic boolean isEmpty()
Rowpublic int getColumnCount()
SearchRowgetColumnCount 在接口中 SearchRowpublic int getMemory()
SearchRowpublic void setDeleted(boolean deleted)
RowsetDeleted 在接口中 Rowdeleted - deleted flagpublic void setSessionId(int sessionId)
RowsetSessionId 在接口中 RowsessionId - the session idpublic int getSessionId()
RowgetSessionId 在接口中 Rowpublic void commit()
public boolean isDeleted()
Rowpublic Value[] getValueList()
RowgetValueList 在接口中 RowCopyright © 2017. All rights reserved.