### 子應用程式 { #sub-application }

接著，建立你的子應用程式及其*路徑操作*。

這個子應用程式就是另一個標準的 FastAPI 應用，但這個會被「掛載」：

{* ../../docs_src/sub_applications/tutorial001_py310.py hl[11, 14:16] *}

### 掛載子應用程式 { #mount-the-sub-application }

在你的頂層應用程式 `app` 中，掛載子應用程式 `subapi`。

在此範例中，它會被掛載在路徑 `/subapi`：

{* ../../docs_src/sub_applications/tutorial001_py310.py hl[11, 19] *}

### 檢查自動 API 文件 { #check-the-automatic-api-docs }

    * So, by using FastAPI you are saving development time, bugs, lines of code, and you would probably get the same performance (or better) you would if you didn't use it (as you would have to implement it all...

			}
			if devName != "" {
				info.Name = devName
				qst, err := bfs.SysBlockDeviceQueueStats(devName)
				if err != nil { // Mostly not found error
					// Check if there is a parent device:
					//   e.g. if the mount is based on /dev/nvme0n1p1, let's calculate the
					//        real device name (nvme0n1) to get its sysfs information
					parentDevPath, e := os.Readlink("/sys/class/block/" + devName)
					if e == nil {

그 다음, 하위 애플리케이션과 그 *경로 처리*를 생성합니다.

이 하위 애플리케이션은 또 다른 표준 FastAPI 애플리케이션이지만, "마운트"될 애플리케이션입니다:

{* ../../docs_src/sub_applications/tutorial001_py310.py hl[11, 14:16] *}

### 하위 애플리케이션 마운트 { #mount-the-sub-application }

최상위 애플리케이션 `app`에서 하위 애플리케이션 `subapi`를 마운트합니다.

이 경우 `/subapi` 경로에 마운트됩니다:

{* ../../docs_src/sub_applications/tutorial001_py310.py hl[11, 19] *}

Цей підзастосунок - просто ще один стандартний застосунок FastAPI, але саме його буде «змонтовано»:

{* ../../docs_src/sub_applications/tutorial001_py310.py hl[11, 14:16] *}

### Змонтуйте підзастосунок { #mount-the-sub-application }

У вашому застосунку верхнього рівня, `app`, змонтуйте підзастосунок `subapi`.

У цьому випадку його буде змонтовано за шляхом `/subapi`:

  static final int DEFAULT_SIZE = 3;

  /**
   * Minimum size of the hash table of a compact hash-based collection. Because small hash tables
   * use a byte[], any smaller size uses the same amount of memory due to object padding.
   */
  private static final int MIN_HASH_TABLE_SIZE = 4;

  private static final int BYTE_MAX_SIZE = 1 << Byte.SIZE; // 2^8 = 256

	return lockedOpenFile(path, flag, perm, syscall.F_SETLK)
}

// LockedOpenFile - initializes a new lock and protects
// the file from concurrent access across mount points.
// This implementation doesn't support all the open
// flags and shouldn't be considered as replacement
// for os.OpenFile().
func LockedOpenFile(path string, flag int, perm os.FileMode) (*LockedFile, error) {

There are many ways to handle security, authentication and authorization.

And it normally is a complex and "difficult" topic.

In many frameworks and systems just handling security and authentication takes a big amount of effort and code (in many cases it can be 50% or more of all the code written).

    }
  }

  /**
   * This neat test shows that no matter what weights we use in our requests, if we push X amount of
   * permits in a cool state, where X = rate * timeToCoolDown, and we have specified a
   * timeToWarmUp() period, it will cost as the prescribed amount of time. E.g., calling
   * [acquire(5), acquire(1)] takes exactly the same time as [acquire(2), acquire(3), acquire(1)].
   */

    }
  }

  /**
   * This neat test shows that no matter what weights we use in our requests, if we push X amount of
   * permits in a cool state, where X = rate * timeToCoolDown, and we have specified a
   * timeToWarmUp() period, it will cost as the prescribed amount of time. E.g., calling
   * [acquire(5), acquire(1)] takes exactly the same time as [acquire(2), acquire(3), acquire(1)].
   */