nixiz

#include <stdlib.h>
#include <string.h>
#include "contiguous_list.h"

contiguous_list_t* create_new_list(const size_t size_of_elem) {
  return create_new_list_with_cap(size_of_elem, 2);
}

contiguous_list_t* create_new_list_with_cap(const size_t s, const size_t cap) {
  contiguous_list_t mlist = {

nixiz

#include <iostream>
#include <mutex>
#include <assert.h>

/*

From the book "Modern C++ Design: Generic Programming and Design Patterns Applied" Andrei Alexandrescu

There are interesting applications of smart pointer layering, mainly because of the mechanics of
operator->. When you apply operator-> to a type that's not a built-in pointer, the compiler does an

nixiz

#include <functional>
#include <iostream>
#include <string>
#include <tuple>
#include <type_traits>

struct IObserver {
  virtual ~IObserver() = default;
  virtual void OnMessage(const std::string&) = 0;
};

nixiz

#include <stdio.h>
#include <stdlib.h>

#define N_MAX_BOARD_ROW_SIZE 15
/*
 Board array keeps queen placement(column index) on given indexed row value
 Example board allocation for N = 4
   1 2 3 4
 1 - Q - -
 2 - - - Q

nixiz

use std::collections::HashSet;
use itertools::Itertools;
use itertools::EitherOrBoth::{Both, Left, Right};

type Score = usize;

fn main() {
    let score = calculate("Selçuk", "Evin");
    println!("score: {}", score);
}

nixiz

#include <stdlib.h>
#include <string.h>
#include "contiguous_list.h"

contiguous_list_t* create_new_list(const size_t size_of_elem) {
  return create_new_list_with_cap(size_of_elem, 2);
}

contiguous_list_t* create_new_list_with_cap(const size_t s, const size_t cap) {
  contiguous_list_t mlist = {