Installation
To install BLAS and LAPACK on a Debian-based system, run
$ sudo apt install libblas-dev liblapack-dev
The LAPACKE library provides a C interface to LAPACK, and can be installed using
$ sudo apt install liblapacke-dev
/* | |
SPDX-FileCopyrightText: 2014 Marco Martin <mart@kde.org> | |
SPDX-FileCopyrightText: 2023 Hugo Manrique <contact@hugmanrique.me> | |
SPDX-License-Identifier: GPL-2.0-or-later | |
*/ | |
import QtQuick 2.5 | |
import QtQuick.Window 2.2 | |
import org.kde.plasma.core 2.0 as PlasmaCore |
public class SwordAnimation { | |
// Config variables | |
private static final float SEPARATOR = 2; | |
private static final float RAD_PER_SEC = 1.5F; | |
private static final float RAD_PER_TICK = RAD_PER_SEC / 20F; | |
private Location center; | |
private double radius; | |
private List<ArmorStand> swords; |
To install BLAS and LAPACK on a Debian-based system, run
$ sudo apt install libblas-dev liblapack-dev
The LAPACKE library provides a C interface to LAPACK, and can be installed using
$ sudo apt install liblapacke-dev
MIT License | |
Copyright (c) 2022 Hugo Manrique | |
Permission is hereby granted, free of charge, to any person obtaining a copy | |
of this software and associated documentation files (the "Software"), to deal | |
in the Software without restriction, including without limitation the rights | |
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
copies of the Software, and to permit persons to whom the Software is | |
furnished to do so, subject to the following conditions: |
use anyhow::Result; | |
use bluer::Address; | |
use std::collections::HashSet; | |
use std::fs::{File, OpenOptions}; | |
use std::io::{ErrorKind, Read, Write}; | |
use std::ops::Deref; | |
use std::path::PathBuf; | |
/// A set of paired device addresses, backed by a file. | |
pub struct PairedDevices { |
clear; | |
f = @(x) cos(x); | |
xa = 0; | |
xb = 2 * pi; | |
n = 4; % number of cubic polynomials | |
x = linspace(xa, xb, n + 1); % x_0, ..., x_n | |
y = f(x); % y_0, ..., y_n |
// The function we want to find the minimums of | |
// https://i.imgur.com/GG6uXvD.png | |
const getValue = (m, n) => m * m + n * n; | |
// The sampling interval (in ℝ^2) | |
let mStart = 0; | |
let nStart = 0; | |
let mEnd = 1; | |
let nEnd = 1; |
public enum BooleanFieldEnum { | |
// 2000 enum constants | |
private final boolean set; | |
BooleanFieldEnum() { | |
// Compute value on class loading, doesn't affect benchmark results | |
this.set = ThreadLocalRandom.current().nextBoolean(); | |
} | |