Search Options

Results per page
Sort
Preferred Languages
Advance

Results 941 - 950 of 1,494 for these (0.02 sec)

  1. api/maven-api-cli/src/main/java/org/apache/maven/api/cli/Parser.java

         *
         * @param parserRequest the request containing all necessary information for parsing
         * @return the parsed invoker request. Caller must start by checking {@link InvokerRequest#parsingFailed()} as
         * if there are parser errors, this request may not be fully processed and should immediately be failed.
         */
        @Nonnull
        InvokerRequest parseInvocation(@Nonnull ParserRequest parserRequest);
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Jan 31 20:56:58 UTC 2025
    - 1.6K bytes
    - Viewed (0)
  2. src/main/java/org/codelibs/fess/app/pager/CharMappingPager.java

         * @param allPageCount The total page count.
         */
        public void setAllPageCount(final int allPageCount) {
            this.allPageCount = allPageCount;
        }
    
        /**
         * Checks if there is a previous page.
         * @return True if a previous page exists, false otherwise.
         */
        public boolean isExistPrePage() {
            return existPrePage;
        }
    
        /**
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 5.5K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/PredecessorsFunction.java

     * {@link ValueGraph}, and {@link Network}):
     *
     * {@snippet :
     * someGraphAlgorithm(startNode, graph);
     * }
     *
     * This works because those types each implement {@code PredecessorsFunction}. It will also work
     * with any other implementation of this interface.
     *
     * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/graph/SuccessorsFunction.java

     * {@link ValueGraph}, and {@link Network}):
     *
     * {@snippet :
     * someGraphAlgorithm(startNode, graph);
     * }
     *
     * This works because those types each implement {@code SuccessorsFunction}. It will also work with
     * any other implementation of this interface.
     *
     * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  5. .github/CONTRIBUTING.md

    - Don’t change public API lightly, avoid if possible, and include your reasoning in the PR if essential.  It causes pain for developers who use OkHttp and sometimes runtime errors.
    - Favour a working external library if appropriate.  There are many examples of OkHttp libraries that can sit on top or hook in via existing APIs.
    - Get working code on a personal branch with tests before you submit a PR.
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sun Mar 17 04:16:26 UTC 2019
    - 1.4K bytes
    - Viewed (0)
  6. guava-tests/benchmark/com/google/common/eventbus/EventBusBenchmark.java

        eventBus = new EventBus("for benchmarking purposes");
        eventBus.register(this);
      }
    
      @Benchmark
      void postStrings(int reps) {
        for (int i = 0; i < reps; i++) {
          eventBus.post("hello there");
        }
      }
    
      @Subscribe
      public void handleStrings(String string) {
        // Nothing to do here.
      }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 1.2K bytes
    - Viewed (0)
  7. cmd/is-dir-empty_other.go

    //
    // You should have received a copy of the GNU Affero General Public License
    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package cmd
    
    // isDirEmpty - returns true if there is no error and no object and prefix inside this directory
    func isDirEmpty(dirname string, _ bool) bool {
    	entries, err := readDirN(dirname, 1)
    	if err != nil {
    		return false
    	}
    	return len(entries) == 0
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Apr 05 15:17:08 UTC 2024
    - 1K bytes
    - Viewed (0)
  8. LICENSE

              excluding those notices that do not pertain to any part of
              the Derivative Works; and
    
          (d) If the Work includes a "NOTICE" text file as part of its
              distribution, then any Derivative Works that You distribute must
              include a readable copy of the attribution notices contained
              within such NOTICE file, excluding those notices that do not
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue May 08 21:35:34 UTC 2018
    - 11.1K bytes
    - Viewed (0)
  9. LICENSES/vendor/github.com/euank/go-kmsg-parser/LICENSE

              excluding those notices that do not pertain to any part of
              the Derivative Works; and
    
          (d) If the Work includes a "NOTICE" text file as part of its
              distribution, then any Derivative Works that You distribute must
              include a readable copy of the attribution notices contained
              within such NOTICE file, excluding those notices that do not
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Fri May 08 04:49:00 UTC 2020
    - 11.2K bytes
    - Viewed (0)
  10. LICENSES/vendor/github.com/go-logr/zapr/LICENSE

              excluding those notices that do not pertain to any part of
              the Derivative Works; and
    
          (d) If the Work includes a "NOTICE" text file as part of its
              distribution, then any Derivative Works that You distribute must
              include a readable copy of the attribution notices contained
              within such NOTICE file, excluding those notices that do not
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Thu Sep 09 12:43:43 UTC 2021
    - 11.2K bytes
    - Viewed (0)
Back to top