- Sort Score
- Num 10 results
- Language All
Results 241 - 250 of 293 for Franco (0.05 seconds)
-
docs/pt/docs/tutorial/dependencies/index.md
Isso é bastante útil quando você precisa: * Definir uma lógica compartilhada (mesmo formato de código repetidamente). * Compartilhar conexões com banco de dados. * Aplicar regras de segurança, autenticação, papéis de usuários, etc. * E muitas outras coisas... Tudo isso, enquanto minimizamos a repetição de código. ## Primeiros passos { #first-steps }
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:20:43 GMT 2026 - 10.6K bytes - Click Count (0) -
src/test/java/jcifs/netbios/NameServicePacketTest.java
assertEquals(expectedString, packet.toString()); // Test recordName == questionName branch in toString packet.recordName = packet.questionName; expectedString =
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 17.9K bytes - Click Count (0) -
src/test/java/jcifs/smb/SmbResourceLocatorImplTest.java
NetbiosAddress nb = mock(NetbiosAddress.class); when(addr.unwrap(NetbiosAddress.class)).thenReturn(nb); when(nb.getNameType()).thenReturn(0x1d); // workgroup code // getFirstAddress branch: host given and path non-root -> possibleNTDomain=false when(nsc.getAllByName(eq("server"), eq(false))).thenReturn(new Address[] { addr }); SmbResourceLocatorImpl workgroupLike = locator("smb://server/");
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 17.6K bytes - Click Count (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
*/ if (approxCmp > 0) { /* * The code is written so that even completely incorrect approximations will still yield the * correct answer eventually, but in practice this branch should almost never be entered, and * even then the loop should not run more than once. */ do { approxLog10--; approxPow = approxPow.divide(BigInteger.TEN);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 18.8K bytes - Click Count (0) -
docs/es/docs/async.md
Pero aún así, la experiencia final no es la mejor. 😞 --- Esta sería la historia equivalente de las hamburguesas paralelas. 🍔 Para un ejemplo más "de la vida real" de esto, imagina un banco. Hasta hace poco, la mayoría de los bancos tenían múltiples cajeros 👨💼👨💼👨💼👨💼 y una gran fila 🕙🕙🕙🕙🕙🕙🕙🕙. Todos los cajeros haciendo todo el trabajo con un cliente tras otro 👨💼⏯.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:15:55 GMT 2026 - 24.8K bytes - Click Count (0) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 89.9K bytes - Click Count (0) -
android/guava/src/com/google/common/math/DoubleMath.java
public static boolean fuzzyEquals(double a, double b, double tolerance) { MathPreconditions.checkNonNegative("tolerance", tolerance); return Math.copySign(a - b, 1.0) <= tolerance // copySign(x, 1.0) is a branch-free version of abs(x), but with different NaN semantics || (a == b) // needed to ensure that infinities equal themselves || (Double.isNaN(a) && Double.isNaN(b)); } /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 19.3K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
KeyList<K, V> keyList = requireNonNull(keyToKeyList.remove(node.getKey())); keyList.count = 0; modCount++; } else { // requireNonNull is safe (under the conditions listed in the comment in the branch above). KeyList<K, V> keyList = requireNonNull(keyToKeyList.get(node.getKey())); keyList.count--; if (node.previousSibling == null) {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 26.6K bytes - Click Count (0) -
guava/src/com/google/common/collect/LinkedListMultimap.java
KeyList<K, V> keyList = requireNonNull(keyToKeyList.remove(node.getKey())); keyList.count = 0; modCount++; } else { // requireNonNull is safe (under the conditions listed in the comment in the branch above). KeyList<K, V> keyList = requireNonNull(keyToKeyList.get(node.getKey())); keyList.count--; if (node.previousSibling == null) {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 27K bytes - Click Count (0) -
CONTRIBUTING.md
`pip install -U tf-nightly` * Rebase your pull request onto a recent pull from [TensorFlow's](https://github.com/tensorflow/tensorflow) master branch. 2. If you are changing the code and the docstring of a class/function/method, then you will need to [build TensorFlow from source](https://www.tensorflow.org/install/source).Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Sat Jan 11 04:47:59 GMT 2025 - 15.9K bytes - Click Count (0)