Ryohji Ikebe ryohji

C 言語の not 演算子には２種類ある。 ~ と !。論理学では ~ を否定で使うことが多いけれど C 言語での論理否定は !、 ~ はビットごとの否定。

ビットごとの否定

// bitwise-not.c
#include <stdbool.h>

int main() { return ~false; }

Every value in array segment b[1..n] that is not in b[i..j] is in b[i..j].

Let predicate p(v) be "v is in b[i..j]."

  (A k: 0<k<=N: ~p(b[k]) -> p(b[k]))
=
  (A k: 0<k<=N: ~~p(b[k]) | p(b[k]))
=
 (A k: 0

	#include <algorithm>
	#include <iostream>
	#include <iterator>
	#include <vector>

	int main() {
	auto v = std::vector<int> {1, 2, 3};

	// Use transform to update all elements in the vector.
	std::transform(std::cbegin(v), std::cend(v), std::begin(v),

	import unittest


	def cleanup_list(list):
	i = 0
	while i < len(list): # pop のたびに list 長が変わる
	elem = list[i]
	if not elem.alive:
	list.pop(i)
	else:

	static vtype roffbuf; // Line buffer.
	static char *roffp = roffbuf; // Pointer into line buffer.
	static int roffpline = 0; // Place to print line now being loaded.

	static uint8_t count_previous_non_blank_chars(const char *from);

	// Print out strings, filling up lines as we go.
	static void roff(const char *p) {
	uint8_t count;
	loop:

	interface Substitution {
	fun with(vararg ps: Predicate): Predicate
	}

	interface Predicate {
	fun substitute(vararg xs: Symbol): Substitution
	}

	data class Symbol(val name: String) : Predicate {
	override fun toString(): String = name

	object ImageProcessing {

	fun smoothing(stride: Int, buffer: ByteArray): ByteArray =
	buffer.toIntList()
	.convolution(stride)
	.map { (it / 9).toByte() }
	.toByteArray()

	fun sharpen(stride: Int, buffer: ByteArray): ByteArray =
	buffer.toIntList()