- Sort Score
- Result 10 results
- Languages All
Results 751 - 760 of 2,808 for unit (0.1 sec)
-
docs/de/docs/async.md
Und da die meiste Ausführungszeit durch tatsächliche Arbeit (anstatt durch Warten) in Anspruch genommen wird und die Arbeit in einem Computer von einer <abbr title="Central Processing Unit – Zentrale Recheneinheit">CPU</abbr> erledigt wird, werden diese Probleme als „CPU-lastig“ („CPU bound“) bezeichnet. ---
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:56:21 UTC 2025 - 26.5K bytes - Viewed (0) -
docs/zh-hant/docs/async.md
無論輪流執行與否(並行),你都需要相同的工時完成任務,同時需要執行相同工作量。 但是,在這種情境下,如果你可以邀請8位前收銀員/廚師(現在是清潔工)來幫忙,每個人(加上你)負責房子的某個區域,這樣你就可以 **平行** 地更快完成工作。 在這個場景中,每個清潔工(包括你)都是一個處理器,完成工作的一部分。 由於大多數的執行時間都花在實際的工作上(而不是等待),而電腦中的工作由 <abbr title="Central Processing Unit">CPU</abbr> 完成,因此這些問題被稱為「CPU 密集型」。 --- 常見的 CPU 密集型操作範例包括那些需要進行複雜數學計算的任務。 例如: * **音訊**或**圖像處理**; * **電腦視覺**:一張圖片由數百萬個像素組成,每個像素有 3 個值/顏色,處理這些像素通常需要同時進行大量計算;
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:56:21 UTC 2025 - 21.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/IteratorsTest.java
import java.util.RandomAccess; import java.util.Set; import java.util.Vector; import junit.framework.AssertionFailedError; import junit.framework.Test; import junit.framework.TestCase; import junit.framework.TestSuite; import org.jspecify.annotations.NullMarked; import org.jspecify.annotations.Nullable; /** * Unit test for {@code Iterators}. * * @author Kevin Bourrillion */ @GwtCompatible @NullMarkedRegistered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 54.4K bytes - Viewed (0) -
src/main/webapp/js/jquery-3.7.1.min.js
set(this):at.propHooks._default.set(this),this}}).init.prototype=at.prototype,(at.propHooks={_default:{get:function(e){var t;return 1!==e.elem.nodeType||null!=e.elem[e.prop]&&null==e.elem.style[e.prop]?e.elem[e.prop]:(t=ce.css(e.elem,e.prop,""))&&"auto"!==t?t:0},set:function(e){ce.fx.step[e.prop]?ce.fx.step[e.prop](e):1!==e.elem.nodeType||!ce.cssHooks[e.prop]&&null==e.elem.style[Ze(e.prop)]?e.elem[e.prop]=e.now:ce.style(e.elem,e.prop,e.now+e.unit)}}}).scrollTop=at.propHooks.scrollLeft={set:funct...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:07:52 UTC 2024 - 85.5K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/riscv64.s
VSETIVLI $0, E32, M1, TA, MA, X12 // 577600cd VSETIVLI $15, E32, M1, TA, MA, X12 // 57f607cd VSETIVLI $31, E32, M1, TA, MA, X12 // 57f60fcd VSETVL X10, X11, X12 // 57f6a580 // 31.7.4: Vector Unit-Stride Instructions VLE8V (X10), V3 // 87010502 VLE8V (X10), V0, V3 // 87010500 VLE16V (X10), V3 // 87510502 VLE16V (X10), V0, V3 // 87510500 VLE32V (X10), V3 // 87610502
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed May 21 14:19:19 UTC 2025 - 49.1K bytes - Viewed (0) -
src/main/java/org/codelibs/core/io/CopyUtil.java
import org.codelibs.core.exception.IORuntimeException; import org.codelibs.core.net.URLUtil; import org.codelibs.core.nio.ChannelUtil; /** * Utility for copying. * <p> * The combinations of input and output types and the unit of elements copied are as follows: * </p> * <table border="1"> * <caption>Elements for copying instances</caption> * <tr> * <th rowspan="2">Input type</th> * <th colspan="4">Output type</th> * </tr> * <tr>
Registered: Fri Sep 05 20:58:11 UTC 2025 - Last Modified: Thu Jul 31 08:16:49 UTC 2025 - 45.2K bytes - Viewed (0) -
src/archive/zip/testdata/unix.zip
Russ Cox <******@****.***> 1410149331 -0400
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon Sep 08 04:08:51 UTC 2014 - 620 bytes - Viewed (0) -
docs/ko/docs/async.md
이 시나리오에서, (당신을 포함한) 각각의 청소부들은 프로세서가 될 것이고, 각자의 역할을 수행합니다. 실행 시간의 대부분이 대기가 아닌 실제 작업에 소요되고, 컴퓨터에서 작업은 <abbr title="Central Processing Unit">CPU</abbr>에서 이루어지므로, 이러한 문제를 "CPU에 묶였"다고 합니다. --- CPU에 묶인 연산에 관한 흔한 예시는 복잡한 수학 처리를 필요로 하는 경우입니다. 예를 들어: * **오디오** 또는 **이미지** 처리.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:56:21 UTC 2025 - 26.7K bytes - Viewed (0) -
src/main/webapp/css/admin/adminlte.min.css.map
$result: $result + 1;\n }\n }\n $result: $result * $factor * $sign;\n $dividend-unit: unit($dividend);\n $divisor-unit: unit($divisor);\n $unit-map: (\n \"px\": 1px,\n \"rem\": 1rem,\n \"em\": 1em,\n \"%\": 1%\n );\n @if ($dividend-unit != $divisor-unit and map-has-key($unit-map, $dividend-unit)) {\n $result: $result * map-get($unit-map, $dividend-unit);\n }\n @return $result;\n}\n\n// Remove px-unit from $rfs-base-font-size for calculations\n@if $rfs-base-font-size-unit == \"px\"...Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 3.7M bytes - Viewed (3) -
android/guava/src/com/google/common/base/CharMatcher.java
return super.toString(); } /** * Returns the Java Unicode escape sequence for the given {@code char}, in the form "\u12AB" where * "12AB" is the four hexadecimal digits representing the 16-bit code unit. */ private static String showCharacter(char c) { String hex = "0123456789ABCDEF"; char[] tmp = {'\\', 'u', '\0', '\0', '\0', '\0'}; for (int i = 0; i < 4; i++) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 53.9K bytes - Viewed (0)