Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

  • 26da26f
  • /
  • Triangle.h
Raw File Download

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • content
  • directory
content badge
swh:1:cnt:ce26f93d732293fe46faa0da24bebeea01805189
directory badge
swh:1:dir:26da26f21e20c537231a6a2a775ea0e14c30ac05

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • content
  • directory
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Triangle.h
#ifndef Triangle_H
#define Triangle_H

#include "Edge.h"

class Triangle
{
public:

    ///Constructors
    Triangle();
    Triangle(int v1, int v2, int v3);

    ///return vertex index on position pos
    int TV(int pos);

    ///return Edge in position pos
    Edge* TE(int pos);

    ///return adjacent triangle
    int TT(int pos);

    ///setter for adjacencies
    void setTT(int pos, int adjId);

    ///retrieve the position of an edge inside the triangle
    short face_index(Edge* e);

    ///retrieve the position of a vertex inside the triangle
    int vertex_index(int v);

    ///operators -----
    inline bool operator== (const Triangle &p)
    {
        bool b[3];
        b[0] = false; b[1] = false; b[2] = false;
        for(int i=0;i<3;i++)
        {
            for(int j=0;j<3;j++)
            {
                if(!b[j] && p.vertices[i]==this->vertices[j])
                {
                    b[j] = true;
                    break;
                }
            }
        }

        return b[0] && b[1] && b[2];
    }

    inline bool operator!= (const Triangle p)
    {
       return !((*this)==(p));
    }

    ///true if it contains the given vertex
    inline bool contains(int v){
        for(int i=0;i<3;i++)
        {
            if(vertices[i] == v) return true;
        }
        return false;
    }

    inline int getVerticesNum(){ return 3;}

private:
    int vertices[3]; /// indexes of its vertices
    int adj[3]; ///indexes of its adjacent triangles
};



#endif // Triangle_H

back to top

Software Heritage — Copyright (C) 2015–2026, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API