Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 61 - 70 of 9,038 for copy (0.03 seconds)

  1. src/main/java/org/codelibs/core/beans/util/BeanUtil.java

     * copyBeanToBean(srcBean, destBean);
     * </pre>
     * <p>
     * It is also possible to copy from a JavaBean to a {@link Map} or from a {@link Map} to a JavaBean.
     * </p>
     *
     * <pre>
     * copyBeanToMap(srcBean, destMap);
     * copyMapToBean(srcMap, destBean);
     * </pre>
     * <p>
     * You can also create a new instance of the destination JavaBean or {@link Map} and copy to it.
     * </p>
     *
     * <pre>
    Created: Fri Apr 03 20:58:12 GMT 2026
    - Last Modified: Thu Jul 31 08:16:49 GMT 2025
    - 23.5K bytes
    - Click Count (0)
  2. guava-tests/test/com/google/common/collect/HashMultisetTest.java

        Multiset<Multiset<?>> multiset = HashMultiset.create();
        multiset.add(multiset, 2);
        Multiset<Multiset<?>> copy = SerializableTester.reserialize(multiset);
        assertEquals(2, copy.size());
        assertThat(copy.iterator().next()).isSameInstanceAs(copy);
      }
    
      @J2ktIncompatible
      @GwtIncompatible // Only used by @GwtIncompatible code
      private static class MultisetHolder implements Serializable {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Mar 13 13:01:07 GMT 2026
    - 4.6K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/util/concurrent/GwtFluentFutureCatchingSpecialization.java

     */
    @GwtCompatible
    @J2ktIncompatible // Super-sourced
    abstract class GwtFluentFutureCatchingSpecialization<V extends @Nullable Object>
        extends AbstractFuture<V> {
      /*
       * This server copy of the class is empty. The corresponding GWT copy contains alternative
       * versions of catching() and catchingAsync() with slightly different signatures from the ones
       * found in FluentFuture.java.
       */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 1.4K bytes
    - Click Count (0)
  4. src/test/java/org/codelibs/fess/dict/synonym/SynonymItemTest.java

    /*
     * Copyright 2012-2025 CodeLibs Project and the Others.
     *
     * Licensed under the Apache License, Version 2.0 (the "License");
     * you may not use this file except in compliance with the License.
     * You may obtain a copy of the License at
     *
     *     http://www.apache.org/licenses/LICENSE-2.0
     *
     * Unless required by applicable law or agreed to in writing, software
     * distributed under the License is distributed on an "AS IS" BASIS,
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Jan 11 08:43:05 GMT 2026
    - 8K bytes
    - Click Count (1)
  5. android/guava/src/com/google/common/util/concurrent/GwtFuturesCatchingSpecialization.java

     * different signatures.
     */
    @GwtCompatible
    @J2ktIncompatible // Super-sourced
    abstract class GwtFuturesCatchingSpecialization {
      /*
       * This server copy of the class is empty. The corresponding GWT copy contains alternative
       * versions of catching() and catchingAsync() with slightly different signatures from the ones
       * found in Futures.java.
       */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 1.4K bytes
    - Click Count (0)
  6. android/guava-testlib/src/com/google/common/testing/SerializableTester.java

       *     or if the hashcodes are different.
       */
      @CanIgnoreReturnValue
      public static <T> T reserializeAndAssert(T object) {
        T copy = reserialize(object);
        new EqualsTester().addEqualityGroup(object, copy).testEquals();
        Assert.assertEquals(object.getClass(), copy.getClass());
        return copy;
      }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Dec 21 14:50:24 GMT 2024
    - 4.1K bytes
    - Click Count (0)
  7. samples/guide/src/main/java/okhttp3/recipes/kt/PerCallSettings.kt

    /*
     * Copyright (C) 2014 Square, Inc.
     *
     * Licensed under the Apache License, Version 2.0 (the "License");
     * you may not use this file except in compliance with the License.
     * You may obtain a copy of the License at
     *
     *      http://www.apache.org/licenses/LICENSE-2.0
     *
     * Unless required by applicable law or agreed to in writing, software
     * distributed under the License is distributed on an "AS IS" BASIS,
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Mar 19 19:25:20 GMT 2025
    - 1.7K bytes
    - Click Count (0)
  8. LICENSE

    appropriately publish on each copy an appropriate copyright notice;
    keep intact all notices stating that this License and any
    non-permissive terms added in accord with section 7 apply to the code;
    keep intact all notices of the absence of any warranty; and give all
    recipients a copy of this License along with the Program.
    
      You may charge any price or no price for each copy that you convey,
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Apr 23 18:58:53 GMT 2021
    - 33.7K bytes
    - Click Count (0)
  9. samples/guide/src/main/java/okhttp3/recipes/PerCallSettings.java

    /*
     * Copyright (C) 2014 Square, Inc.
     *
     * Licensed under the Apache License, Version 2.0 (the "License");
     * you may not use this file except in compliance with the License.
     * You may obtain a copy of the License at
     *
     *      http://www.apache.org/licenses/LICENSE-2.0
     *
     * Unless required by applicable law or agreed to in writing, software
     * distributed under the License is distributed on an "AS IS" BASIS,
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun May 22 01:29:42 GMT 2016
    - 1.9K bytes
    - Click Count (0)
  10. internal/ringbuffer/ring_buffer.go

    		return 0, ErrIsEmpty
    	}
    
    	if r.w > r.r {
    		n = min(r.w-r.r, len(p))
    		copy(p, r.buf[r.r:r.r+n])
    		r.r = (r.r + n) % r.size
    		return n, err
    	}
    
    	n = min(r.size-r.r+r.w, len(p))
    
    	if r.r+n <= r.size {
    		copy(p, r.buf[r.r:r.r+n])
    	} else {
    		c1 := r.size - r.r
    		copy(p, r.buf[r.r:r.size])
    		c2 := n - c1
    		copy(p[c1:], r.buf[0:c2])
    	}
    	r.r = (r.r + n) % r.size
    
    	r.isFull = false
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 13.3K bytes
    - Click Count (0)
Back to Top