- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for is (0.12 sec)
-
guava-tests/test/com/google/common/cache/LocalCacheTest.java
* 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, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 14 23:06:48 GMT 2024 - 112.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/LocalCacheTest.java
* 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, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 14 23:06:48 GMT 2024 - 110.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
// will be resized. That threshold is ceilingPowerOfTwo(capacity*loadFactor), where // loadFactor is 0.75 by default. So with the calculation here we ensure that the // threshold is equal to ceilingPowerOfTwo(expectedSize). There is a separate code // path when the first operation on the new map is putAll(otherMap). There, prior to // https://github.com/openjdk/jdk/commit/3e393047e12147a81e2899784b943923fc34da8e, a bug
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 159.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ClosingFuture.java
* block or a {@link ListenableFuture}. * <li>Each other step is derived from one or more input steps. At each step, zero or more objects * can be captured for later closing. * <li>There is one last step (the root of the tree), from which you can extract the final result * of the computation. After that result is available (or the computation fails), all objects
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 98.5K bytes - Viewed (0)