- Sort Score
- Num 10 results
- Language All
Results 71 - 80 of 230 for tablas (0.05 seconds)
-
android/guava-testlib/src/com/google/common/testing/ArbitraryInstances.java
import com.google.common.collect.SortedMapDifference; import com.google.common.collect.SortedMultiset; import com.google.common.collect.SortedSetMultimap; import com.google.common.collect.Table; import com.google.common.collect.Tables; import com.google.common.collect.TreeBasedTable; import com.google.common.collect.TreeMultimap; import com.google.common.io.ByteSink; import com.google.common.io.ByteSource;
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 23 17:50:58 GMT 2025 - 20.9K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/AbstractTable.java
return row(rowKey).put(columnKey, value); } @Override public void putAll(Table<? extends R, ? extends C, ? extends V> table) { for (Table.Cell<? extends R, ? extends C, ? extends V> cell : table.cellSet()) { put(cell.getRowKey(), cell.getColumnKey(), cell.getValue()); } } @LazyInit private transient @Nullable Set<Cell<R, C, V>> cellSet;
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Aug 09 01:14:59 GMT 2025 - 6K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* prevention and <i>no</i> expectation of bit dispersion. This leaves them perfectly suitable for * use in hash tables, because extra collisions cause only a slight performance hit, while poor bit * dispersion is easily corrected using a secondary hash function (which all reasonable hash table * implementations in Java use). For the many uses of hash functions beyond data structures,
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
guava/src/com/google/common/hash/HashFunction.java
* prevention and <i>no</i> expectation of bit dispersion. This leaves them perfectly suitable for * use in hash tables, because extra collisions cause only a slight performance hit, while poor bit * dispersion is easily corrected using a secondary hash function (which all reasonable hash table * implementations in Java use). For the many uses of hash functions beyond data structures,
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
okhttp-idna-mapping-table/src/main/kotlin/okhttp3/internal/idn/GenerateIdnaMappingTableCode.kt
fun loadIdnaMappingTableData(): IdnaMappingTableData { val path = "/okhttp3/internal/idna/IdnaMappingTable.txt".toPath() val table = FileSystem.RESOURCES.read(path) { readPlainTextIdnaMappingTable() } return buildIdnaMappingTableData(table) } /** * Generate a file containing the mapping table's string literals, like this: * * ``` * internal val IDNA_MAPPING_TABLE: IdnaMappingTable = IdnaMappingTable(
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Wed Mar 19 19:25:20 GMT 2025 - 2.8K bytes - Click Count (1) -
docs/fr/docs/project-generation.md
* Frontend **Vue** : * Généré avec Vue CLI. * Gestion de l'**Authentification JWT**. * Page de connexion. * Après la connexion, page de tableau de bord principal. * Tableau de bord principal avec création et modification d'utilisateurs. * Modification de ses propres caractéristiques utilisateur. * **Vuex**. * **Vue-router**.Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Mon Jul 29 23:35:07 GMT 2024 - 6.7K bytes - Click Count (0) -
tests/test_tutorial/test_sql_databases/test_tutorial002.py
from sqlalchemy import StaticPool from sqlmodel import SQLModel, create_engine from sqlmodel.main import default_registry from tests.utils import needs_py310 def clear_sqlmodel(): # Clear the tables in the metadata for the default base model SQLModel.metadata.clear() # Clear the Models associated with the registry, to avoid warnings default_registry.dispose() @pytest.fixture( name="client",
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat Dec 27 18:19:10 GMT 2025 - 17.9K bytes - Click Count (0) -
guava-testlib/src/com/google/common/testing/ArbitraryInstances.java
import com.google.common.collect.SortedMapDifference; import com.google.common.collect.SortedMultiset; import com.google.common.collect.SortedSetMultimap; import com.google.common.collect.Table; import com.google.common.collect.Tables; import com.google.common.collect.TreeBasedTable; import com.google.common.collect.TreeMultimap; import com.google.common.io.ByteSink; import com.google.common.io.ByteSource;
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 23 17:50:58 GMT 2025 - 21.4K bytes - Click Count (0) -
docs/de/docs/tutorial/sql-databases.md
### Mehrere Modelle erstellen { #create-multiple-models } In **SQLModel** ist jede Modellklasse, die `table=True` hat, ein **Tabellenmodell**. Und jede Modellklasse, die `table=True` nicht hat, ist ein **Datenmodell**, diese sind tatsächlich nur Pydantic-Modelle (mit ein paar kleinen zusätzlichen Funktionen). 🤓Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Tue Dec 02 17:32:56 GMT 2025 - 18.1K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactHashing.java
} } static void tableClear(Object table) { if (table instanceof byte[]) { Arrays.fill((byte[]) table, (byte) 0); } else if (table instanceof short[]) { Arrays.fill((short[]) table, (short) 0); } else { Arrays.fill((int[]) table, 0); } } /** * Returns {@code table[index]}, where {@code table} is actually a {@code byte[]}, {@code
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Aug 11 19:31:30 GMT 2025 - 7K bytes - Click Count (0)