<commit_before>{% set name = "metis" %}
{% set version = "4.0.3" %}

package:
  name: {{ name|lower }}
  version: {{ version }}

source:
  fn: metis-4.0.3.tar.gz
  md5: d3848b454532ef18dc83e4fb160d1e10
  url: http://glaros.dtc.umn.edu/gkhome/fetch/sw/metis/OLD/metis-4.0.3.tar.gz

build:
  skip: true  # [win]
  number: 0
  binary_relocation: true

requirements:
  build:
    - cmake
    - toolchain

test:
  commands:
    - cmpfillin -h
    - gpmetis -h
    - m2gmetis -h
    - ndmetis -h
    - mpmetis -h

about:
  home: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
  license: GPLv3
  license_file: LICENSE
  summary: 'METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering'
  description: |
    METIS is a set of serial programs for partitioning graphs, partitioning 
    finite element meshes, and producing fill reducing orderings for sparse 
    matrices. The algorithms implemented in METIS are based on the multilevel 
    recursive-bisection, multilevel k-way, and multi-constraint partitioning 
    schemes developed in our lab.
  doc_url: http://glaros.dtc.umn.edu/gkhome/metis/metis/faq

extra:
  recipe-maintainers:
    - basnijholt<commit_msg>Update tests<commit_after>{% set name = "metis" %}
{% set version = "4.0.3" %}

package:
  name: {{ name|lower }}
  version: {{ version }}

source:
  fn: metis-4.0.3.tar.gz
  md5: d3848b454532ef18dc83e4fb160d1e10
  url: http://glaros.dtc.umn.edu/gkhome/fetch/sw/metis/OLD/metis-4.0.3.tar.gz

build:
  skip: true  # [win]
  number: 0
  binary_relocation: true

requirements:
  build:
    - cmake
    - toolchain

test:
  commands:
    - graphchk
    - partnmesh
    - kmetis
    - mesh2dual
    - mesh2nodal
    - oemetis
    - onmetis
    - partdmesh
    - pmetis

about:
  home: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
  license: GPLv3
  license_file: LICENSE
  summary: 'METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering'
  description: |
    METIS is a set of serial programs for partitioning graphs, partitioning 
    finite element meshes, and producing fill reducing orderings for sparse 
    matrices. The algorithms implemented in METIS are based on the multilevel 
    recursive-bisection, multilevel k-way, and multi-constraint partitioning 
    schemes developed in our lab.
  doc_url: http://glaros.dtc.umn.edu/gkhome/metis/metis/faq

extra:
  recipe-maintainers:
    - basnijholt
{'fraction_non_alphanumeric': 0.10362047440699126, 'fraction_numerical': 0.02871410736579276, 'mean_word_length': 3.047138047138047, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, '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': '479470', 'n_tokens_mistral': 935, 'n_tokens_neox': 882, 'n_words': 215}