<commit_before># 2D Rank Finding Problem

[![Build Status](https://travis-ci.org/c910335/2D-Rank-Finding-Problem.svg?branch=master)](https://travis-ci.org/c910335/2D-Rank-Finding-Problem)

Solve 2D Rank Finding Problem in Several Languages

## Languages

- Crystal
- Ruby
- C
- C++
- Java
- Haskell
- Python 3
- C#

## Problem

- P<sub>i</sub>(x<sub>i</sub>, y<sub>i</sub>) **dominates** P<sub>j</sub>(x<sub>j</sub>, y<sub>j</sub>) iff x<sub>i</sub> ≥ x<sub>j</sub> and y<sub>i</sub> ≥ y<sub>j</sub>
- Given a set of points, the **rank** of a point is the number of points dominated by it.

Design a program to find the rank of each point.

### Input
<commit_msg>migrate to travis-ci.com<commit_after># 2D Rank Finding Problem

[![Build Status](https://travis-ci.com/c910335/2D-Rank-Finding-Problem.svg?branch=master)](https://travis-ci.com/c910335/2D-Rank-Finding-Problem)

Solve 2D Rank Finding Problem in Several Languages

## Languages

- Crystal
- Ruby
- C
- C++
- Java
- Haskell
- Python 3
- C#

## Problem

- P<sub>i</sub>(x<sub>i</sub>, y<sub>i</sub>) **dominates** P<sub>j</sub>(x<sub>j</sub>, y<sub>j</sub>) iff x<sub>i</sub> ≥ x<sub>j</sub> and y<sub>i</sub> ≥ y<sub>j</sub>
- Given a set of points, the **rank** of a point is the number of points dominated by it.

Design a program to find the rank of each point.

### Input

{'fraction_non_alphanumeric': 0.18848167539267016, 'fraction_numerical': 0.025430067314884067, 'mean_word_length': 4.049056603773585, 'pattern_counts': {'":': 0, '<': 43, '<?xml version=': 0, '>': 43, 'https://': 4, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2385139', 'n_tokens_mistral': 565, 'n_tokens_neox': 519, 'n_words': 138}