- Sort Score
- Num 10 results
- Language All
Results 11 - 20 of 1,280 for tail (0.02 seconds)
-
helm/minio/templates/_helper_create_svcacct.txt
if [ -z $FILENAME ]; then ${MC} admin user svcacct add --access-key $(head -1 $MINIO_ACCESSKEY_SECRETKEY_TMP) --secret-key $(tail -n1 $MINIO_ACCESSKEY_SECRETKEY_TMP) myminio $USER else ${MC} admin user svcacct add --access-key $(head -1 $MINIO_ACCESSKEY_SECRETKEY_TMP) --secret-key $(tail -n1 $MINIO_ACCESSKEY_SECRETKEY_TMP) --policy /config/$FILENAME.json myminio $USER fi else echo "Svcacct '$SVCACCT' already exists."
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Thu Mar 28 23:20:50 GMT 2024 - 3.4K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 22.4K bytes - Click Count (0) -
src/main/java/jcifs/smb1/util/MD4.java
// padding is alwas binary 1 followed by binary 0s final byte[] tail = new byte[padLen + 8]; tail[0] = (byte) 0x80; // append length before final transform: // save number of bits, casting the long to an array of 8 bytes // save low-order byte first. for (int i = 0; i < 8; i++) { tail[padLen + i] = (byte) (count * 8 >>> 8 * i); }Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 9.6K bytes - Click Count (0) -
src/test/resources/run.sh
#!/bin/bash touch $(ls -d ./fess-*/logs)/fess-crawler.log tail -f ./fess-*/logs/*.log & mvn test -P integrationTests -Dtest.fess.url="http://localhost:8080" -Dtest.search_engine.url="http://localhost:9201" ret=$? if [ $ret != 0 ] ; then for f in `find ./target -type f | grep surefire-reports | grep -v /TEST-` ; do cat $f done fi
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Feb 10 03:25:34 GMT 2024 - 353 bytes - Click Count (0) -
ci/official/utilities/rename_and_verify_wheels.sh
# List all .whl files by their modification time (ls -t) and move anything # other than the most recently-modified one (the newest one). mkdir -p $TFCI_OUTPUT_DIR/extra_wheels ls -t *.whl | tail -n +2 | xargs mv -t $TFCI_OUTPUT_DIR/extra_wheels fi # Repair wheels with auditwheel and delete the old one. if [[ "$TFCI_WHL_AUDIT_ENABLE" == "1" ]]; then
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Mon Sep 22 21:39:32 GMT 2025 - 4.4K bytes - Click Count (0) -
src/test/resources/before_script.sh
#!/bin/bash set -xuo pipefail temp_log_file=/tmp/fess-build.$$ unzip target/releases/fess-*.zip > ${temp_log_file} 2>&1 tail ${temp_log_file} ./fess-*/bin/fess > ${temp_log_file} 2>&1 & temp_json_file=/tmp/fess-log.$$ touch ${temp_json_file} error_count=0 while true ; do status=$(curl -w '%{http_code}\n' -s -o ${temp_json_file} "http://localhost:8080/api/v1/health") cat ${temp_json_file} if [[ x"${status}" = x200 ]] ; then
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Nov 15 02:26:18 GMT 2025 - 940 bytes - Click Count (0) -
guava-tests/test/com/google/common/collect/IterablesTest.java
Iterable<String> tail = skip(set, 1); set.remove("b"); set.addAll(newArrayList("A", "B", "C")); assertThat(tail).containsExactly("c", "A", "B", "C").inOrder(); } public void testSkip_structurallyModifiedSkipSomeList() throws Exception { List<String> list = newArrayList("a", "b", "c"); Iterable<String> tail = skip(list, 1); list.subList(1, 3).clear();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 47.5K bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 22.4K bytes - Click Count (0) -
guava-tests/test/com/google/common/reflect/InvokableTest.java
} static <T> Iterable<String> prepend(@NotBlank String first, Iterable<String> tail) { return Iterables.concat(ImmutableList.of(first), tail); } Iterable<String> prepend(Iterable<String> tail) throws IllegalArgumentException, NullPointerException { return Iterables.concat(Collections.nCopies(times, prefix), tail); }Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Mar 12 17:47:10 GMT 2026 - 31.1K bytes - Click Count (0) -
.teamcity/scripts/update_wrapper_and_create_pr.sh
-H "Content-Type: application/json" \ "https://api.github.com/repos/gradle/gradle$endpoint" \ -d "$data" \ -w "\n%{http_code}" \ 2>/dev/null) local http_code=$(echo "$response" | tail -n1) local body=$(echo "$response" | head -n -1) if [[ "$http_code" -ge 400 ]]; then printf "Error: HTTP %s - %s\n" "$http_code" "$body" >&2 exit 1 fi echo "$body" }Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Tue Jul 29 03:20:20 GMT 2025 - 2.9K bytes - Click Count (0)