private boolean verifyMultiValue(String value, Set<String> newVals) { if (!newVals.isEmpty()) newVals.clear(); String[] arr = value.split(multiValueSeparator); for (int i = 0; i < arr.length; i++) { String s = arr[i].trim(); if (s.isEmpty()) continue; int idx = indexOf(s); if (idx == -1) { return false; } newVals.add(s); } return true; }
private boolean verifyMultiValue(String value, Set<String> newVals) { if (!newVals.isEmpty()) newVals.clear(); String[] arr = value.split(multiValueSeparator); for (int i = 0; i < arr.length; i++) { String s = arr[i].trim(); if (s.isEmpty()) continue; int idx = indexOf(s); if (idx == -1) { return false; } newVals.add(s); } return true; }
private boolean verifyMultiValue(String value, Set<String> newVals) { if (!newVals.isEmpty()) newVals.clear(); String[] arr = value.split(multiValueSeparator); for (int i = 0; i < arr.length; i++) { String s = arr[i].trim(); if (s.isEmpty()) continue; int idx = indexOf(s); if (idx == -1) { return false; } newVals.add(s); } return true; }
/** * Remove the first option that matches the given value */ public void removeOption(String value) { int indexOf = indexOf(value); if (indexOf >= 0) { int i = getSelectedIndex(); if (i == indexOf) internSetSelectedIndex(-1); select.removeItem(indexOf); } }
/** * Remove the first option that matches the given value */ public void removeOption(String value) { int indexOf = indexOf(value); if (indexOf >= 0) { int i = getSelectedIndex(); if (i == indexOf) internSetSelectedIndex(-1); select.removeItem(indexOf); } }
/** * Remove the first option that matches the given value */ public void removeOption(String value) { int indexOf = indexOf(value); if (indexOf >= 0) { int i = getSelectedIndex(); if (i == indexOf) internSetSelectedIndex(-1); select.removeItem(indexOf); } }
public void setSelectedValue(String value, boolean ignoreCase) { if (value == null) { setSelectedIndex(-1); return; } if (!ignoreCase) { int i = indexOf(value); setSelectedIndex(i); return; } else { int i = indexOf(value); if (i >= 0) { setSelectedIndex(i); return; } } // Can be optimized with search index as well, but it's expensive to support additional index for (int k = 0; k < select.getItemCount(); k++) { String v = select.getValue(k); boolean eq = value.equalsIgnoreCase(v); if (eq) { setSelectedIndex(k); return; } } }
public void setSelectedValue(String value, boolean ignoreCase) { if (value == null) { setSelectedIndex(-1); return; } if (!ignoreCase) { int i = indexOf(value); setSelectedIndex(i); return; } else { int i = indexOf(value); if (i >= 0) { setSelectedIndex(i); return; } } // Can be optimized with search index as well, but it's expensive to support additional index for (int k = 0; k < select.getItemCount(); k++) { String v = select.getValue(k); boolean eq = value.equalsIgnoreCase(v); if (eq) { setSelectedIndex(k); return; } } }
private void tryResolveDelayed() { if (delayedValue == null) return; if (!isMultiple()) { int newIdx = indexOf(delayedValue); if (newIdx == -1) return; boolean fireEvents = delayedFireEvents != null ? delayedFireEvents : false; setNewSelectedIndex(newIdx, fireEvents); } else { Set<String> newVals = new HashSet<String>(); if (!verifyMultiValue(delayedValue, newVals)) return; boolean fireEvents = delayedFireEvents != null ? delayedFireEvents : false; clearDelayed(); setNewMultiVals(newVals, fireEvents); } }
private void tryResolveDelayed() { if (delayedValue == null) return; if (!isMultiple()) { int newIdx = indexOf(delayedValue); if (newIdx == -1) return; boolean fireEvents = delayedFireEvents != null ? delayedFireEvents : false; setNewSelectedIndex(newIdx, fireEvents); } else { Set<String> newVals = new HashSet<String>(); if (!verifyMultiValue(delayedValue, newVals)) return; boolean fireEvents = delayedFireEvents != null ? delayedFireEvents : false; clearDelayed(); setNewMultiVals(newVals, fireEvents); } }
public void setSelectedValue(String value, boolean ignoreCase) { if (value == null) { setSelectedIndex(-1); return; } if (!ignoreCase) { int i = indexOf(value); setSelectedIndex(i); return; } else { int i = indexOf(value); if (i >= 0) { setSelectedIndex(i); return; } } // Can be optimized with search index as well, but it's expensive to support additional index for (int k = 0; k < select.getItemCount(); k++) { String v = select.getValue(k); boolean eq = value.equalsIgnoreCase(v); if (eq) { setSelectedIndex(k); return; } } }
private void tryResolveDelayed() { if (delayedValue == null) return; if (!isMultiple()) { int newIdx = indexOf(delayedValue); if (newIdx == -1) return; boolean fireEvents = delayedFireEvents != null ? delayedFireEvents : false; setNewSelectedIndex(newIdx, fireEvents); } else { Set<String> newVals = new HashSet<String>(); if (!verifyMultiValue(delayedValue, newVals)) return; boolean fireEvents = delayedFireEvents != null ? delayedFireEvents : false; clearDelayed(); setNewMultiVals(newVals, fireEvents); } }
public void setValue(String value, boolean fireEvents) { if (!isMultiple()) { int newIdx = value == null ? -1 : indexOf(value); setNewSelectedIndex(newIdx, fireEvents); if (newIdx == -1 && value != null) {
public void setValue(String value, boolean fireEvents) { if (!isMultiple()) { int newIdx = value == null ? -1 : indexOf(value); setNewSelectedIndex(newIdx, fireEvents); if (newIdx == -1 && value != null) {
public void setValue(String value, boolean fireEvents) { if (!isMultiple()) { int newIdx = value == null ? -1 : indexOf(value); setNewSelectedIndex(newIdx, fireEvents); if (newIdx == -1 && value != null) {