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=-0.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD,
	FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,40c39923d4ce99fe
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.68.201.129 with SMTP id ka1mr5175515pbc.6.1331663386573;
        Tue, 13 Mar 2012 11:29:46 -0700 (PDT)
Path: 
 h9ni22227pbe.0!nntp.google.com!news1.google.com!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
From: Marc C <mc.provisional@gmail.com>
Newsgroups: comp.lang.ada
Subject: Re: Endian problems - what best way to solve it with least effort
Date: Tue, 13 Mar 2012 11:29:46 -0700 (PDT)
Organization: http://groups.google.com
Message-ID: <1295972.3240.1331663386134.JavaMail.geo-discussion-forums@vbai14>
References: <10483391.72.1331661651734.JavaMail.geo-discussion-forums@vbdj6>
NNTP-Posting-Host: 134.223.116.200
Mime-Version: 1.0
X-Trace: posting.google.com 1331663386 13465 127.0.0.1 (13 Mar 2012 18:29:46
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Tue, 13 Mar 2012 18:29:46 +0000 (UTC)
In-Reply-To: <10483391.72.1331661651734.JavaMail.geo-discussion-forums@vbdj6>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=134.223.116.200;
 posting-account=mjE6MAoAAADjsB3NIuKgfHO4u-Elh3cb
User-Agent: G2/1.0
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Date: 2012-03-13T11:29:46-07:00
List-Id: <comp.lang.ada>

On Tuesday, March 13, 2012 1:00:51 PM UTC-5, Anh Vo wrote:
> I have an application previously running on Big Endian machine communicat=
ing with a client simulator through socket. This client is coded in Java ru=
nning on a separate machine. The data exchanged between them have different=
 structures down to bits and bytes.

> What is the best way to solve it with least effort? Thank you in advance =
for your suggestion.

Depending on your performance requirements and the complexity and variety o=
f data structures are being exchanged, consider marshalling/demarshalling u=
sing strings--embedded in an XML or JSON carrier.

Marc A. Criley
Ada sub-reddit moderator
(http://www.reddit.com/r/ada)