wagon.connect(
                    new Repository(repository.getId(), repository.getUrl()),
                    authenticationInfo(repository),
                    proxyInfo(repository));

        } else if (repository.getAuthentication() != null) {
            wagon.connect(new Repository(repository.getId(), repository.getUrl()), authenticationInfo(repository));

              stats[2]++;
              break;
            case SIZE:
              stats[3]++;
              break;
            default:
              throw new IllegalStateException("No collected exceptions in GWT CacheBuilder.");
          }
        };

    Cache<Integer, Integer> cache =
        CacheBuilder.newBuilder()
            .expireAfterWrite(1000, MILLISECONDS)

 * 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,

        assertArrayEquals(new String[] { "reading1" }, itemReadings[0]);
    }

    @Test
    public void testToSuggestItemWithNullTagsAndRoles() {
        // Test toSuggestItem when tags and roles are null (converted to empty lists)
        String word = "null tags and roles";
        float boost = 1.0f;
        List<String> readings = Arrays.asList("reading1");
        List<String> fields = Arrays.asList("field1");

			actualDNToParentUserMap[ldapActualDN] = cred.ParentUser
		}
		parentUserToCredsMap[cred.ParentUser] = append(parentUserToCredsMap[cred.ParentUser], cred)
	}

	// 2. Query LDAP server for groups of the LDAP users collected.
	updatedGroups, err := sys.LDAPConfig.LookupGroupMemberships(parentUserActualDNList, actualDNToLDAPUsernameMap)
	if err != nil {
		// Log and return on error - perhaps it'll work the next time.

 *   <li><b>Warning:</b> a view collection such as {@link ImmutableMap#keySet} or {@link
 *       ImmutableList#subList} may retain a reference to the entire data set, preventing it from
 *       being garbage collected. If some of the data is no longer reachable through other means,
 *       this constitutes a memory leak. Pass the view collection to the appropriate {@code copyOf}
 *       method to obtain a correctly-sized copy.

   *
   * <p><b>Note:</b> in almost all circumstances, the returned {@link ImmutableList} retains a
   * strong reference to {@code this}, which may prevent the original list from being garbage
   * collected. If you want the original list to be eligible for garbage collection, you should
   * create and use a copy of the sub list (e.g., {@code
   * ImmutableList.copyOf(originalList.subList(...))}).
   */
  @Override

     * operation();
     * for (Lock lock : locks) {
     *   lock.unlock();
     * }
     *
     * If we only held the int[] stripes, translating it on the fly to L's, the original locks might
     * be garbage collected after locking them, ending up in a huge mess.
     */
    @SuppressWarnings("unchecked") // we carefully replaced all keys with their respective L's
    List<L> asStripes = (List<L>) result;

     * If the object is a string, a list containing that string is returned.
     * If the object is a list, it is cast to a list of strings and returned.
     * </p>
     *
     * @param value the object to be converted to a list of strings
     * @return a list of strings representing the given object
     * @throws IllegalArgumentException if the object is not a string or a list
     */
    @SuppressWarnings("unchecked")

Un `engine` SQLModel (en dessous c'est en fait un `engine` SQLAlchemy) est ce qui **détient les connexions** à la base de données.

Vous devez avoir **un seul objet `engine`** pour tout votre code afin de se connecter à la même base.

{* ../../docs_src/sql_databases/tutorial001_an_py310.py ln[14:18] hl[14:15,17:18] *}