index : avr/qmk/firmware	master
	[no description]

aboutsummaryrefslogtreecommitdiffstats

log msg author committer range

path: root/keyboards/bear_face

	Commit message (Collapse)	Author	Age	Files	Lines
*	Fixed info.json (#8653)	chemicalwill	2020-04-02	1	-2/+9
| | | | | | |	* Previous info.json had 4 layers instead of 1, incorrect height and width * Added labels for arrows (Up, Down, Left, Right) * Formatted info.json by rows
*	[Keyboard] added bear_face PCB (#8596)	chemicalwill	2020-03-31	8	-0/+434
	* bear_face initial commit Added bear_face PCB * ATMega32u4-based replacement PCB for the Vortex Race 3 * Default keymap emulates stock board keymap (with a few changes), including layer toggles for QWERTY, COLEMAK, and DVORAK layouts * Suggested changes made * fixed keyboard_pre_init_kb in bear_face.c * removed 'LAYOUTS = 83_ansi' from rules.mk * readme header fixed Co-Authored-By: Ryan <fauxpark@gmail.com> * rules.mk formatting fixed Co-Authored-By: Ryan <fauxpark@gmail.com> * info.json converted from KLE * Default layers enum added Co-Authored-By: Drashna Jaelre <drashna@live.com> * Specified LAYOUT_83_ansi in info.json from generic LAYOUT Co-Authored-By: Joel Challis <git@zvecr.com> * Updated license * Changed license name to username * Changed license email to github profile url Co-authored-by: Ryan <fauxpark@gmail.com> Co-authored-by: Drashna Jaelre <drashna@live.com> Co-authored-by: Joel Challis <git@zvecr.com>

generated by cgit v1.2.3 (git 2.25.1) at 2025-09-21 00:04:31 +0000

--  Iterators for elements of a netlist.
--  Copyright (C) 2017 Tristan Gingold
--
--  This file is part of GHDL.
--
--  This program is free software; you can redistribute it and/or modify
--  it under the terms of the GNU General Public License as published by
--  the Free Software Foundation; either version 2 of the License, or
--  (at your option) any later version.
--
--  This program is distributed in the hope that it will be useful,
--  but WITHOUT ANY WARRANTY; without even the implied warranty of
--  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
--  GNU General Public License for more details.
--
--  You should have received a copy of the GNU General Public License
--  along with this program; if not, write to the Free Software
--  Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
--  MA 02110-1301, USA.

with Netlists.Utils; use Netlists.Utils;

package body Netlists.Iterators is
   function Sub_Modules (M : Module) return Modules_Iterator
   is
      pragma Assert (Is_Valid (M));
   begin
      return Modules_Iterator'(M => M);
   end Sub_Modules;

   function Modules_First (It : Modules_Iterator) return Modules_Cursor is
   begin
      return Modules_Cursor'(M => Get_First_Sub_Module (It.M));
   end Modules_First;

   function Modules_Next (It : Modules_Iterator; Cur : Modules_Cursor)
                         return Modules_Cursor
   is
      pragma Unreferenced (It);
   begin
      return Modules_Cursor'(M => Get_Next_Sub_Module (Cur.M));
   end Modules_Next;

   function Modules_Has_Element (It : Modules_Iterator; Cur : Modules_Cursor)
                                return Boolean
   is
      pragma Unreferenced (It);
   begin
      return Cur.M /= No_Module;
   end Modules_Has_Element;

   function Modules_Element (It : Modules_Iterator; Cur : Modules_Cursor)
                            return Module
   is
      pragma Unreferenced (It);
   begin
      return Cur.M;
   end Modules_Element;

   function Ports_Desc_First (It : Ports_Desc_Iterator)
                             return Ports_Desc_Cursor is
   begin
      return Ports_Desc_Cursor'
        (Idx => Get_First_Port_Desc (It.M),
         Num => Get_Nbr_Inputs (It.M) + Get_Nbr_Outputs (It.M));
   end Ports_Desc_First;

   function Ports_Desc_Next (It : Ports_Desc_Iterator; Cur : Ports_Desc_Cursor)
                            return Ports_Desc_Cursor
   is
      pragma Unreferenced (It);
   begin
      return Ports_Desc_Cursor'(Idx => Cur.Idx + 1,
                                Num => Cur.Num - 1);
   end Ports_Desc_Next;

   function Ports_Desc_Has_Element
     (It : Ports_Desc_Iterator; Cur : Ports_Desc_Cursor) return Boolean
   is
      pragma Unreferenced (It);
   begin
      return Cur.Num > 0;
   end Ports_Desc_Has_Element;

   function Ports_Desc_Element
     (It : Ports_Desc_Iterator; Cur : Ports_Desc_Cursor) return Port_Desc
   is
      pragma Unreferenced (It);
   begin
      return Get_Port_Desc (Cur.Idx);
   end Ports_Desc_Element;

   function Ports_Desc (M : Module) return Ports_Desc_Iterator
   is
      pragma Assert (Is_Valid (M));
   begin
      return Ports_Desc_Iterator'(M => M);
   end Ports_Desc;

   function Params_Desc_First (It : Params_Desc_Iterator)
                              return Params_Desc_Cursor is
   begin
      return Params_Desc_Cursor'
        (Idx => 0,
         Num => Get_Nbr_Params (It.M));
   end Params_Desc_First;

   function Params_Desc_Next
     (It : Params_Desc_Iterator; Cur : Params_Desc_Cursor)
     return Params_Desc_Cursor
   is
      pragma Unreferenced (It);
   begin
      return Params_Desc_Cursor'(Idx => Cur.Idx + 1,
                                 Num => Cur.Num - 1);
   end Params_Desc_Next;

   function Params_Desc_Has_Element
     (It : Params_Desc_Iterator; Cur : Params_Desc_Cursor) return Boolean
   is
      pragma Unreferenced (It);
   begin
      return Cur.Num > 0;
   end Params_Desc_Has_Element;

   function Params_Desc_Element
     (It : Params_Desc_Iterator; Cur : Params_Desc_Cursor) return Param_Desc is
   begin
      return Get_Param_Desc (It.M, Cur.Idx);
   end Params_Desc_Element;

   function Params_Desc (M : Module) return Params_Desc_Iterator is
   begin
      return Params_Desc_Iterator'(M => M);
   end Params_Desc;

   function Instances_First (It : Instances_Iterator)
                            return Instances_Cursor is
   begin
      return Instances_Cursor'(Inst => Get_First_Instance (It.M));
   end Instances_First;

   function Instances_Next (It : Instances_Iterator; Cur : Instances_Cursor)
                           return Instances_Cursor
   is
      pragma Unreferenced (It);
   begin
      return Instances_Cursor'(Inst => Get_Next_Instance (Cur.Inst));
   end Instances_Next;

   function Instances_Has_Element
     (It : Instances_Iterator; Cur : Instances_Cursor) return Boolean
   is
      pragma Unreferenced (It);
   begin
      return Cur.Inst /= No_Instance;
   end Instances_Has_Element;

   function Instances_Element
     (It : Instances_Iterator; Cur : Instances_Cursor) return Instance
   is
      pragma Unreferenced (It);
   begin
      return Cur.Inst;
   end Instances_Element;

   function Instances (M : Module) return Instances_Iterator is