Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people, just like you, are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
Solved

Yet another Pascal to C#

Posted on 2006-10-19
2
1,090 Views
Last Modified: 2011-09-20
ciuly: You might remember our byte array from the other post, 'a'. This is what's being used here.

function deb(b:string):string;
var base: string;
    i, r, j: integer;
    b1, b2, b3, b4: byte;
    i1, i2, i3: byte;
begin
       
 i := 1;
 while i+4<Length(b) do begin
 
   b1 := a[ord(b[i])-20];
   b2 := a[ord(b[i+1])-20];
   b3 := a[ord(b[i+2])-20];
   b4 := a[ord(b[i+3])-20];

    i1 := (b1 shl 2)or(b2 shr 4);
    i2 := ((b2 and $f) shl 4)or(b3 shr 2);
    i3 := ((b3 and 3) shl 6)or(b4);

   //if i1*i2*i3<>0 then                  
   result := result + {'>'+}chr(i1)+chr(i2)+chr(i3);
   //result := result +
   //'|'+ int2str(i1)+','+ int2str(i2)+','+ int2str(i3)+
   //'('+int2str(b1)+','+ int2str(b2)+','+ int2str(b3)+','+int2str(b4)+')';

   inc(i,4);
 end;
end;
0
Comment
Question by:valvet
2 Comments
 
LVL 28

Accepted Solution

by:
2266180 earned 500 total points
ID: 17764205
this should be it:

        public string deb(byte[] a, string b)
        {
            string result = "";
            byte b1,b2,b3,b4;
            int i = 1, i1,i2,i3;
            while (i+4 < b.Length)
            {
                b1 = a[b[i-1]-20];
                b2 = a[b[i]-20];
                b3 = a[b[i+1]-20];
                b4 = a[b[i+2]-20];

                i1 = (b1 << 2) | (b2 >> 4);
                i2 = ((b2 & 0xf) << 4) | (b3 >> 2);
                i3 = ((b3 & 3) << 6) | b4;

                result = result + /*'>'+*/Convert.ToChar(i1)+Convert.ToChar(i2)+Convert.ToChar(i3);
                i = i+4;
            }
            return result;
        }
0
 

Author Comment

by:valvet
ID: 17764242
Excellent job.

Workes like a charm.
0

Featured Post

Free Tool: ZipGrep

ZipGrep is a utility that can list and search zip (.war, .ear, .jar, etc) archives for text patterns, without the need to extract the archive's contents.

One of a set of tools we're offering as a way to say thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Introduction I have seen many questions in this Delphi topic area where queries in threads are needed or suggested. I know bumped into a similar need. This article will address some of the concepts when dealing with a multithreaded delphi database…
In my programming career I have only very rarely run into situations where operator overloading would be of any use in my work.  Normally those situations involved math with either overly large numbers (hundreds of thousands of digits or accuracy re…
Email security requires an ever evolving service that stays up to date with counter-evolving threats. The Email Laundry perform Research and Development to ensure their email security service evolves faster than cyber criminals. We apply our Threat…
Although Jacob Bernoulli (1654-1705) has been credited as the creator of "Binomial Distribution Table", Gottfried Leibniz (1646-1716) did his dissertation on the subject in 1666; Leibniz you may recall is the co-inventor of "Calculus" and beat Isaac…

839 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question