airglow923

#!/bin/sh

usage() {
  # additional error messages
  if [ "$#" -ne 0 ]; then
    printf "$@\n" >&2;
  fi

  printf "Usage: $0 ALGORITHM JS_FILE\n" >&2;
}

airglow923

const latex = Deno.args[0];
const latexRenderer = 'https://latex.codecogs.com/svg.latex?';

if (latex === undefined || typeof latex !== 'string') {
  const errMsg = 'Invalid argument';
  writeStdStream(errMsg, Deno.stderr);
  Deno.exit(1);
}

async function writeStdStream(str, stream = Deno.stdout) {

airglow923

I don't have a reliable tool to measure the time taken to execute one or more instructions.

This is just to keep track of the assembly output for different C expressions.

The assembly is in AT&T syntax, but the comments will be written in Intel syntax as GitHub Markdown does not support AT&T syntax.

Arithmetic

Multiplication

airglow923

# Return a binary representation of an integer with space every 4 bits
def get_binary(x):
    binary = bin(x)[2:]
    
    for i in range(len(binary) - 4, 0, -4):
        binary = binary[:i] + ' ' + binary[i:]
        
    return binary

# Convert binary floating-point number into decimal

airglow923

/*
 * As shown below, this code is not meant for getting the parity of a number;
 * rather, it checks the parity flag. The reason is that the parity flag only
 * represents whether the least significant byte has odd or even number of set
 * bits. So, it should not be used to check the parity of a number in practice
 * unless the number is one byte long.
 *
 * Having said that, an implementation-defined function by Clang and GCC for
 * parity computation, __builtin_parity(x), returns 0 if x has even set bits and
 * 1 if odd, which is the opposite of the parity flag. That is the reason why

airglow923

#include <concepts> // integral
#include <cstddef>  // size_t
#include <iostream> // cout
#include <ranges>   // iota, reverse

namespace {

constexpr auto
is_bit_set(long long i, std::size_t n) -> bool {
  return (i & (1LL << n)) != 0;

airglow923

#include <concepts> // integral
#include <unordered_set>
#include <utility> // pair

template <std::integral First, std::integral Second>
struct std::hash<std::pair<First, Second>> {
  using argument_type = std::pair<First, Second>;
  using result_type = std::size_t;

  auto

airglow923

#include <iostream> // cout
#include <ranges>   // range, subrange, cbegin, cend
#include <vector>

namespace {

auto print_range(const std::ranges::range auto &range, bool newline = true)
    -> void;

namespace detail {

airglow923

#include <iterator> // bidirectional_iterator, iterator_traits
#include <utility>  // move, swap

template <std::bidirectional_iterator BidirectionalIterator, typename Compare,
          typename ValueType =
              typename std::iterator_traits<BidirectionalIterator>::value_type>
constexpr auto bubble_sort1(BidirectionalIterator begin,
                            BidirectionalIterator end, Compare compare)
    -> void {
  if (begin == end) {

airglow923

#include <concepts>
#include <iostream>
#include <type_traits>

struct BothAssignable {
  constexpr auto operator=(const BothAssignable&) noexcept -> BothAssignable& = default;
  constexpr auto operator=(BothAssignable&&) noexcept -> BothAssignable& = default;
};

struct CopyAssignable {