Merge branch 'main' into versions/4.0.0

src/storage/LockingResourceStore.ts

@@ -96,7 +96,7 @@ export class LockingResourceStore implements AtomicResourceStore {
     // Note that we can't just return the result of `withReadLock` since that promise only
     // resolves when the stream is finished, while we want `lockedRepresentationRun` to resolve
     // once we have the Representation.
-    // See https://github.com/solid/community-server/pull/536#discussion_r562467957
+    // See https://github.com/CommunitySolidServer/CommunitySolidServer/pull/536#discussion_r562467957
     return new Promise((resolve, reject): void => {
       let representation: Representation;
       // Make the resource time out to ensure that the lock is always released eventually.

src/storage/accessors/SparqlDataAccessor.ts

@@ -125,7 +125,7 @@ export class SparqlDataAccessor implements DataAccessor {
     }
     const { name, parent } = this.getRelatedNames(identifier);
 
-    const triples = await arrayifyStream(data) as Quad[];
+    const triples = await arrayifyStream<Quad>(data);
     const def = defaultGraph();
     if (triples.some((triple): boolean => !def.equals(triple.graph))) {
       throw new NotImplementedHttpError('Only triples in the default graph are supported.');

src/storage/accessors/ValidatingDataAccessor.ts

@@ -34,7 +34,7 @@ export class ValidatingDataAccessor extends PassthroughDataAccessor {
   public async writeContainer(identifier: ResourceIdentifier, metadata: RepresentationMetadata): Promise<void> {
     // A container's data mainly resides in its metadata,
     // of which we can't calculate the disk size of at this point in the code.
-    // Extra info can be found here: https://github.com/solid/community-server/pull/973#discussion_r723376888
+    // Extra info can be found here: https://github.com/CommunitySolidServer/CommunitySolidServer/pull/973#discussion_r723376888
     return this.accessor.writeContainer(identifier, metadata);
   }
 }

src/storage/conversion/ChainedConverter.ts

@@ -64,7 +64,7 @@ type ConversionPath = {
  * Most of these decrease computation time at the cost of more memory.
  *  - The algorithm could start on both ends of a possible path and work towards the middle.
  *  - When creating a path, store the list of unused converters instead of checking every step.
- *  - Caching: https://github.com/solid/community-server/issues/832
+ *  - Caching: https://github.com/CommunitySolidServer/CommunitySolidServer/issues/832
  *  - Making sure each intermediate type is only used once.
  *  - The TypedRepresentationConverter interface could potentially be updated
  *    so paths only differing in intermediate types can be combined.