Lines Matching refs:cur
266 * @param cur The original array, or null to represent an empty array.
271 public static int[] appendInt(int[] cur, int val) {
272 if (cur == null) {
275 final int N = cur.length;
277 if (cur[i] == val) {
278 return cur;
282 System.arraycopy(cur, 0, ret, 0, N);
287 public static int[] removeInt(int[] cur, int val) {
288 if (cur == null) {
291 final int N = cur.length;
293 if (cur[i] == val) {
296 System.arraycopy(cur, 0, ret, 0, i);
299 System.arraycopy(cur, i + 1, ret, i, N - i - 1);
304 return cur;
310 * @param cur The original array, or null to represent an empty array.
315 public static long[] appendLong(long[] cur, long val) {
316 if (cur == null) {
319 final int N = cur.length;
321 if (cur[i] == val) {
322 return cur;
326 System.arraycopy(cur, 0, ret, 0, N);
331 public static long[] removeLong(long[] cur, long val) {
332 if (cur == null) {
335 final int N = cur.length;
337 if (cur[i] == val) {
340 System.arraycopy(cur, 0, ret, 0, i);
343 System.arraycopy(cur, i + 1, ret, i, N - i - 1);
348 return cur;
355 public static <T> ArraySet<T> add(ArraySet<T> cur, T val) {
356 if (cur == null) {
357 cur = new ArraySet<>();
359 cur.add(val);
360 return cur;
363 public static <T> ArraySet<T> remove(ArraySet<T> cur, T val) {
364 if (cur == null) {
367 cur.remove(val);
368 if (cur.isEmpty()) {
371 return cur;
375 public static <T> boolean contains(ArraySet<T> cur, T val) {
376 return (cur != null) ? cur.contains(val) : false;
379 public static <T> ArrayList<T> add(ArrayList<T> cur, T val) {
380 if (cur == null) {
381 cur = new ArrayList<>();
383 cur.add(val);
384 return cur;
387 public static <T> ArrayList<T> remove(ArrayList<T> cur, T val) {
388 if (cur == null) {
391 cur.remove(val);
392 if (cur.isEmpty()) {
395 return cur;
399 public static <T> boolean contains(ArrayList<T> cur, T val) {
400 return (cur != null) ? cur.contains(val) : false;