- Sort Score
- Result 10 results
- Languages All
Results 1241 - 1250 of 7,715 for and (0.01 sec)
-
LICENSES/vendor/github.com/godbus/dbus/v5/LICENSE
All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Jun 24 16:39:50 UTC 2020 - 1.4K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/thumbnail/impl/HtmlTagBasedGenerator.java
* referenced in HTML documents. This generator extracts images from HTML content * and processes them to create thumbnail images based on configured dimensions * and format settings. * * <p>The generator validates image MIME types, processes image data through * ImageIO operations, and applies scaling and cropping to generate thumbnails * that meet the specified size requirements.</p> * */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 10.4K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/util/WebApiUtil.java
* governing permissions and limitations under the License. */ package org.codelibs.fess.util; import org.codelibs.fess.exception.WebApiException; import org.lastaflute.web.util.LaRequestUtil; /** * Utility class for web API operations. * Provides functionality for setting and retrieving objects from request attributes, * error handling, and validation in web API context. */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
* * <p><b>Note:</b> if mutability is not required and the elements are non-null, use {@link * ImmutableList#copyOf(Iterable)} instead. (Or, change {@code elements} to be a {@link * FluentIterable} and call {@code elements.toList()}.) * * <p><b>Performance note:</b> {@link ArrayList} and {@link java.util.ArrayDeque} consistently * outperform {@code LinkedList} except in certain rare and specific situations. Unless you haveRegistered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 42.2K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/exception/WebApiExceptionTest.java
* governing permissions and limitations under the License. */ package org.codelibs.fess.exception; import org.codelibs.fess.unit.UnitFessTestCase; public class WebApiExceptionTest extends UnitFessTestCase { public void test_constructor_withStatusCodeAndMessage() { // Test constructor with status code and message int statusCode = 404;Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Tue Aug 19 14:09:36 UTC 2025 - 9.3K bytes - Viewed (0) -
.github/ISSUE_TEMPLATE/feature_addition_request.yaml
required: true - label: > I have read and understood the [contribution guidelines](https://github.com/google/guava/wiki/HowToContribute#feature-requests). required: true - label: > I have read and understood [Guava's philosophy](https://github.com/google/guava/wiki/PhilosophyExplained), and I strongly believe that this proposal aligns with it.Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Nov 17 18:47:47 UTC 2023 - 5.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
// Every node is, at a minimum, reachable from itself. Since the resulting transitive closure // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) {Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
// Every node is, at a minimum, reachable from itself. Since the resulting transitive closure // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) {Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/ArrayTable.java
* * <p>The allowed row and column keys must be supplied when the table is created. The table always * contains a mapping for every row key / column pair. The value corresponding to a given row and * column is null unless another value is provided. * * <p>The table's size is constant: the product of the number of supplied row keys and the number of
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 13 19:39:21 UTC 2025 - 26.8K bytes - Viewed (0) -
cmd/encryption-v1.go
} // As per AWS S3 Spec, ETag for SSE-C encrypted objects need not be MD5Sum of the data. // Since server side copy with same source and dest just replaces the ETag, we save // encrypted content MD5Sum as ETag for both SSE-C and SSE-KMS, we standardize the ETag // encryption across SSE-C and SSE-KMS, and only return last 32 bytes for SSE-C
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 37.8K bytes - Viewed (0)