Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 275 for uniques (0.04 sec)

  1. android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java

          int uniques = 1;
          for (int i = 1; i < sortedElements.length; i++) {
            if (comparator.compare(sortedElements[uniques - 1], sortedElements[i]) < 0) {
              sortedElements[uniques] = sortedElements[i];
              uniques++;
            }
          }
          Arrays.fill(sortedElements, uniques, length, null);
          if (maybeExpand && uniques * 4 > length * 3) {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 35.2K bytes
    - Viewed (0)
  2. src/main/java/org/codelibs/fess/helper/UserInfoHelper.java

                return userCode;
            }
            return null;
        }
    
        /**
         * Generates a new unique identifier for user tracking.
         * Creates a UUID and removes hyphens to create a clean identifier string.
         *
         * @return a new unique identifier string
         */
        protected String getId() {
            return UUID.randomUUID().toString().replace("-", StringUtil.EMPTY);
        }
    
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 14.9K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/fess/helper/JobHelper.java

            });
        }
    
        /**
         * Finds a scheduled job by its unique identifier.
         *
         * @param jobUnique the unique identifier of the job
         * @return an optional containing the scheduled job if found, empty otherwise
         */
        private OptionalThing<LaScheduledJob> findJobByUniqueOf(final LaJobUnique jobUnique) {
            final JobManager jobManager = ComponentUtil.getJobManager();
            try {
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Fri Nov 28 16:29:12 UTC 2025
    - 10.9K bytes
    - Viewed (0)
  4. schema/index.go

    							return
    						}
    						subName = composite
    					}
    					name = field.Schema.namer.IndexName(
    						field.Schema.Table, subName)
    				}
    
    				if (k == "UNIQUEINDEX") || settings["UNIQUE"] != "" {
    					settings["CLASS"] = "UNIQUE"
    				}
    
    				priority, err := strconv.Atoi(settings["PRIORITY"])
    				if err != nil {
    					priority = 10
    				}
    
    				indexes = append(indexes, Index{
    					Name:    name,
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Wed May 21 02:35:56 UTC 2025
    - 3.8K bytes
    - Viewed (0)
  5. docs/en/docs/advanced/generate-clients.md

    In this case, you will have to ensure that each operation ID is **unique** in some other way.
    
    For example, you could make sure that each *path operation* has a tag, and then generate the operation ID based on the **tag** and the *path operation* **name** (the function name).
    
    ### Custom Generate Unique ID Function { #custom-generate-unique-id-function }
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 10.1K bytes
    - Viewed (1)
  6. tests/table_test.go

    		if err != nil {
    			t.Fatalf("failed to parse user unique, got error %v", err)
    		}
    
    		constraints := user.ParseUniqueConstraints()
    		if len(constraints) != 1 {
    			t.Fatalf("failed to find unique constraint, got %v", constraints)
    		}
    
    		for key := range constraints {
    			if len(key) != 63 {
    				t.Errorf("failed to find unique constraint, got %v", constraints)
    			}
    		}
    	})
    
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Mon Jul 21 02:46:58 UTC 2025
    - 12.7K bytes
    - Viewed (0)
  7. tests/migrate_test.go

    		if field == nil {
    			t.Fatalf("%v: failed to find column %q", utils.FileWithLineNum(), fieldName)
    		}
    		if field.Unique != unique {
    			t.Fatalf("%v: %q column %q unique should be %v but got %v", utils.FileWithLineNum(), stmt.Schema.Table, fieldName, unique, field.Unique)
    		}
    		if field.UniqueIndex != uniqueIndex {
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Wed Aug 20 04:51:17 UTC 2025
    - 65.2K bytes
    - Viewed (0)
  8. src/test/java/jcifs/dcerpc/DcerpcErrorTest.java

            faultCodes.add(DcerpcError.DCERPC_FAULT_UNK_IF);
            faultCodes.add(DcerpcError.DCERPC_FAULT_PROTO_ERROR);
    
            // Verify all 9 codes are unique
            assertEquals(9, faultCodes.size(), "All fault codes should be unique");
        }
    
        @Test
        @DisplayName("Should verify fault code value ranges and patterns")
        void testFaultCodeValueRanges() {
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 7K bytes
    - Viewed (0)
  9. fess-crawler/src/main/java/org/codelibs/fess/crawler/entity/UrlQueue.java

     */
    public interface UrlQueue<IDTYPE> {
    
        /**
         * Retrieves the unique identifier of the URL queue.
         *
         * @return the unique identifier of type IDTYPE.
         */
        IDTYPE getId();
    
        /**
         * Sets the unique identifier for the URL queue.
         *
         * @param id the unique identifier to set
         */
        void setId(IDTYPE id);
    
        /**
    Registered: Sat Dec 20 11:21:39 UTC 2025
    - Last Modified: Sat Mar 15 06:52:00 UTC 2025
    - 4.3K bytes
    - Viewed (0)
  10. tests/test_tutorial/test_path_operation_configurations/test_tutorial003_tutorial004.py

        "tutorial004": dedent("""
            Create an item with all the information:
    
            - **name**: each item must have a name
            - **description**: a long description
            - **price**: required
            - **tax**: if the item doesn't have tax, you can omit this
            - **tags**: a set of unique tag strings for this item
        """).strip(),
    }
    
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Fri Dec 26 10:43:02 UTC 2025
    - 7K bytes
    - Viewed (0)
Back to top