Search Options

Results per page
Sort
Preferred Languages
Advance

Results 191 - 200 of 2,020 for checkID (0.07 sec)

  1. docs/en/docs/tutorial/security/simple-oauth2.md

    Prefer to use the `Annotated` version if possible.
    
    ///
    
    ```Python hl_lines="3  77-79"
    {!> ../../docs_src/security/tutorial003.py!}
    ```
    
    ////
    
    ### Check the password
    
    At this point we have the user data from our database, but we haven't checked the password.
    
    Let's put that data in the Pydantic `UserInDB` model first.
    
    You should never save plaintext passwords, so, we'll use the (fake) password hashing system.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 12.3K bytes
    - Viewed (0)
  2. cmd/erasure-healing-common_test.go

    		if !testCase.time.Equal(ctime) {
    			t.Errorf("Test case %d, expect to pass but failed. Wanted modTime: %s, got modTime: %s\n", i+1, testCase.time, ctime)
    		}
    	}
    }
    
    // TestListOnlineDisks - checks if listOnlineDisks and outDatedDisks
    // are consistent with each other.
    func TestListOnlineDisks(t *testing.T) {
    	if runtime.GOOS == globalWindowsOSName {
    		t.Skip()
    	}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 01 15:19:10 UTC 2024
    - 23.1K bytes
    - Viewed (0)
  3. common/scripts/setup_env.sh

    if [[ -f "${HOME}/.netrc" ]]; then
      CONDITIONAL_HOST_MOUNTS+="--mount type=bind,source=${HOME}/.netrc,destination=/home/.netrc,readonly "
    fi
    
    # echo ${CONDITIONAL_HOST_MOUNTS}
    
    # This function checks if the file exists. If it does, it creates a randomly named host location
    # for the file, adds it to the host KUBECONFIG, and creates a mount for it. Note that we use a copy
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Wed Nov 06 04:52:54 UTC 2024
    - 8.3K bytes
    - Viewed (0)
  4. tensorflow/c/c_api_experimental.h

    TF_CAPI_EXPORT extern void TFE_AbortCollectiveOps(TFE_Context* ctx,
                                                      TF_Status* status);
    
    // Checks the health of collective ops peers. Explicit health check is needed in
    // multi worker collective ops to detect failures in the cluster.  If a peer is
    // down, collective ops may hang.
    TF_CAPI_EXPORT extern void TFE_CollectiveOpsCheckPeerHealth(
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Thu Apr 27 21:07:00 UTC 2023
    - 15.1K bytes
    - Viewed (0)
  5. docs/en/docs/alternatives.md

    These features are what Marshmallow was built to provide. It is a great library, and I have used it a lot before.
    
    But it was created before there existed Python type hints. So, to define every <abbr title="the definition of how data should be formed">schema</abbr> you need to use specific utils and classes provided by Marshmallow.
    
    /// check | "Inspired **FastAPI** to"
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 20 19:20:23 UTC 2024
    - 23.2K bytes
    - Viewed (0)
  6. docs/en/docs/contributing.md

    Check the docs about <a href="https://help.github.com/en/github/collaborating-with-issues-and-pull-requests/about-pull-request-reviews" class="external-link" target="_blank">adding a pull request review</a> to approve it or request changes.
    
    ///
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Aug 25 02:44:06 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/TreeMultiset.java

    import java.util.Comparator;
    import java.util.ConcurrentModificationException;
    import java.util.Iterator;
    import java.util.NoSuchElementException;
    import javax.annotation.CheckForNull;
    import org.checkerframework.checker.nullness.qual.Nullable;
    
    /**
     * A multiset which maintains the ordering of its elements, according to either their natural order
     * or an explicit {@link Comparator}. In all cases, this implementation uses {@link
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 34.1K bytes
    - Viewed (0)
  8. guava/src/com/google/common/collect/TreeMultiset.java

    import java.util.ConcurrentModificationException;
    import java.util.Iterator;
    import java.util.NoSuchElementException;
    import java.util.function.ObjIntConsumer;
    import javax.annotation.CheckForNull;
    import org.checkerframework.checker.nullness.qual.Nullable;
    
    /**
     * A multiset which maintains the ordering of its elements, according to either their natural order
     * or an explicit {@link Comparator}. In all cases, this implementation uses {@link
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 34.5K bytes
    - Viewed (0)
  9. guava/src/com/google/common/collect/Multiset.java

    import java.util.List;
    import java.util.Set;
    import java.util.Spliterator;
    import java.util.function.Consumer;
    import java.util.function.ObjIntConsumer;
    import javax.annotation.CheckForNull;
    import org.checkerframework.checker.nullness.qual.Nullable;
    
    /**
     * A collection that supports order-independent equality, like {@link Set}, but may have duplicate
     * elements. A multiset is also sometimes called a <i>bag</i>.
     *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Jun 17 14:40:53 UTC 2023
    - 21K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/FluentIterable.java

    import java.util.Comparator;
    import java.util.Iterator;
    import java.util.List;
    import java.util.SortedSet;
    import javax.annotation.CheckForNull;
    import org.checkerframework.checker.nullness.qual.NonNull;
    import org.checkerframework.checker.nullness.qual.Nullable;
    
    /**
     * An expanded {@code Iterable} API, providing functionality similar to Java 8's powerful <a href=
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Sep 24 13:42:31 UTC 2024
    - 35.7K bytes
    - Viewed (0)
Back to top