- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 35 for touches (0.06 sec)
-
guava/src/com/google/common/graph/ValueGraph.java
*/ @Override Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 16K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
*/ @Override Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 13.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graph.java
*/ @Override Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 13.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
*/ Set<E> outEdges(N node); /** * Returns the count of {@code node}'s {@link #incidentEdges(Object) incident edges}, counting * self-loops twice (equivalently, the number of times an edge touches {@code node}). * * <p>For directed networks, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected networks, this is equal to {@code incidentEdges(node).size()} + (number of
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 22.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
*/ Set<E> outEdges(N node); /** * Returns the count of {@code node}'s {@link #incidentEdges(Object) incident edges}, counting * self-loops twice (equivalently, the number of times an edge touches {@code node}). * * <p>For directed networks, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected networks, this is equal to {@code incidentEdges(node).size()} + (number of
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 21.1K bytes - Viewed (0) -
docs/fr/docs/features.md
Inversement, dans la plupart des cas vous pourrez juste envoyer l'objet récupéré de la base de données **directement au client** Avec **FastAPI** vous aurez toutes les fonctionnalités de **Pydantic** (comme FastAPI est basé sur Pydantic pour toutes les manipulations de données): * **Pas de prise de tête**: * Pas de nouveau langage de définition de schéma à apprendre.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Tue Aug 06 04:48:30 UTC 2024 - 11.1K bytes - Viewed (0) -
.teamcity/mvnw
# For Cygwin, ensure paths are in UNIX format before anything is touched if $cygwin ; then [ -n "$M2_HOME" ] && M2_HOME=`cygpath --unix "$M2_HOME"` [ -n "$JAVA_HOME" ] && JAVA_HOME=`cygpath --unix "$JAVA_HOME"` [ -n "$CLASSPATH" ] && CLASSPATH=`cygpath --path --unix "$CLASSPATH"` fi # For Mingw, ensure paths are in UNIX format before anything is touched if $mingw ; then [ -n "$M2_HOME" ] &&
Registered: Wed Nov 06 11:36:14 UTC 2024 - Last Modified: Wed Feb 26 01:48:39 UTC 2020 - 9.8K bytes - Viewed (0) -
docs/fr/docs/alternatives.md
J'ai évité la création d'un nouveau framework pendant plusieurs années. J'ai d'abord essayé de combler toutes les fonctionnalités couvertes par **FastAPI** en utilisant de nombreux frameworks, plug-ins et outils différents. Mais à un moment donné il n'y avait pas d'autre option que de créer quelque chose qui offrait toutes ces fonctionnalités, en reprenant et en combinant de la meilleure façon possible les meilleures idées des outils
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 20 19:20:23 UTC 2024 - 27.6K bytes - Viewed (0) -
docs/fr/docs/async.md
Donc, pendant ce temps, l'ordinateur pourra effectuer d'autres tâches, pendant que "fichier-lent" 📝 se termine. Ensuite l'ordinateur / le programme 🤖 reviendra à chaque fois qu'il en a la chance que ce soit parce qu'il attend à nouveau, ou car il 🤖 a fini tout le travail qu'il avait à faire. Il 🤖 regardera donc si les tâches qu'il attend ont terminé d'être effectuées.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Tue Aug 06 04:48:30 UTC 2024 - 25.4K bytes - Viewed (0) -
src/main/resources/fess_label_fr.properties
labels.threadName = Nom du fil labels.url = URL labels.userFavorite = Journal favori labels.userInfo = informations utilisateur labels.webApiJson = Réponse JSON labels.webConfigName = Nom de la configuration Web labels.allLanguages = Toutes les langues labels.dictId = ID de dictionnaire labels.docId = Identifiant du document labels.endTime = Heure de fin labels.hq = hq labels.inputs = Source labels.jobLogging = Journalisation labels.jobName = Nom
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Fri Mar 22 11:58:34 UTC 2024 - 46.6K bytes - Viewed (0)