```
$ go run web-identity.go -cid 204367807228-ok7601k6gj1pgge7m09h7d79co8p35xx.apps.googleusercontent.com -csec XsT_PgPdT1nO9DD45rMLJw7G
2018/12/26 17:49:36 listening on http://localhost:8080/
```

> NOTE: for a reasonable test outcome, make sure the assumed user has at least permission/policy to list all buckets. That policy would look like below:

```
{
  "version": "2012-10-17",
  "statement": [
    {
      "effect": "Allow",

         * "should" always work on Android, too, but we know of a Samsung bug there :)) However, in
         * AggregateFutureStateFallbackAtomicHelperTest, we test what happens to AggregateFuture in
         * the case of the Samsung bug, and we do that by breaking AtomicReferenceFieldUpdater.
         * Breaking AtomicReferenceFieldUpdater not only forces AggregateFutureState to fall back to

вы получаете производительность лучше, чем у большинства протестированных NodeJS фреймворков
и на уровне с Go, который является компилируемым языком близким к C <a href="https://www.techempower.com/benchmarks/#section=data-r17&hw=ph&test=query&l=zijmkf-1" class="external-link" target="_blank">(всё благодаря Starlette)</a>.

### Получается, конкурентность лучше параллелизма?

Нет! Мораль истории совсем не в этом.

### **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.

The following example submits WordCount code to the Scala shell. Select an input file for the Spark WordCount example. We can use any text file as input.

- Login as user **‘spark’**.

class CompactHashMap<K extends @Nullable Object, V extends @Nullable Object>
    extends AbstractMap<K, V> implements Serializable {
  /*
   * TODO: Make this a drop-in replacement for j.u. versions, actually drop them in, and test the
   * world. Figure out what sort of space-time tradeoff we're actually going to get here with the
   * *Map variants. This class is particularly hard to benchmark, because the benefit is not only in

import java.util.Set;
import java.util.SortedSet;
import javax.annotation.CheckForNull;
import junit.framework.TestCase;
import org.jspecify.annotations.NullUnmarked;
import org.jspecify.annotations.Nullable;

/**
 * Unit test for {@link NullPointerTester}.
 *
 * @author Kevin Bourrillion
 * @author Mick Killianey
 */
@SuppressWarnings({
  "CheckReturnValue",

  - [Changelog since v1.23.6](#changelog-since-v1236)
  - [Changes by Kind](#changes-by-kind-10)
    - [API Change](#api-change-2)
    - [Feature](#feature-5)
    - [Failing Test](#failing-test)
    - [Bug or Regression](#bug-or-regression-10)
  - [Dependencies](#dependencies-10)
    - [Added](#added-10)
    - [Changed](#changed-10)
    - [Removed](#removed-10)
- [v1.23.6](#v1236)

        }

        try {
            T result = operation.get();
            onSuccess();
            return result;
        } catch (Exception e) {
            if (isFailure.test(e)) {
                onFailure(e);
            } else {
                // Not considered a failure for circuit breaker purposes

element.ownerDocument.body\n    case '#document':\n      return element.body\n  }\n\n  // Firefox want us to check `-x` and `-y` variations as well\n  const { overflow, overflowX, overflowY } = getStyleComputedProperty(element);\n  if (/(auto|scroll|overlay)/.test(overflow + overflowY + overflowX)) {\n    return element;\n  }\n\n  return getScrollParent(getParentNode(element));\n}\n","/**\n * Returns the reference node of the reference object, or the reference object itself.\n * @method\n * @memberof Popper.Utils\n...

### Concorrência é melhor que paralelismo?

Não! Essa não é a moral da história.