diff --git a/docs/api-viewer/PBSAPI.js b/docs/api-viewer/PBSAPI.js index b45e0eb1..2417b4de 100644 --- a/docs/api-viewer/PBSAPI.js +++ b/docs/api-viewer/PBSAPI.js @@ -143,7 +143,7 @@ Ext.onReady(function() { permhtml += ""; } else { //console.log(permission); - permhtml += "Unknown systax!"; + permhtml += "Unknown syntax!"; } return permhtml; diff --git a/docs/backup-client.rst b/docs/backup-client.rst index 779d7e42..bd0fdfed 100644 --- a/docs/backup-client.rst +++ b/docs/backup-client.rst @@ -472,7 +472,7 @@ located in ``/etc``, you could do the following: pxar:/ > restore target/ --pattern etc/**/*.conf ... -The above will scan trough all the directories below ``/etc`` and restore all +The above will scan through all the directories below ``/etc`` and restore all files ending in ``.conf``. .. todo:: Explain interactive restore in more detail diff --git a/docs/installation.rst b/docs/installation.rst index ffceebb4..6b2b5778 100644 --- a/docs/installation.rst +++ b/docs/installation.rst @@ -123,6 +123,6 @@ you need to run: # apt-get install proxmox-backup-client -.. note:: The client-only repository should be useable by most recent Debian - and Ubuntu derivatives. +.. note:: The client-only repository should be usable by most recent Debian and + Ubuntu derivatives. diff --git a/docs/introduction.rst b/docs/introduction.rst index 243ef8e1..ddfdcf17 100644 --- a/docs/introduction.rst +++ b/docs/introduction.rst @@ -76,7 +76,7 @@ Main Features :Open Source: No secrets. Proxmox Backup Server is free and open-source software. The source code is licensed under AGPL, v3. -:No Limits: Proxmox Backup Server has no artifical limits for backup storage or +:No Limits: Proxmox Backup Server has no artificial limits for backup storage or backup-clients. :Enterprise Support: Proxmox Server Solutions GmbH offers enterprise support in diff --git a/docs/maintenance.rst b/docs/maintenance.rst index c2771e36..15b313d0 100644 --- a/docs/maintenance.rst +++ b/docs/maintenance.rst @@ -148,7 +148,7 @@ are checked again. The interface for creating verify jobs can be found under the **Verify Jobs** tab of the datastore. .. Note:: It is recommended that you reverify all backups at least monthly, even - if a previous verification was successful. This is becuase physical drives + if a previous verification was successful. This is because physical drives are susceptible to damage over time, which can cause an old, working backup to become corrupted in a process known as `bit rot/data degradation `_. It is good practice to diff --git a/docs/tape-backup.rst b/docs/tape-backup.rst index dd20d98f..b8f14163 100644 --- a/docs/tape-backup.rst +++ b/docs/tape-backup.rst @@ -260,7 +260,7 @@ It's worth noting that some of the smaller tape libraries don't have such slots. While they have something called a "Mail Slot", that slot is just a way to grab the tape from the gripper. They are unable to hold media while the robot does other things. They also do not -expose that "Mail Slot" over the SCSI interface, so you wont see them in +expose that "Mail Slot" over the SCSI interface, so you won't see them in the status output. As a workaround, you can mark some of the normal slots as export diff --git a/docs/technical-overview.rst b/docs/technical-overview.rst index 1bf59e23..0468397b 100644 --- a/docs/technical-overview.rst +++ b/docs/technical-overview.rst @@ -100,7 +100,7 @@ can be encrypted, and they are handled in a slightly different manner than normal chunks. The hashes of encrypted chunks are calculated not with the actual (encrypted) -chunk content, but with the plaintext content concatenated with the encryption +chunk content, but with the plain-text content concatenated with the encryption key. This way, two chunks of the same data encrypted with different keys generate two different checksums and no collisions occur for multiple encryption keys. @@ -138,7 +138,7 @@ will see that the probability of a collision in that scenario is: For context, in a lottery game of guessing 6 out of 45, the chance to correctly guess all 6 numbers is only :math:`1.2277 * 10^{-7}`, that means the chance of -collission is about the same as winning 13 such lotto games *in a row*. +a collision is about the same as winning 13 such lotto games *in a row*. In conclusion, it is extremely unlikely that such a collision would occur by accident in a normal datastore.