loliGothicK

int max( int a, int b ) // #1
{
    return a < b ? b : a ;
}

double max( double a, double b ) // #2
{
    return a < b ? b : a ;
}

loliGothicK

    template < typename T >
    constexpr T interval<T>::rad() const
    {
        return pimpl->upper() - pimpl->lower() / static_cast<T>(2.0L);
    }

    template < typename T >
    constexpr T interval<T>::norm() const
    {
        using std::abs;

loliGothicK

template < typename T >
void f(T&&){}

void g(int const&){};

int main(){
    f(g);
}

loliGothicK

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>

template < typename Container >
auto my_find(Container& c, typename Container::key_type key)
    ->decltype((c.find(key)))
{

loliGothicK

template < typename  T >
T max(T a, T b) ;

loliGothicK

// 変数がいっぱいある
int a{}, b{}, c{};
double d{}, e{}, f{};
std::string too_long_name_variable{};

// ラムダ式
auto result = [&a,&b,&c,&d,&e,&f,&too_long_name_variable](auto&& ...args){
  // ...
  // 何らかの処理
  // ...

loliGothicK

public class FizzBuzz {
    public static void main(String[] args){
        for(int i : new int[] { 1 }) // define counter
            for(int dummy : new int[100])
                if( (
                        (i%15==0) ?
                            System.out.printf("FIZZBUZZ\n") == null
                        : (i%3==0) ?
                            System.out.printf("FIZZ\n") == null
                        : (i%5==0) ?

loliGothicK

bool operator<(const Person& x, const Person& y)
{
  return (x.last_name < y.last_name) || !(y.last_name < x.last_name)
    && ( (x.first_name < y.first_name) || !(y.first_name < x.first_name)
    && (x.age < y.age ));
}

loliGothicK

#include <tuple>
#include <string>

struct Person {
  std::string first_name;
  std::string last_name;
  int age;
};

bool operator<(const Person& x, const Person& y)

loliGothicK

#include <tuple>
#include <string>
#include <iostream>
#include <iomanip>

class Person {
  std::string first_name_;
  std::string last_name_;
  int age_;
public: