public LuaValue setmetatable(LuaValue metatable) { boolean hadWeakKeys = m_metatable != null && m_metatable.useWeakKeys(); boolean hadWeakValues = m_metatable != null && m_metatable.useWeakValues(); m_metatable = metatableOf( metatable ); if ( ( hadWeakKeys != ( m_metatable != null && m_metatable.useWeakKeys() )) || ( hadWeakValues != ( m_metatable != null && m_metatable.useWeakValues() ))) { // force a rehash rehash( 0 ); } return this; }
public LuaValue setmetatable(LuaValue metatable) { boolean hadWeakKeys = m_metatable != null && m_metatable.useWeakKeys(); boolean hadWeakValues = m_metatable != null && m_metatable.useWeakValues(); m_metatable = metatableOf( metatable ); if ( ( hadWeakKeys != ( m_metatable != null && m_metatable.useWeakKeys() )) || ( hadWeakValues != ( m_metatable != null && m_metatable.useWeakValues() ))) { // force a rehash rehash( 0 ); } return this; }
@Override public LuaValue setmetatable(LuaValue metatable) { boolean hadWeakKeys = m_metatable != null && m_metatable.useWeakKeys(); boolean hadWeakValues = m_metatable != null && m_metatable.useWeakValues(); m_metatable = metatableOf( metatable ); if ( ( hadWeakKeys != ( m_metatable != null && m_metatable.useWeakKeys() )) || ( hadWeakValues != ( m_metatable != null && m_metatable.useWeakValues() ))) { // force a rehash rehash( 0 ); } return this; }
/** Sort the table using a comparator. * @param comparator {@link LuaValue} to be called to compare elements. */ public void sort(LuaValue comparator) { if (m_metatable != null && m_metatable.useWeakValues()) { dropWeakArrayValues(); } int n = array.length; while ( n > 0 && array[n-1] == null ) --n; if ( n > 1 ) heapSort(n, comparator); }
/** Sort the table using a comparator. * @param comparator {@link LuaValue} to be called to compare elements. */ public void sort(LuaValue comparator) { if (m_metatable != null && m_metatable.useWeakValues()) { dropWeakArrayValues(); } int n = array.length; while ( n > 0 && array[n-1] == null ) --n; if ( n > 1 ) heapSort(n, comparator); }
/** Sort the table using a comparator. * @param comparator {@link LuaValue} to be called to compare elements. */ public void sort(LuaValue comparator) { if (m_metatable != null && m_metatable.useWeakValues()) { dropWeakArrayValues(); } int n = array.length; while ( n > 0 && array[n-1] == null ) --n; if ( n > 1 ) heapSort(n, comparator); }
private void rehash(int newKey) { if ( m_metatable != null && ( m_metatable.useWeakKeys() || m_metatable.useWeakValues() )) { if ( m_metatable.useWeakValues() ) { dropWeakArrayValues();
private void rehash(int newKey) { if ( m_metatable != null && ( m_metatable.useWeakKeys() || m_metatable.useWeakValues() )) { if ( m_metatable.useWeakValues() ) { dropWeakArrayValues();
private void rehash(int newKey) { if ( m_metatable != null && ( m_metatable.useWeakKeys() || m_metatable.useWeakValues() )) { if ( m_metatable.useWeakValues() ) { dropWeakArrayValues();