* quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer,
 * since an iteration across all row keys occurs.
 *
 * <p>Because a {@code TreeBasedTable} has unique sorted values for a given row, both {@code
 * row(rowKey)} and {@code rowMap().get(rowKey)} are {@link SortedMap} instances, instead of the

     * @param si the starting index in the source array
     * @param slim the limit index in the source array
     * @return the decoded String
     * @throws IOException if a decoding error occurs
     */
    public static String dec_utf8(final byte[] src, int si, final int slim) throws IOException {
        final char[] uni = new char[slim - si];
        int ui, ch;

Job status can also be viewed in a browser by navigating to the YARN ResourceManager Web UI and clicking on job history server information.

### **4.2 WordCount**

WordCount is a simple program that counts how often a word occurs in a text file. The code builds a dataset of (String, Int) pairs called counts, and saves the dataset to a file.

 * quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer,
 * since an iteration across all row keys occurs.
 *
 * <p>Note that this implementation is not synchronized. If multiple threads access this table
 * concurrently and one of the threads modifies the table, it must be synchronized externally.
 *
 * @author Jared Levy

                    for (int j = 0; j < urlsPerThread; j++) {
                        // Access is synchronized internally in the actual implementation
                        // Here we just verify no concurrent modification exceptions occur
                        String url = "http://example.com/thread" + threadIndex + "/doc" + j;
                        // Simulate the synchronized access that happens in deleteDocument()

   * e]}.
   */
  @Override
  String toString();

  // Refined Collection Methods

  /**
   * {@inheritDoc}
   *
   * <p>Elements that occur multiple times in the multiset will appear multiple times in this
   * iterator, though not necessarily sequentially.
   */
  @Override
  Iterator<E> iterator();

  /**

                }
            } catch (final SmbException e) {
                if (e.getNtStatus() == NtStatus.NT_STATUS_INVALID_PARAMETER) {
                    // Silently ignore invalid parameter errors - these may occur with certain server configurations
                    if (log.isDebugEnabled()) {
                        log.debug("Invalid parameter error.", e);
                    }
                    return;
                }

			expectedExpiry := ExpectedExpiryTime(obj.SuccessorModTime, int(rule.NoncurrentVersionExpiration.NoncurrentDays))
			if now.IsZero() || now.After(expectedExpiry) {
				oldEnough = true
			}
			// > For the deletion to occur, both the <NoncurrentDays> and the <NewerNoncurrentVersions> values must be exceeded.
			// ref: https://docs.aws.amazon.com/AmazonS3/latest/dev/intro-lifecycle-rules.html#intro-lifecycle-rules-actions

                return OptionalEntity.empty();
            }
        }, WebConfigService.class.getCanonicalName());

        // Should return null when exception occurs
        assertNull(crawlingConfigHelper.getCrawlingConfig("W123"));
    }

    @Test
    public void test_store_counterIncrement() {
        final String sessionId = "testSession";

 * <p>This pattern ensures the following:
 *
 * <ul>
 *   <li>Each {@code Closeable} resource that is successfully registered will be closed later.
 *   <li>If a {@code Throwable} is thrown in the try block, no exceptions that occur when attempting
 *       to close resources will be thrown from the finally block. The throwable from the try block
 *       will be thrown.