My understanding is that WML wants you to put all sorts of interrelated
data together into one "deck" as cards, and you browse between the
interrelated cards primarily, which means you have everything downloaded
first and you don't have to worry about downloading more each time you
do something. And seeing the speed and processing power of these things,
this is a good idea. If you're familiar with older Macs, think Hypercard.
--
Dave Jacoby, Systems Administrator for Arnett Clinic
(765) 448-8098 [EMAIL PROTECTED]
If you're too tired to type the password right,
you shouldn't be root anyway.
> -----Original Message-----
> From: Lee Goddard [SMTP:[EMAIL PROTECTED]]
> Sent: Wednesday, May 30, 2001 2:53 PM
> To: Pete Sergeant; [EMAIL PROTECTED]
> Subject: RE: Algorithms for Data Division
>
> But are cards loaded all at once???
>
> > -----Original Message-----
> > From: Pete Sergeant [mailto:[EMAIL PROTECTED]]
> > Sent: 30 May 2001 20:05
> > To: [EMAIL PROTECTED]
> > Subject: Algorithms for Data Division
> >
> >
> > Hi hi.
> >
> > I'm writing an HTML->WML convertor...
> >
> > Anyway, the hard bit is done, which brings me on to the hardest part -
> > obviously WAP devices have quite a small memory, and data tends
> > to be split
> > into 'cards'. What I want to know, is do any algorithms or
> > similar exist for
> > splitting a piece of somewhat formatted text into smaller chunks?
> >
> > _pete
> >
> _________________________________________________________________________
> > Get Your Private, Free E-mail from MSN Hotmail at
> http://www.hotmail.com.
> >
