Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 439 for setCss (0.11 sec)

  1. src/main/java/org/codelibs/fess/util/PrunedTag.java

                    && StringUtils.compare(attrValue, other.attrValue) == 0;
        }
    
        public void setId(final String id) {
            this.id = id;
        }
    
        public void setCss(final String css) {
            this.css = css;
        }
    
        public void setAttr(final String name, final String value) {
            attrName = name;
            attrValue = value;
        }
    
        @Override
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Fri Oct 11 21:11:58 UTC 2024
    - 4.8K bytes
    - Viewed (0)
  2. src/test/java/org/codelibs/fess/util/PrunedTagTest.java

            PrunedTag prunedtag = new PrunedTag(tag);
            prunedtag.setAttr(attrName, attrValue);
            prunedtag.setId(id);
            prunedtag.setCss(css);
            assertEquals("PrunedTag [tag=" + tag + ", id=" + id + ", css=" + css + ", attrName=" + attrName + ", attrValue=" + attrValue + "]",
                    prunedtag.toString());
        }
    
        public void test_parse() {
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Feb 22 01:37:57 UTC 2024
    - 3.2K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/Sets.java

        return CartesianSet.create(sets);
      }
    
      /**
       * Returns every possible list that can be formed by choosing one element from each of the given
       * sets in order; the "n-ary <a href="http://en.wikipedia.org/wiki/Cartesian_product">Cartesian
       * product</a>" of the sets. For example:
       *
       * <pre>{@code
       * Sets.cartesianProduct(
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 21 14:28:19 UTC 2024
    - 78.8K bytes
    - Viewed (0)
  4. cmd/erasure-sets.go

    func (s *erasureSets) StorageInfo(ctx context.Context) StorageInfo {
    	var storageInfo madmin.StorageInfo
    
    	storageInfos := make([]madmin.StorageInfo, len(s.sets))
    
    	g := errgroup.WithNErrs(len(s.sets))
    	for index := range s.sets {
    		index := index
    		g.Go(func() error {
    			storageInfos[index] = s.sets[index].StorageInfo(ctx)
    			return nil
    		}, index)
    	}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Sep 27 10:41:37 UTC 2024
    - 37K bytes
    - Viewed (1)
  5. internal/config/config.go

    	ErrConfigGeneric
    }
    
    // Error creates an error message and wraps
    // it with the error type specified in the type parameter
    func Error[T ErrorConfig, PT interface {
    	*T
    	setMsg(string)
    }](format string, vals ...interface{},
    ) T {
    	pt := PT(new(T))
    	pt.setMsg(fmt.Sprintf(format, vals...))
    	return *pt
    }
    
    // Errorf formats an error and returns it as a generic config error
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Sep 03 18:23:41 UTC 2024
    - 37.7K bytes
    - Viewed (0)
  6. cmd/routers.go

    	// Register peer REST router only if its a distributed setup.
    	registerPeerRESTHandlers(router, commonGrid)
    
    	// Register bootstrap REST router for distributed setups.
    	registerBootstrapRESTHandlers(commonGrid)
    
    	// Register distributed namespace lock routers.
    	registerLockRESTHandlers(lockGrid)
    
    	// Add lock grid to router
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Jul 29 18:10:04 UTC 2024
    - 3.9K bytes
    - Viewed (0)
  7. internal/http/dial_linux.go

    		return nil
    	}
    }
    
    // DialContext is a function to make custom Dial for internode communications
    type DialContext func(ctx context.Context, network, address string) (net.Conn, error)
    
    // NewInternodeDialContext setups a custom dialer for internode communication
    func NewInternodeDialContext(dialTimeout time.Duration, opts TCPOptions) DialContext {
    	return func(ctx context.Context, network, addr string) (net.Conn, error) {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Jul 23 10:53:03 UTC 2024
    - 5K bytes
    - Viewed (0)
  8. guava/src/com/google/common/collect/ImmutableRangeSet.java

       * such a set can be performed efficiently, but others (such as {@link Set#hashCode} or {@link
       * Collections#frequency}) can cause major performance problems.
       *
       * <p>The returned set's {@link Object#toString} method returns a shorthand form of the set's
       * contents, such as {@code "[1..100]}"}.
       *
       * @throws IllegalArgumentException if neither this range nor the domain has a lower bound, or if
       *     neither has an upper bound
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 27K bytes
    - Viewed (0)
  9. impl/maven-core/src/main/java/org/apache/maven/execution/MavenExecutionRequest.java

        MavenExecutionRequest setResumeFrom(String project);
    
        String getResumeFrom();
    
        MavenExecutionRequest setMakeBehavior(String makeBehavior);
    
        String getMakeBehavior();
    
        /**
         * Set's the parallel degree of concurrency used by the build.
         *
         * @param degreeOfConcurrency
         */
        void setDegreeOfConcurrency(int degreeOfConcurrency);
    
        /**
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 18.4K bytes
    - Viewed (0)
  10. cmd/erasure.go

    	rootDiskCount := 0
    	for _, di := range disksInfo {
    		if di.RootDisk {
    			rootDiskCount++
    		}
    	}
    
    	// Count offline disks as well to ensure consistent
    	// reportability of offline drives on local setups.
    	if len(disksInfo) == (rootDiskCount + offlineDisks.Sum()) {
    		// Success.
    		return onlineDisks, offlineDisks
    	}
    
    	// Root disk should be considered offline
    	for i := range disksInfo {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Oct 04 22:23:33 UTC 2024
    - 16.1K bytes
    - Viewed (0)
Back to top