- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 71 for nelem (0.03 sec)
-
gorm.go
connPool := db.ConnPool if db.Statement != nil && db.Statement.ConnPool != nil { connPool = db.Statement.ConnPool } if tx, ok := connPool.(*sql.Tx); ok && tx != nil { return (*sql.DB)(reflect.ValueOf(tx).Elem().FieldByName("db").UnsafePointer()), nil } if dbConnector, ok := connPool.(GetDBConnector); ok && dbConnector != nil { if sqldb, err := dbConnector.GetDBConn(); sqldb != nil || err != nil { return sqldb, err
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Wed Oct 09 11:29:48 UTC 2024 - 12.1K bytes - Viewed (0) -
docs/pl/docs/index.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 20 19:20:23 UTC 2024 - 19.3K bytes - Viewed (0) -
src/main/webapp/js/admin/bootstrap.min.js.map
)\n for (let i = 0, len = toggleList.length; i < len; i++) {\n const elem = toggleList[i]\n const selector = Util.getSelectorFromElement(elem)\n const filterElement = [].slice.call(document.querySelectorAll(selector))\n .filter(foundElem => foundElem === element)\n\n if (selector !== null && filterElement.length > 0) {\n this._selector = selector\n this._triggerArray.push(elem)\n }\n }\n\n this._parent = this._config.parent ? this._getParent()...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 180.9K bytes - Viewed (0) -
docs/pt/docs/deployment/docker.md
## Imagens de cont锚iner Docker tem sido uma das principais ferramentas para criar e gerenciar **imagens de cont锚iner** e **cont锚ineres**.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Mon Aug 12 21:47:53 UTC 2024 - 37.4K bytes - Viewed (0) -
src/main/webapp/js/bootstrap.min.js.map
\n for (let i = 0, len = toggleList.length; i < len; i++) {\n const elem = toggleList[i]\n const selector = Util.getSelectorFromElement(elem)\n const filterElement = [].slice.call(document.querySelectorAll(selector))\n .filter((foundElem) => foundElem === element)\n\n if (selector !== null && filterElement.length > 0) {\n this._selector = selector\n this._triggerArray.push(elem)\n }\n }\n\n this._parent = this._config.parent ? this._getParent()...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Jan 11 06:54:28 UTC 2020 - 189.9K bytes - Viewed (0) -
docs/pt/docs/advanced/security/oauth2-scopes.md
Neste exemplos n贸s estamos utilizando o fluxo de senha do OAuth2. Isso 茅 apropriado quando n贸s estamos autenticando em nossa pr贸pria aplica莽茫o, provavelmente com o nosso pr贸prio "*frontend*". Porque n贸s podemos confiar nele para receber o `username` e o `password`, pois n贸s controlamos isso.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 21.7K bytes - Viewed (0) -
docs/nl/docs/python-types.md
```Python {!../../docs_src/python_types/tutorial001.py!} ``` Het aanroepen van dit programma leidt tot het volgende resultaat: ``` John Doe ``` De functie voert het volgende uit: * Neem een `first_name` en een `last_name` * Converteer de eerste letter van elk naar een hoofdletter met `title()`. ``
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 18.3K bytes - Viewed (0) -
tensorflow/c/c_api.cc
const tensorflow::TensorShape& shape) { static char empty; int64_t nelems = 1; std::vector<int64_t> dims; dims.reserve(shape.dims()); for (int i = 0; i < shape.dims(); ++i) { dims.push_back(shape.dim_size(i)); nelems *= shape.dim_size(i); } CHECK_EQ(nelems, 0); return TF_NewTensor( dtype, reinterpret_cast<const int64_t*>(dims.data()), shape.dims(),
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Sat Oct 12 16:27:48 UTC 2024 - 102.3K bytes - Viewed (0) -
docs/pt/docs/deployment/concepts.md
Nesse caso, seria melhor obter **um servidor extra** e executar alguns processos nele para que todos tenham **RAM e tempo de CPU suficientes**.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Fri Oct 04 11:04:50 UTC 2024 - 19.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java
add(elements.next()); } return this; } private void dedupAndCoalesceAndDeleteEmpty() { dedupAndCoalesce(false); // If there was a setCount(elem, 0), those elements are still present. Eliminate them. int size = 0; for (int i = 0; i < length; i++) { if (counts[i] > 0) { elements[size] = elements[i]; counts[size] = counts[i];
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 21:21:17 UTC 2024 - 35.4K bytes - Viewed (0)