<metapackage xmlns:os="http://opensuse.org/Standards/One_Click_Install" xmlns="http://opensuse.org/Standards/One_Click_Install">
  <group>
    <repositories>
      <repository recommended="true">
        <name>devel:libraries:c_c++</name>
        <summary>A project for basic libraries shared among multiple projects</summary>
        <description>If your library is a basic building block (-&gt; subject to interpretation) and topically does not fit into another project, this may be the place for it.

Some rules..

    1. We only build against the standard repositories for the distros
    2. Users only get access to their packages. We should keep the number of project maintainers as small as possible</description>
        <url>https://download.opensuse.org/repositories/devel:/libraries:/c_c%2B%2B/16.0/</url>
      </repository>
      <repository recommended="true">
        <name>openSUSE:Leap:16.0</name>
        <summary>openSUSE Leap 16.0 based on SLFO</summary>
        <description>Leap 16.0 based on SLES 16.0 (specifically SLFO:1.2)</description>
        <url>https://download.opensuse.org/distribution/leap/16.0/repo/oss/</url>
      </repository>
      <repository recommended="true">
        <name>openSUSE:Backports:SLE-16.0</name>
        <summary>Community packages for SLE-16.0</summary>
        <description>Community packages for SLE-16.0</description>
        <url>https://download.opensuse.org/repositories/openSUSE:/Backports:/SLE-16.0/standard/</url>
      </repository>
      <repository recommended="false">
        <name>SUSE:SLFO:1.2</name>
        <summary>SLFO 1.2 (the base for openSUSE 16.0 and SLES 16.0)</summary>
        <description></description>
        <url>https://download.opensuse.org/repositories/SUSE:/SLFO:/1.2/standard/</url>
      </repository>
    </repositories>
    <software>
      <item>
        <name>primesieve</name>
        <summary>A prime number generator</summary>
        <description>primesieve is a command-line program that generates primes using the
sieve of Eratosthenes algorithm. It can generate primes and prime
k-tuplets (twin primes, prime triplets, ...) up to 2^64 and find the
nth prime.</description>
      </item>
    </software>
  </group>
</metapackage>
