Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1591 - 1600 of 3,115 for Code (0.03 sec)

  1. android/guava/src/com/google/common/hash/BloomFilterStrategies.java

              other.data.length());
          for (int i = 0; i < data.length(); i++) {
            putData(i, other.data.get(i));
          }
        }
    
        /**
         * ORs the bits encoded in the {@code i}th {@code long} in the underlying {@link
         * AtomicLongArray} with the given value.
         */
        void putData(int i, long longValue) {
          long ourLongOld;
          long ourLongNew;
          boolean changedAnyBits = true;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 10.6K bytes
    - Viewed (0)
  2. README.md

    # Compile the project
    mvn compile
    
    # Run tests
    mvn test
    
    # Package JAR
    mvn package
    
    # Install to local repository
    mvn install
    ```
    
    ### Code Quality Commands
    
    ```bash
    # Format code (Eclipse formatter)
    mvn formatter:format
    
    # Check/apply license headers
    mvn license:check
    mvn license:format
    
    # Generate test coverage report
    Registered: Fri Sep 19 09:08:11 UTC 2025
    - Last Modified: Sun Aug 31 03:31:14 UTC 2025
    - 12.1K bytes
    - Viewed (1)
  3. docs/distributed/DESIGN.md

    - We limited the number of drives to 16 for erasure set because, erasure code shards more than 16 can become chatty and do not have any performance advantages. Additionally since 16 drive erasure set gives you tolerance of 8 drives per object by default which is plenty in any practical scenario.
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Feb 26 09:25:50 UTC 2025
    - 8K bytes
    - Viewed (2)
  4. LICENSES/third_party/forked/gonum/graph/LICENSE

    Copyright ©2013 The gonum Authors. All rights reserved.
    
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions are met:
        * Redistributions of source code must retain the above copyright
          notice, this list of conditions and the following disclaimer.
        * Redistributions in binary form must reproduce the above copyright
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Thu Jul 08 11:48:19 UTC 2021
    - 1.5K bytes
    - Viewed (0)
  5. apache-maven/src/main/appended-resources/licenses/BSD-3-Clause.txt

    Copyright <YEAR> <COPYRIGHT HOLDER>
    
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions
    are met:
    
    1. Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
    
    2. Redistributions in binary form must reproduce the above copyright
    notice, this list of conditions and the following disclaimer in the
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri May 17 19:14:22 UTC 2024
    - 1.4K bytes
    - Viewed (1)
  6. api/maven-api-core/src/main/java/org/apache/maven/api/plugin/LifecycleProvider.java

    /**
     * Interface that can be provided by the plugin to wire in custom lifecycles
     * leveraged using the {@link org.apache.maven.api.plugin.annotations.Execute}
     * annotation.  If a {@code META-INF/maven/lifecycle.xml} file is packaged
     * in the plugin, Maven will provide a default implementation that will parse
     * the file and return the contained lifecycle definitions.
     *
     * @since 4.0.0
     */
    @Experimental
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Wed Feb 28 23:54:53 UTC 2024
    - 1.5K bytes
    - Viewed (0)
  7. api/maven-api-core/src/main/java/org/apache/maven/api/plugin/annotations/After.java

        }
    
        /**
         * The phase name.
         */
        String phase();
    
        /**
         * The type of this pointer.
         */
        Type type();
    
        /**
         * The scope for dependencies, only if {@code type() == Type.Dependencies}.
         */
        String scope() default "";
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Thu Aug 29 05:48:54 UTC 2024
    - 1.8K bytes
    - Viewed (0)
  8. CONTRIBUTING.md

    3. What did you do?
    4. What did you expect to see?
    5. What did you see instead?
    
    For change proposals, see [Proposing Changes To Go](https://go.dev/s/proposal-process).
    
    ## Contributing code
    
    Please read the [Contribution Guidelines](https://golang.org/doc/contribute.html) before sending patches.
    
    Unless otherwise noted, the Go source files are distributed under
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Mar 29 22:00:27 UTC 2023
    - 1.3K bytes
    - Viewed (0)
  9. LICENSE

    Copyright 2009 The Go Authors.
    
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions are
    met:
    
       * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
       * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Aug 09 14:54:31 UTC 2024
    - 1.4K bytes
    - Viewed (0)
  10. src/cmd/asm/internal/lex/stack.go

    // Copyright 2015 The Go Authors. All rights reserved.
    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    package lex
    
    import (
    	"text/scanner"
    
    	"cmd/internal/src"
    )
    
    // A Stack is a stack of TokenReaders. As the top TokenReader hits EOF,
    // it resumes reading the next one down.
    type Stack struct {
    	tr []TokenReader
    }
    
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Jan 09 22:33:23 UTC 2017
    - 1.2K bytes
    - Viewed (0)
Back to top