From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00
	autolearn=unavailable autolearn_force=no version=3.4.4
X-Received: by 2002:a02:a90a:: with SMTP id
 n10-v6mr1256583jam.18.1541140385612;
        Thu, 01 Nov 2018 23:33:05 -0700 (PDT)
X-Received: by 2002:a9d:5e97:: with SMTP id f23mr219344otl.4.1541140385489;
 Thu, 01 Nov 2018 23:33:05 -0700 (PDT)
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!weretis.net!feeder4.news.weretis.net!proxad.net!feeder1-2.proxad.net!209.85.166.216.MISMATCH!75-v6no225777itm.0!news-out.google.com!l70-v6ni181itb.0!nntp.google.com!75-v6no225773itm.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Thu, 1 Nov 2018 23:33:05 -0700 (PDT)
In-Reply-To: <827aada6-ddaa-450d-8458-a815d0fcf5a9@googlegroups.com>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=136.163.203.5;
 posting-account=g0yTkgoAAADdZGEYyZahxGlO3EkjH0Wv
NNTP-Posting-Host: 136.163.203.5
References: <a1868ec7-2a4d-4802-a28e-1ba878e54bc0@googlegroups.com>
 <d3e1e9f6-0759-487a-999e-6a9e1bbefcec@googlegroups.com>
 <5a59b308-041b-437e-8878-7259870c802a@googlegroups.com>
 <1d3e2e3e-93a3-492a-8c87-627b6e726be6@googlegroups.com>
 <87r2g43cgx.fsf@jacob-sparre.dk>
 <827aada6-ddaa-450d-8458-a815d0fcf5a9@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <daf8b6e6-a5e1-4a63-8102-241913eac531@googlegroups.com>
Subject: Re: Fortran 95: How do you write code to do this?
From: Petter Fryklund <petter.fryklund@atero.se>
Injection-Date: Fri, 02 Nov 2018 06:33:05 +0000
Content-Type: text/plain; charset="UTF-8"
Xref: reader02.eternal-september.org comp.lang.ada:54749
Date: 2018-11-01T23:33:05-07:00
List-Id: <comp.lang.ada>

Without shift can be:

-- Counting bits from right to left, starting with zero
generic 
  type T is mod <>; 
function Boolean_Of(Nat : T; Bit_Number : Natural) return Boolean; 

function Boolean_Of(Nat : T; Bit_Number : Natural) return Boolean is 
begin 
  return (Nat and T(2 ** Bit_Number)) = 1; 
end Boolean_Of; 

type Ten_Bits is mod 2 ** 10; 

function Boolean_Of_Ten_Bits is new Boolean_Of(Ten_Bits); 

Input : Ten_Bits := 75; 
Bool1  : Boolean  := Boolean_Of_Ten_Bits(Input, 0); -- will be True 
Bool2  : Boolean  := Boolean_Of_Ten_Bits(Input, 1); -- will be False 

Regards,
Petter