Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 19 for twenty (0.04 sec)

  1. guava-tests/test/com/google/common/collect/ImmutableSortedMapTest.java

        IntegerDiv10 eleven = new IntegerDiv10(11);
        IntegerDiv10 twelve = new IntegerDiv10(12);
        IntegerDiv10 twenty = new IntegerDiv10(20);
        Map<IntegerDiv10, String> original =
            ImmutableSortedMap.of(three, "three", eleven, "eleven", twenty, "twenty");
        Map<IntegerDiv10, String> copy = ImmutableMap.copyOf(original);
        assertTrue(original.containsKey(twelve));
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 27.6K bytes
    - Viewed (0)
  2. docs/pl/docs/help-fastapi.md

    ### Testy
    
    * Pomóż mi sprawdzić, czy PR ma **testy**.
    
    * Sprawdź, czy testy **nie przechodzą** przed PR. 🚨
    
    * Następnie sprawdź, czy testy **przechodzą** po PR. ✅
    
    * Wiele PR-ów nie ma testów, możesz **przypomnieć** im o dodaniu testów, a nawet **zaproponować** samemu jakieś testy. To jedna z rzeczy, które pochłaniają najwięcej czasu i możesz w tym bardzo pomóc.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 14.8K bytes
    - Viewed (0)
  3. docs/pt/docs/help-fastapi.md

        * Ficar por dentro de novas ideias, artigos, e ferramentas criadas por mim.
        * Me siga para saber quando eu publicar algo novo.
    
    ## Tweete sobre **FastAPI**
    
    <a href="https://x.com/compose/tweet?text=I'm loving @fastapi because... https://github.com/fastapi/fastapi" class="external-link" target="_blank">Tweete sobre o **FastAPI**</a> e compartilhe comigo e com os outros o porque de gostar do FastAPI. 🎉
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 8.4K bytes
    - Viewed (0)
  4. docs/fr/docs/help-fastapi.md

        * Lire d'autres idées, articles, et sur les outils que j'ai créés.
        * Suivez-moi pour lire quand je publie quelque chose de nouveau.
    
    ## Tweeter sur **FastAPI**
    
    <a href="https://x.com/compose/tweet?text=I'm loving FastAPI because... https://github.com/fastapi/fastapi cc @tiangolo" class="external-link" target="_blank">Tweetez à propos de **FastAPI**</a> et faites-moi savoir, ainsi qu'aux autres, pourquoi vous aimez ça. 🎉
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 5.7K bytes
    - Viewed (0)
  5. docs/en/docs/help-fastapi.md

        * Read other ideas, articles, and read about tools I have created.
        * Follow me to read when I publish something new.
    
    ## Tweet about **FastAPI** { #tweet-about-fastapi }
    
    <a href="https://x.com/compose/tweet?text=I'm loving @fastapi because... https://github.com/fastapi/fastapi" class="external-link" target="_blank">Tweet about **FastAPI**</a> and let me and others know why you like it. 🎉
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 14K bytes
    - Viewed (0)
  6. src/main/java/jcifs/smb/DirFileEntryEnumIterator1.java

    class DirFileEntryEnumIterator1 extends DirFileEntryEnumIteratorBase {
    
        private static final Logger log = LoggerFactory.getLogger(DirFileEntryEnumIterator1.class);
        private static final int FIND_OVERHEAD = 100; // plenty enough
    
        private Trans2FindNext2 nextRequest;
        private Trans2FindFirst2Response response;
    
        public DirFileEntryEnumIterator1(final SmbTreeHandleImpl th, final SmbResource parent, final String wildcard,
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 5.1K bytes
    - Viewed (0)
  7. cmd/admin-handlers.go

    	now := time.Now().UTC()
    	entryMap := make(map[string]*madmin.LockEntry)
    	toEntry := func(lri lockRequesterInfo) string {
    		return fmt.Sprintf("%s/%s", lri.Name, lri.UID)
    	}
    	for _, peerLock := range peerLocks {
    		if peerLock == nil {
    			continue
    		}
    		for k, v := range peerLock.Locks {
    			for _, lockReqInfo := range v {
    				if val, ok := entryMap[toEntry(lockReqInfo)]; ok {
    					val.ServerList = append(val.ServerList, peerLock.Addr)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 99.6K bytes
    - Viewed (0)
  8. docs/ru/docs/help-fastapi.md

        * Подпишитесь на меня, чтобы прочитать, когда я опубликую что-нибудь новое.
    
    ## Оставить сообщение в X (Twitter) о **FastAPI**
    
    <a href="https://x.com/compose/tweet?text=I'm loving @fastapi because... https://github.com/fastapi/fastapi" class="external-link" target="_blank">Оставьте сообщение в X (Twitter) о **FastAPI**</a> и позвольте мне и другим узнать - почему он Вам нравится. 🎉
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 22.4K bytes
    - Viewed (0)
  9. docs/ja/docs/help-fastapi.md

        * アイデアや作成ツールについての記事が読めます。
        * 新規記事の執筆を通知してくれます。
    
    ## **FastAPI** に関するツイート
    
    <a href="https://x.com/compose/tweet?text=I'm loving FastAPI because... https://github.com/fastapi/fastapi cc @tiangolo" class="external-link" target="_blank">**FastAPI** についてツイート</a>し、開発者や他の人にどこが気に入ったのか教えてください。🎉
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 5.9K bytes
    - Viewed (0)
  10. src/test/java/org/codelibs/fess/exception/InvalidAccessTokenExceptionTest.java

            String type = "VeryLongTokenTypeNameForTestingPurposes";
            String message =
                    "This is a very long error message that describes in detail why the access token is invalid and what went wrong during validation";
            InvalidAccessTokenException exception = new InvalidAccessTokenException(type, message);
    
            assertEquals(type, exception.getType());
            assertEquals(message, exception.getMessage());
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 10.4K bytes
    - Viewed (0)
Back to top