britannio

module QuickSortPermutationSimple
#push-options "--fuel 1 --ifuel 1"

//Some auxiliary definitions to make this a standalone example
let rec length #a (l:list a)
  : nat
  = match l with
    | [] -> 0
    | _ :: tl -> 1 + length tl

britannio

module QuickSortMem

//Some auxiliary definitions to make this a standalone example
let rec length #a (l:list a)
  : nat
  = match l with
    | [] -> 0
    | _ :: tl -> 1 + length tl

let rec append #a (l1 l2:list a)

britannio

module QuickSortPermutation
#push-options "--fuel 1 --ifuel 1"

//Some auxiliary definitions to make this a standalone example
let rec length #a (l:list a)
  : nat
  = match l with
    | [] -> 0
    | _ :: tl -> 1 + length tl

britannio

module QuickSortMemSimple

let rec length #a (l:list a)
  : nat
  = match l with
    | [] -> 0
    | _ :: tl -> 1 + length tl

let rec append #a (l1 l2:list a)
  : list a

britannio

 {
  "project": {
    "name": "New project",
    "id": "new",
    "creationTs": 1691921932988,
    "lastModifiedTs": 1691923674233
  },
  "graph": {
    "nodes": [
      {

britannio

import 'package:collection/collection.dart';

void main() {
  print([1,2,3].isEqualToIgnoringOrdering({3,2,1})); // true
}

extension IsEqualToIgnoringOrdering<T> on Iterable<T> {
  bool isEqualToIgnoringOrdering(Iterable<T> other) {
    return const UnorderedIterableEquality().equals(this, other);
  }

britannio

targets:
  $default:
    sources:
      exclude:
        - "**/components/**"
        - "**/exceptions/**"
        - "test/**"

    builders:
      gql_build|schema_builder: