- Sort Score
- Result 10 results
- Languages All
Results 851 - 860 of 1,302 for nach (0.11 sec)
-
impl/maven-core/lifecycle-executor.txt
We have a lifecycle mapping for the packaging of *jar* below. You see that for this packaging we have a *default* lifecycle and a list of phases where each phase is a comma separated list of goals to run and they are in the form groupId:artifactId:version. <configuration> <lifecycles> <lifecycle> <id>default</id> <phases> <process-resources>org.apache.maven.plugins:maven-resources-plugin:resources</process-resources>
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
} private static final int ENDPOINT = -2; /** * Contains the link pointers corresponding with the entries, in the range of [0, size()). The * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are * all "null" (UNSET). *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.5K bytes - Viewed (0) -
doc/asm.html
</p> <p> Branches and direct jumps are always written as offsets to the PC, or as jumps to labels: </p> <pre> label: MOVW $0, R1 JMP label </pre> <p> Each label is visible only within the function in which it is defined. It is therefore permitted for multiple functions in a file to define and use the same label names. Direct jumps and call instructions can target text symbols,
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Tue Nov 28 19:15:27 UTC 2023 - 36.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.java
checkArgument(min <= max, "min (%s) must be less than or equal to max (%s)", min, max); return value < min ? min : value < max ? value : max; } /** * Returns the values from each provided array combined into a single array. For example, {@code * concat(new short[] {a, b}, new short[] {}, new short[] {c}} returns the array {@code {a, b, * c}}. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Aug 27 16:47:48 UTC 2024 - 25.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/LinkedListMultimap.java
extends AbstractMultimap<K, V> implements ListMultimap<K, V>, Serializable { /* * Order is maintained using a linked list containing all key-value pairs. In * addition, a series of disjoint linked lists of "siblings", each containing * the values for a specific key, is used to implement {@link * ValueForKeyIterator} in constant time. */ static final class Node<K extends @Nullable Object, V extends @Nullable Object>
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 27.5K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Shorts.java
checkArgument(min <= max, "min (%s) must be less than or equal to max (%s)", min, max); return value < min ? min : value < max ? value : max; } /** * Returns the values from each provided array combined into a single array. For example, {@code * concat(new short[] {a, b}, new short[] {}, new short[] {c}} returns the array {@code {a, b, * c}}. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Aug 27 16:47:48 UTC 2024 - 25.5K bytes - Viewed (0) -
guava/src/com/google/common/base/Verify.java
* custom message otherwise. * * @param expression a boolean expression * @param errorMessageTemplate a template for the exception message should the check fail. The * message is formed by replacing each {@code %s} placeholder in the template with an * argument. These are matched by position - the first {@code %s} gets {@code * errorMessageArgs[0]}, etc. Unmatched arguments will be appended to the formatted message in
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon May 17 14:07:47 UTC 2021 - 18.5K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraph.java
* Returns true if the edges in this graph are directed. Directed edges connect a {@link * EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while * undirected edges connect a pair of nodes to each other. */ @Override boolean isDirected(); /** * Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 16K bytes - Viewed (0) -
docs/sts/web-identity.md
OpenID Provider in the beginning. For some setups, extra configuration may be required for this step to work correctly. For a simple setup where the user/client app accesses MinIO directly (i.e. with no intervening proxies/load-balancers), and each MinIO server (if there are more than one) has a unique domain name, this redirection should work automatically with no further configuration. For example, if the MinIO service is being accessed by the browser at the URL `https://minio-node-1.example.org`,...
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Jul 10 20:16:44 UTC 2024 - 18.9K bytes - Viewed (0) -
src/main/webapp/js/admin/plugins/timepicker/bootstrap-timepicker.min.js
l.timepicker DOMMouseScroll.timepicker":a.proxy(this.mousewheel,this)}),this.template!==!1?this.$widget=a(this.getTemplate()).on("click",a.proxy(this.widgetClick,this)):this.$widget=!1,this.showInputs&&this.$widget!==!1&&this.$widget.find("input").each(function(){a(this).on({"click.timepicker":function(){a(this).select()},"keydown.timepicker":a.proxy(b.widgetKeydown,b),"keyup.timepicker":a.proxy(b.widgetKeyup,b)})}),this.setDefaultTime(this.defaultTime)},blurElement:function(){this.highlightedUn...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Thu Feb 13 04:21:06 UTC 2020 - 18.2K bytes - Viewed (0)