Lisp HUG Maillist Archive

How to create an array which size is larger then array-total-size-limit

Hello all,


Common lisp has a constant variable array-total-size-limit which limit
the maximum size of an array,
but in some situation I want to read a very large file(for example its
size is 1G) to one string then parse it.

So my question is that Is there one way to create a very large string
which exceed the size specified by array-total-size-limit?

Thanks.

With Best Regards,
jingtao.

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Re: How to create an array which size is larger then array-total-size-limit

How about making multiple arrays in a list?

Robert

On Tue, Apr 5, 2016 at 6:54 PM, Jingtao Xu <jingtaozf@gmail.com> wrote:

Hello all,


Common lisp has a constant variable array-total-size-limit which limit
the maximum size of an array,
but in some situation I want to read a very large file(for example its
size is 1G) to one string then parse it.

So my question is that Is there one way to create a very large string
which exceed the size specified by array-total-size-limit?

Thanks.

With Best Regards,
jingtao.

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Re: How to create an array which size is larger then array-total-size-limit

That's what I did now, but it's inconvenient.

I find that sbcl has a very large value for array-total-size-limit but
lispworks has a very small one,that's inconvenient for large data
processing.


With best regards,
jingtao.

On Wed, Apr 6, 2016 at 10:31 AM, Robert Smith <quad@symbo1ics.com> wrote:
> How about making multiple arrays in a list?
>
> Robert
>
> On Tue, Apr 5, 2016 at 6:54 PM, Jingtao Xu <jingtaozf@gmail.com> wrote:
>>
>>
>> Hello all,
>>
>>
>> Common lisp has a constant variable array-total-size-limit which limit
>> the maximum size of an array,
>> but in some situation I want to read a very large file(for example its
>> size is 1G) to one string then parse it.
>>
>> So my question is that Is there one way to create a very large string
>> which exceed the size specified by array-total-size-limit?
>>
>> Thanks.
>>
>> With Best Regards,
>> jingtao.
>>
>> _______________________________________________
>> Lisp Hug - the mailing list for LispWorks users
>> lisp-hug@lispworks.com
>> http://www.lispworks.com/support/lisp-hug.html
>>
>

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Re: How to create an array which size is larger then array-total-size-limit

Hi Raymond,

Thanks for your advice but the memory-mapped solution can't be used
directly because the parser only accept simple string as input.

Maybe lispworks should support a very large value for array-total-size-limit.

With Best Regards,
jingtao.


On Wed, Apr 6, 2016 at 11:16 AM, Raymond Wiker <rwiker@gmail.com> wrote:
> Maybe an abstraction over memory-mapped files might be useful? E.g,
> http://permalink.gmane.org/gmane.lisp.lispworks.general/10540.
>
> On 06 Apr 2016, at 05:01 , Jingtao Xu <jingtaozf@gmail.com> wrote:
>
>
> That's what I did now, but it's inconvenient.
>
> I find that sbcl has a very large value for array-total-size-limit but
> lispworks has a very small one,that's inconvenient for large data
> processing.
>
>
> With best regards,
> jingtao.
>
> On Wed, Apr 6, 2016 at 10:31 AM, Robert Smith <quad@symbo1ics.com> wrote:
>
> How about making multiple arrays in a list?
>
> Robert
>
> On Tue, Apr 5, 2016 at 6:54 PM, Jingtao Xu <jingtaozf@gmail.com> wrote:
>
>
>
> Hello all,
>
>
> Common lisp has a constant variable array-total-size-limit which limit
> the maximum size of an array,
> but in some situation I want to read a very large file(for example its
> size is 1G) to one string then parse it.
>
> So my question is that Is there one way to create a very large string
> which exceed the size specified by array-total-size-limit?
>
> Thanks.
>
> With Best Regards,
> jingtao.
>
> _______________________________________________
> Lisp Hug - the mailing list for LispWorks users
> lisp-hug@lispworks.com
> http://www.lispworks.com/support/lisp-hug.html
>
>
>
> _______________________________________________
> Lisp Hug - the mailing list for LispWorks users
> lisp-hug@lispworks.com
> http://www.lispworks.com/support/lisp-hug.html
>
>

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Re: How to create an array which size is larger then array-total-size-limit

What does this parser do?

Am 06.04.16 um 08:04 schrieb Jingtao Xu:
>
> Hi Raymond,
>
> Thanks for your advice but the memory-mapped solution can't be used
> directly because the parser only accept simple string as input.
>
> Maybe lispworks should support a very large value for array-total-size-limit.
>
> With Best Regards,
> jingtao.
>
>
> On Wed, Apr 6, 2016 at 11:16 AM, Raymond Wiker <rwiker@gmail.com> wrote:
>> Maybe an abstraction over memory-mapped files might be useful? E.g,
>> http://permalink.gmane.org/gmane.lisp.lispworks.general/10540.
>>
>> On 06 Apr 2016, at 05:01 , Jingtao Xu <jingtaozf@gmail.com> wrote:
>>
>>
>> That's what I did now, but it's inconvenient.
>>
>> I find that sbcl has a very large value for array-total-size-limit but
>> lispworks has a very small one,that's inconvenient for large data
>> processing.
>>
>>
>> With best regards,
>> jingtao.
>>
>> On Wed, Apr 6, 2016 at 10:31 AM, Robert Smith <quad@symbo1ics.com> wrote:
>>
>> How about making multiple arrays in a list?
>>
>> Robert
>>
>> On Tue, Apr 5, 2016 at 6:54 PM, Jingtao Xu <jingtaozf@gmail.com> wrote:
>>
>>
>>
>> Hello all,
>>
>>
>> Common lisp has a constant variable array-total-size-limit which limit
>> the maximum size of an array,
>> but in some situation I want to read a very large file(for example its
>> size is 1G) to one string then parse it.
>>
>> So my question is that Is there one way to create a very large string
>> which exceed the size specified by array-total-size-limit?
>>
>> Thanks.
>>
>> With Best Regards,
>> jingtao.
>>
>> _______________________________________________
>> Lisp Hug - the mailing list for LispWorks users
>> lisp-hug@lispworks.com
>> http://www.lispworks.com/support/lisp-hug.html
>>
>>
>>
>> _______________________________________________
>> Lisp Hug - the mailing list for LispWorks users
>> lisp-hug@lispworks.com
>> http://www.lispworks.com/support/lisp-hug.html
>>
>>
>
> _______________________________________________
> Lisp Hug - the mailing list for LispWorks users
> lisp-hug@lispworks.com
> http://www.lispworks.com/support/lisp-hug.html
>
>

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Re: How to create an array which size is larger then array-total-size-limit

If this parser can read from streams it should be possible to use a combination of make-string-input-stream and make-concatenated-stream... it may also be possible to have a stream (gray stream?) that uses a memory-mapped file or some other mechanism.



On Wed, Apr 6, 2016 at 8:23 AM, Jens Teich <info@jensteich.de> wrote:
What does this parser do?

Am 06.04.16 um 08:04 schrieb Jingtao Xu:


Hi Raymond,

Thanks for your advice but the memory-mapped solution can't be used
directly because the parser only accept simple string as input.

Maybe lispworks should support a very large value for array-total-size-limit.

With Best Regards,
jingtao.


On Wed, Apr 6, 2016 at 11:16 AM, Raymond Wiker <rwiker@gmail.com> wrote:
Maybe an abstraction over memory-mapped files might be useful? E.g,
http://permalink.gmane.org/gmane.lisp.lispworks.general/10540.

On 06 Apr 2016, at 05:01 , Jingtao Xu <jingtaozf@gmail.com> wrote:


That's what I did now, but it's inconvenient.

I find that sbcl has a very large value for array-total-size-limit but
lispworks has a very small one,that's inconvenient for large data
processing.


With best regards,
jingtao.

On Wed, Apr 6, 2016 at 10:31 AM, Robert Smith <quad@symbo1ics.com> wrote:

How about making multiple arrays in a list?

Robert

On Tue, Apr 5, 2016 at 6:54 PM, Jingtao Xu <jingtaozf@gmail.com> wrote:



Hello all,


Common lisp has a constant variable array-total-size-limit which limit
the maximum size of an array,
but in some situation I want to read a very large file(for example its
size is 1G) to one string then parse it.

So my question is that Is there one way to create a very large string
which exceed the size specified by array-total-size-limit?

Thanks.

With Best Regards,
jingtao.

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html



_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html



_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html




Re: How to create an array which size is larger then array-total-size-limit

Or redefine char/aref/whatever accessor this parser uses
to read memory mapped octets instead of string characters.

   Peace
      --Devon

P.S. If this parser can read from streams, just open the file.

On Wed, April 6, 2016 02:13, Raymond Wiker wrote:
> If this parser can read from streams it should be possible to use a
> combination of make-string-input-stream and make-concatenated-stream... it
>  may also be possible to have a stream (gray stream?) that uses a
> memory-mapped file or some other mechanism.
>
>
>
> On Wed, Apr 6, 2016 at 8:23 AM, Jens Teich <info@jensteich.de> wrote:
>
>
>> What does this parser do?
>>
>>
>> Am 06.04.16 um 08:04 schrieb Jingtao Xu:
>>
>>
>>
>>> Hi Raymond,
>>>
>>>
>>> Thanks for your advice but the memory-mapped solution can't be used
>>> directly because the parser only accept simple string as input.
>>>
>>> Maybe lispworks should support a very large value for
>>> array-total-size-limit.
>>>
>>> With Best Regards,
>>> jingtao.
>>>
>>>
>>> On Wed, Apr 6, 2016 at 11:16 AM, Raymond Wiker <rwiker@gmail.com>
>>> wrote:
>>>
>>>
>>>> Maybe an abstraction over memory-mapped files might be useful? E.g,
>>>>  http://permalink.gmane.org/gmane.lisp.lispworks.general/10540.
>>>>
>>>>
>>>> On 06 Apr 2016, at 05:01 , Jingtao Xu <jingtaozf@gmail.com> wrote:
>>>>
>>>>
>>>>
>>>> That's what I did now, but it's inconvenient.
>>>>
>>>>
>>>> I find that sbcl has a very large value for array-total-size-limit
>>>> but lispworks has a very small one,that's inconvenient for large
>>>> data processing.
>>>>
>>>>
>>>> With best regards,
>>>> jingtao.
>>>>
>>>> On Wed, Apr 6, 2016 at 10:31 AM, Robert Smith <quad@symbo1ics.com>
>>>> wrote:
>>>>
>>>>
>>>> How about making multiple arrays in a list?
>>>>
>>>>
>>>> Robert
>>>>
>>>>
>>>> On Tue, Apr 5, 2016 at 6:54 PM, Jingtao Xu <jingtaozf@gmail.com>
>>>> wrote:
>>>>
>>>>
>>>>
>>>>
>>>> Hello all,
>>>>
>>>>
>>>>
>>>> Common lisp has a constant variable array-total-size-limit which
>>>> limit the maximum size of an array, but in some situation I want to
>>>> read a very large file(for example its size is 1G) to one string
>>>> then parse it.
>>>>
>>>> So my question is that Is there one way to create a very large
>>>> string which exceed the size specified by array-total-size-limit?
>>>>
>>>> Thanks.
>>>>
>>>>
>>>> With Best Regards,
>>>> jingtao.
>>>>
>>>> _______________________________________________
>>>> Lisp Hug - the mailing list for LispWorks users
>>>> lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug.html
>>>>
>>>>
>>>>
>>>>
>>>> _______________________________________________
>>>> Lisp Hug - the mailing list for LispWorks users
>>>> lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug.html
>>>>
>>>>
>>>>
>>>>
>>> _______________________________________________
>>> Lisp Hug - the mailing list for LispWorks users
>>> lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug.html
>>>
>>>
>>>
>>>
>>
>


_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Re: How to create an array which size is larger then array-total-size-limit

I use a json parser jsown: https://github.com/madnificent/jsown
@Raymond, It only accept string as input so a little extra work should
be done to support memory mapped access.

@Devon, The idea to redefine acessor is good but reading them in
several steps is a little more convenient for me to parse it(as input
file is an array of json):

(with-open-file (in path)
        (loop with eof-p = nil
              with step = 20000
              with result = nil
              until eof-p
              do (let* ((json (with-output-to-string (stream)
                                (write-char #\[ stream)
                                (loop for j from 0 below step
                                      for line = (read-line in nil nil)
                                      do (cond (line (write-sequence
line stream)
                                                     (write-char #\, stream))
                                               (t (setf eof-p t)
                                                  (loop-finish)))))))
                   (setf (aref json (1- (length json))) #\])
                   (setf result (append result (jsown:parse json))))
              finally (return result)))


Thanks all for your interesting ideas :)


With Best Regards,
jingtao.




On Wed, Apr 6, 2016 at 3:29 PM, Devon Sean McCullough
<LispWorks@jovi.net> wrote:
> Or redefine char/aref/whatever accessor this parser uses
> to read memory mapped octets instead of string characters.
>
>    Peace
>       --Devon
>
> P.S. If this parser can read from streams, just open the file.
>
> On Wed, April 6, 2016 02:13, Raymond Wiker wrote:
>> If this parser can read from streams it should be possible to use a
>> combination of make-string-input-stream and make-concatenated-stream... it
>>  may also be possible to have a stream (gray stream?) that uses a
>> memory-mapped file or some other mechanism.
>>
>>
>>
>> On Wed, Apr 6, 2016 at 8:23 AM, Jens Teich <info@jensteich.de> wrote:
>>
>>
>>> What does this parser do?
>>>
>>>
>>> Am 06.04.16 um 08:04 schrieb Jingtao Xu:
>>>
>>>
>>>
>>>> Hi Raymond,
>>>>
>>>>
>>>> Thanks for your advice but the memory-mapped solution can't be used
>>>> directly because the parser only accept simple string as input.
>>>>
>>>> Maybe lispworks should support a very large value for
>>>> array-total-size-limit.
>>>>
>>>> With Best Regards,
>>>> jingtao.
>>>>
>>>>
>>>> On Wed, Apr 6, 2016 at 11:16 AM, Raymond Wiker <rwiker@gmail.com>
>>>> wrote:
>>>>
>>>>
>>>>> Maybe an abstraction over memory-mapped files might be useful? E.g,
>>>>>  http://permalink.gmane.org/gmane.lisp.lispworks.general/10540.
>>>>>
>>>>>
>>>>> On 06 Apr 2016, at 05:01 , Jingtao Xu <jingtaozf@gmail.com> wrote:
>>>>>
>>>>>
>>>>>
>>>>> That's what I did now, but it's inconvenient.
>>>>>
>>>>>
>>>>> I find that sbcl has a very large value for array-total-size-limit
>>>>> but lispworks has a very small one,that's inconvenient for large
>>>>> data processing.
>>>>>
>>>>>
>>>>> With best regards,
>>>>> jingtao.
>>>>>
>>>>> On Wed, Apr 6, 2016 at 10:31 AM, Robert Smith <quad@symbo1ics.com>
>>>>> wrote:
>>>>>
>>>>>
>>>>> How about making multiple arrays in a list?
>>>>>
>>>>>
>>>>> Robert
>>>>>
>>>>>
>>>>> On Tue, Apr 5, 2016 at 6:54 PM, Jingtao Xu <jingtaozf@gmail.com>
>>>>> wrote:
>>>>>
>>>>>
>>>>>
>>>>>
>>>>> Hello all,
>>>>>
>>>>>
>>>>>
>>>>> Common lisp has a constant variable array-total-size-limit which
>>>>> limit the maximum size of an array, but in some situation I want to
>>>>> read a very large file(for example its size is 1G) to one string
>>>>> then parse it.
>>>>>
>>>>> So my question is that Is there one way to create a very large
>>>>> string which exceed the size specified by array-total-size-limit?
>>>>>
>>>>> Thanks.
>>>>>
>>>>>
>>>>> With Best Regards,
>>>>> jingtao.
>>>>>
>>>>> _______________________________________________
>>>>> Lisp Hug - the mailing list for LispWorks users
>>>>> lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug.html
>>>>>
>>>>>
>>>>>
>>>>>
>>>>> _______________________________________________
>>>>> Lisp Hug - the mailing list for LispWorks users
>>>>> lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug.html
>>>>>
>>>>>
>>>>>
>>>>>
>>>> _______________________________________________
>>>> Lisp Hug - the mailing list for LispWorks users
>>>> lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug.html
>>>>
>>>>
>>>>
>>>>
>>>
>>
>

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Re: How to create an array which size is larger then array-total-size-limit

And there is of course the option to let the Lisp reader do the job:

https://gist.github.com/chaitanyagupta/9324402

~Jens


Am 06.04.16 um 10:27 schrieb Jingtao Xu:
>
> I use a json parser jsown: https://github.com/madnificent/jsown
> @Raymond, It only accept string as input so a little extra work should
> be done to support memory mapped access.
>
> @Devon, The idea to redefine acessor is good but reading them in
> several steps is a little more convenient for me to parse it(as input
> file is an array of json):
>
> (with-open-file (in path)
>          (loop with eof-p = nil
>                with step = 20000
>                with result = nil
>                until eof-p
>                do (let* ((json (with-output-to-string (stream)
>                                  (write-char #\[ stream)
>                                  (loop for j from 0 below step
>                                        for line = (read-line in nil nil)
>                                        do (cond (line (write-sequence
> line stream)
>                                                       (write-char #\, stream))
>                                                 (t (setf eof-p t)
>                                                    (loop-finish)))))))
>                     (setf (aref json (1- (length json))) #\])
>                     (setf result (append result (jsown:parse json))))
>                finally (return result)))
>
>
> Thanks all for your interesting ideas :)
>
>
> With Best Regards,
> jingtao.
>
>
>
>
> On Wed, Apr 6, 2016 at 3:29 PM, Devon Sean McCullough
> <LispWorks@jovi.net> wrote:
>> Or redefine char/aref/whatever accessor this parser uses
>> to read memory mapped octets instead of string characters.
>>
>>     Peace
>>        --Devon
>>
>> P.S. If this parser can read from streams, just open the file.
>>
>> On Wed, April 6, 2016 02:13, Raymond Wiker wrote:
>>> If this parser can read from streams it should be possible to use a
>>> combination of make-string-input-stream and make-concatenated-stream... it
>>>   may also be possible to have a stream (gray stream?) that uses a
>>> memory-mapped file or some other mechanism.
>>>
>>>
>>>
>>> On Wed, Apr 6, 2016 at 8:23 AM, Jens Teich <info@jensteich.de> wrote:
>>>
>>>
>>>> What does this parser do?
>>>>
>>>>
>>>> Am 06.04.16 um 08:04 schrieb Jingtao Xu:
>>>>
>>>>
>>>>
>>>>> Hi Raymond,
>>>>>
>>>>>
>>>>> Thanks for your advice but the memory-mapped solution can't be used
>>>>> directly because the parser only accept simple string as input.
>>>>>
>>>>> Maybe lispworks should support a very large value for
>>>>> array-total-size-limit.
>>>>>
>>>>> With Best Regards,
>>>>> jingtao.
>>>>>
>>>>>
>>>>> On Wed, Apr 6, 2016 at 11:16 AM, Raymond Wiker <rwiker@gmail.com>
>>>>> wrote:
>>>>>
>>>>>
>>>>>> Maybe an abstraction over memory-mapped files might be useful? E.g,
>>>>>>   http://permalink.gmane.org/gmane.lisp.lispworks.general/10540.
>>>>>>
>>>>>>
>>>>>> On 06 Apr 2016, at 05:01 , Jingtao Xu <jingtaozf@gmail.com> wrote:
>>>>>>
>>>>>>
>>>>>>
>>>>>> That's what I did now, but it's inconvenient.
>>>>>>
>>>>>>
>>>>>> I find that sbcl has a very large value for array-total-size-limit
>>>>>> but lispworks has a very small one,that's inconvenient for large
>>>>>> data processing.
>>>>>>
>>>>>>
>>>>>> With best regards,
>>>>>> jingtao.
>>>>>>
>>>>>> On Wed, Apr 6, 2016 at 10:31 AM, Robert Smith <quad@symbo1ics.com>
>>>>>> wrote:
>>>>>>
>>>>>>
>>>>>> How about making multiple arrays in a list?
>>>>>>
>>>>>>
>>>>>> Robert
>>>>>>
>>>>>>
>>>>>> On Tue, Apr 5, 2016 at 6:54 PM, Jingtao Xu <jingtaozf@gmail.com>
>>>>>> wrote:
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> Hello all,
>>>>>>
>>>>>>
>>>>>>
>>>>>> Common lisp has a constant variable array-total-size-limit which
>>>>>> limit the maximum size of an array, but in some situation I want to
>>>>>> read a very large file(for example its size is 1G) to one string
>>>>>> then parse it.
>>>>>>
>>>>>> So my question is that Is there one way to create a very large
>>>>>> string which exceed the size specified by array-total-size-limit?
>>>>>>
>>>>>> Thanks.
>>>>>>
>>>>>>
>>>>>> With Best Regards,
>>>>>> jingtao.
>>>>>>
>>>>>> _______________________________________________
>>>>>> Lisp Hug - the mailing list for LispWorks users
>>>>>> lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug.html
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> _______________________________________________
>>>>>> Lisp Hug - the mailing list for LispWorks users
>>>>>> lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug.html
>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>> _______________________________________________
>>>>> Lisp Hug - the mailing list for LispWorks users
>>>>> lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug.html
>>>>>
>>>>>
>>>>>
>>>>>
>>>>
>>>
>>
>
> _______________________________________________
> Lisp Hug - the mailing list for LispWorks users
> lisp-hug@lispworks.com
> http://www.lispworks.com/support/lisp-hug.html
>
>

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Re: How to create an array which size is larger then array-total-size-limit

Or use a different json library, which is not limited to strings (e.g, cl-json).

On Wed, Apr 6, 2016 at 10:59 AM, Jens Teich <info@jensteich.de> wrote:
And there is of course the option to let the Lisp reader do the job:

https://gist.github.com/chaitanyagupta/9324402

~Jens


Am 06.04.16 um 10:27 schrieb Jingtao Xu:


I use a json parser jsown: https://github.com/madnificent/jsown
@Raymond, It only accept string as input so a little extra work should
be done to support memory mapped access.

@Devon, The idea to redefine acessor is good but reading them in
several steps is a little more convenient for me to parse it(as input
file is an array of json):

(with-open-file (in path)
         (loop with eof-p = nil
               with step = 20000
               with result = nil
               until eof-p
               do (let* ((json (with-output-to-string (stream)
                                 (write-char #\[ stream)
                                 (loop for j from 0 below step
                                       for line = (read-line in nil nil)
                                       do (cond (line (write-sequence
line stream)
                                                      (write-char #\, stream))
                                                (t (setf eof-p t)
                                                   (loop-finish)))))))
                    (setf (aref json (1- (length json))) #\])
                    (setf result (append result (jsown:parse json))))
               finally (return result)))


Thanks all for your interesting ideas :)


With Best Regards,
jingtao.




On Wed, Apr 6, 2016 at 3:29 PM, Devon Sean McCullough
<LispWorks@jovi.net> wrote:
Or redefine char/aref/whatever accessor this parser uses
to read memory mapped octets instead of string characters.

    Peace
       --Devon

P.S. If this parser can read from streams, just open the file.

On Wed, April 6, 2016 02:13, Raymond Wiker wrote:
If this parser can read from streams it should be possible to use a
combination of make-string-input-stream and make-concatenated-stream... it
  may also be possible to have a stream (gray stream?) that uses a
memory-mapped file or some other mechanism.



On Wed, Apr 6, 2016 at 8:23 AM, Jens Teich <info@jensteich.de> wrote:


What does this parser do?


Am 06.04.16 um 08:04 schrieb Jingtao Xu:



Hi Raymond,


Thanks for your advice but the memory-mapped solution can't be used
directly because the parser only accept simple string as input.

Maybe lispworks should support a very large value for
array-total-size-limit.

With Best Regards,
jingtao.


On Wed, Apr 6, 2016 at 11:16 AM, Raymond Wiker <rwiker@gmail.com>
wrote:


Maybe an abstraction over memory-mapped files might be useful? E.g,
  http://permalink.gmane.org/gmane..lisp.lispworks.general/10540.


On 06 Apr 2016, at 05:01 , Jingtao Xu <jingtaozf@gmail.com> wrote:



That's what I did now, but it's inconvenient.


I find that sbcl has a very large value for array-total-size-limit
but lispworks has a very small one,that's inconvenient for large
data processing.


With best regards,
jingtao.

On Wed, Apr 6, 2016 at 10:31 AM, Robert Smith <quad@symbo1ics.com>
wrote:


How about making multiple arrays in a list?


Robert


On Tue, Apr 5, 2016 at 6:54 PM, Jingtao Xu <jingtaozf@gmail.com>
wrote:




Hello all,



Common lisp has a constant variable array-total-size-limit which
limit the maximum size of an array, but in some situation I want to
read a very large file(for example its size is 1G) to one string
then parse it.

So my question is that Is there one way to create a very large
string which exceed the size specified by array-total-size-limit?

Thanks.


With Best Regards,
jingtao.

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug..html




_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug..html




_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com http://www.lispworks.com/support/lisp-hug..html








_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html




Re: How to create an array which size is larger then array-total-size-limit

Jingtao Xu <jingtaozf@gmail.com> writes:

> Hello all,
>
>
> Common lisp has a constant variable array-total-size-limit which limit
> the maximum size of an array,
> but in some situation I want to read a very large file(for example its
> size is 1G) to one string then parse it.
>
> So my question is that Is there one way to create a very large string
> which exceed the size specified by array-total-size-limit?

You can do something like the following (of course, you will have to
implement like aref and length all the other functions of CL you would
want to apply on your big arrays (eg. map, map-into, subseq, etc).


(eval-when (:compile-toplevel :load-toplevel :execute)
  (pushnew :test *features*))

(defpackage "BIGARRAY"
  (:use "COMMON-LISP")
  (:shadow "MAKE-ARRAY" "AREF" "LENGTH"
           #+test "ARRAY-TOTAL-SIZE-LIMIT")
  (:export "MAKE-ARRAY" "AREF" "LENGTH"
           #+test "ARRAY-TOTAL-SIZE-LIMIT"))

(defpackage "CL-WITH-BIGARRAY"
  (:use "COMMON-LISP" "BIGARRAY")
  (:shadowing-import-from "BIGARRAY"
                          "MAKE-ARRAY" "AREF" "LENGTH"
                          #+test "ARRAY-TOTAL-SIZE-LIMIT")
  (:export . #.(let ((e '()))
                 (do-external-symbols (s "COMMON-LISP" e)
                   (push (symbol-name s) e)))))

(in-package "BIGARRAY")

#+test (defconstant ARRAY-TOTAL-SIZE-LIMIT 8)

(defstruct bigvector
  total-size
  slice-size
  last-slice-size
  slices)

(defun allocate-vector (size element-type #|fill-pointer etc|#)
  (multiple-value-bind (nslices last-slice-size)
      (truncate size array-total-size-limit)
    (if (plusp last-slice-size)
        (incf nslices)
        (setf last-slice-size array-total-size-limit))
    (let ((v (make-bigvector :total-size size
                             :slice-size array-total-size-limit
                             :last-slice-size last-slice-size
                             :slices (make-array nslices))))
      ;; (bigvector-slices v) could be a bigvector too!
      (dotimes (i nslices)
        (setf (aref (bigvector-slices v) i)
              (cl:make-array (if (= i (1- nslices))
                                 last-slice-size
                                 array-total-size-limit)
                             :element-type element-type
                             #|etc|#)))
      v)))

(defmethod make-array ((size integer) &rest parameters &key (element-type t) &allow-other-keys)
  (if (< size array-total-size-limit)
      (apply (function cl:make-array) size parameters)
      (allocate-vector size element-type)))

(defmethod make-array ((size list)  &rest parameters &key &allow-other-keys)

  ;; For multi-dimensionnal arrays you have the opportunity to
  ;; optimize the mapping of the planes into slices.

  ;; For example, by processing (reverse size) and taking dimensions
  ;; while their product is less than array-total-size-limit, we can
  ;; use a CL multi-dimensionnal array for a slice, and going on with
  ;; the remaining dimensions for the meta-slices and
  ;; meta-meta-slices, etc.  So the slices could be smaller than
  ;; array-total-size-limit, but that would allow us to process the
  ;; multidimension array efficiently.

  (not-implemented-yet))


;; Forward to CL classes:

(defmethod aref ((a array) &rest indices)
  (apply (function cl:aref) a indices))

(defmethod (setf aref) (new-value (a array) &rest indices)
  (setf (apply (function cl:aref) a indices) new-value))

(defmethod length ((v sequence))
  (cl:length v))

;; New methods for our classes:

(defmethod aref ((v bigvector) &rest indices)
  (assert (= 1 (length indices)))
  (multiple-value-bind (slice index) (truncate (first indices) array-total-size-limit)
    ;; Notice the recursive call to aref:
    (cl:aref (aref (bigvector-slices v) slice) index)))

(defmethod (setf aref) (new-value (v bigvector) &rest indices)
  (assert (= 1 (length indices)))
  (multiple-value-bind (slice index) (truncate (first indices) array-total-size-limit)
    ;; Notice the recursive call to aref:
    (setf (cl:aref (aref (bigvector-slices v) slice) index) new-value)))

(defmethod length ((v bigvector))
  (bigvector-total-size v))


(defpackage "MY-PROGRAM"
  (:use "CL-WITH-BIGARRAY"))
(in-package "MY-PROGRAM")

(pprint (make-array (+ 4 (expt 8 3))))
;; #S(bigvector :total-size 516 :slice-size 8 :last-slice-size 4
;;              :slices #S(bigvector :total-size 65 :slice-size 8 :last-slice-size 1
;;                                   :slices #S(bigvector :total-size 9 :slice-size 8 :last-slice-size 1
;;                                                        :slices #(#(#(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)))
;;                                                                  #(#(#(0 0 0 0)))))))

(let ((v (make-array (+ 4 (expt 8 3)))))
  (loop :for i :below (+ 4 (expt 8 3))
        :do (setf (aref v i) i))
  (loop :for i :below (+ 4 (expt 8 3))
        :by 10
        :do (prin1 (aref v i)) (princ " "))
  (terpri)
  (pprint v)
  (values))

;; 0 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 200 210 220 230 240 250 260 270 280 290 300 310 320 330 340 350 360 370 380 390 400 410 420 430 440 450 460 470 480 490 500 510 
;; 
;; #S(bigvector :total-size 516 :slice-size 8 :last-slice-size 4
;;              :slices #S(bigvector :total-size 65 :slice-size 8 :last-slice-size 1
;;                                   :slices #S(bigvector :total-size 9 :slice-size 8 :last-slice-size 1
;;                                                        :slices #(#(#(#(0 1 2 3 4 5 6 7) #(8 9 10 11 12 13 14 15)
;;                                                                      #(16 17 18 19 20 21 22 23)
;;                                                                      #(24 25 26 27 28 29 30 31)
;;                                                                      #(32 33 34 35 36 37 38 39)
;;                                                                      #(40 41 42 43 44 45 46 47)
;;                                                                      #(48 49 50 51 52 53 54 55)
;;                                                                      #(56 57 58 59 60 61 62 63))
;;                                                                    #(#(64 65 66 67 68 69 70 71)
;;                                                                      #(72 73 74 75 76 77 78 79)
;;                                                                      #(80 81 82 83 84 85 86 87)
;;                                                                      #(88 89 90 91 92 93 94 95)
;;                                                                      #(96 97 98 99 100 101 102 103)
;;                                                                      #(104 105 106 107 108 109 110 111)
;;                                                                      #(112 113 114 115 116 117 118 119)
;;                                                                      #(120 121 122 123 124 125 126 127))
;;                                                                    #(#(128 129 130 131 132 133 134 135)
;;                                                                      #(136 137 138 139 140 141 142 143)
;;                                                                      #(144 145 146 147 148 149 150 151)
;;                                                                      #(152 153 154 155 156 157 158 159)
;;                                                                      #(160 161 162 163 164 165 166 167)
;;                                                                      #(168 169 170 171 172 173 174 175)
;;                                                                      #(176 177 178 179 180 181 182 183)
;;                                                                      #(184 185 186 187 188 189 190 191))
;;                                                                    #(#(192 193 194 195 196 197 198 199)
;;                                                                      #(200 201 202 203 204 205 206 207)
;;                                                                      #(208 209 210 211 212 213 214 215)
;;                                                                      #(216 217 218 219 220 221 222 223)
;;                                                                      #(224 225 226 227 228 229 230 231)
;;                                                                      #(232 233 234 235 236 237 238 239)
;;                                                                      #(240 241 242 243 244 245 246 247)
;;                                                                      #(248 249 250 251 252 253 254 255))
;;                                                                    #(#(256 257 258 259 260 261 262 263)
;;                                                                      #(264 265 266 267 268 269 270 271)
;;                                                                      #(272 273 274 275 276 277 278 279)
;;                                                                      #(280 281 282 283 284 285 286 287)
;;                                                                      #(288 289 290 291 292 293 294 295)
;;                                                                      #(296 297 298 299 300 301 302 303)
;;                                                                      #(304 305 306 307 308 309 310 311)
;;                                                                      #(312 313 314 315 316 317 318 319))
;;                                                                    #(#(320 321 322 323 324 325 326 327)
;;                                                                      #(328 329 330 331 332 333 334 335)
;;                                                                      #(336 337 338 339 340 341 342 343)
;;                                                                      #(344 345 346 347 348 349 350 351)
;;                                                                      #(352 353 354 355 356 357 358 359)
;;                                                                      #(360 361 362 363 364 365 366 367)
;;                                                                      #(368 369 370 371 372 373 374 375)
;;                                                                      #(376 377 378 379 380 381 382 383))
;;                                                                    #(#(384 385 386 387 388 389 390 391)
;;                                                                      #(392 393 394 395 396 397 398 399)
;;                                                                      #(400 401 402 403 404 405 406 407)
;;                                                                      #(408 409 410 411 412 413 414 415)
;;                                                                      #(416 417 418 419 420 421 422 423)
;;                                                                      #(424 425 426 427 428 429 430 431)
;;                                                                      #(432 433 434 435 436 437 438 439)
;;                                                                      #(440 441 442 443 444 445 446 447))
;;                                                                    #(#(448 449 450 451 452 453 454 455)
;;                                                                      #(456 457 458 459 460 461 462 463)
;;                                                                      #(464 465 466 467 468 469 470 471)
;;                                                                      #(472 473 474 475 476 477 478 479)
;;                                                                      #(480 481 482 483 484 485 486 487)
;;                                                                      #(488 489 490 491 492 493 494 495)
;;                                                                      #(496 497 498 499 500 501 502 503)
;;                                                                      #(504 505 506 507 508 509 510 511)))
;;                                                                  #(#(#(512 513 514 515)))))))

-- 
__Pascal Bourguignon__                 http://www.informatimago.com/
“The factory of the future will have only two employees, a man and a
dog. The man will be there to feed the dog. The dog will be there to
keep the man from touching the equipment.” -- Carl Bass CEO Autodesk

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Re: How to create an array which size is larger then array-total-size-limit

Hi Pascal:

That's what I want, thanks.

By this wrapper, it will make large data analysis more easier.:)

With Best Regards,
jingtao.


On Fri, Apr 8, 2016 at 6:42 AM, Pascal J. Bourguignon
<pjb@informatimago.com> wrote:
>
> Jingtao Xu <jingtaozf@gmail.com> writes:
>
>> Hello all,
>>
>>
>> Common lisp has a constant variable array-total-size-limit which limit
>> the maximum size of an array,
>> but in some situation I want to read a very large file(for example its
>> size is 1G) to one string then parse it.
>>
>> So my question is that Is there one way to create a very large string
>> which exceed the size specified by array-total-size-limit?
>
> You can do something like the following (of course, you will have to
> implement like aref and length all the other functions of CL you would
> want to apply on your big arrays (eg. map, map-into, subseq, etc).
>
>
> (eval-when (:compile-toplevel :load-toplevel :execute)
>   (pushnew :test *features*))
>
> (defpackage "BIGARRAY"
>   (:use "COMMON-LISP")
>   (:shadow "MAKE-ARRAY" "AREF" "LENGTH"
>            #+test "ARRAY-TOTAL-SIZE-LIMIT")
>   (:export "MAKE-ARRAY" "AREF" "LENGTH"
>            #+test "ARRAY-TOTAL-SIZE-LIMIT"))
>
> (defpackage "CL-WITH-BIGARRAY"
>   (:use "COMMON-LISP" "BIGARRAY")
>   (:shadowing-import-from "BIGARRAY"
>                           "MAKE-ARRAY" "AREF" "LENGTH"
>                           #+test "ARRAY-TOTAL-SIZE-LIMIT")
>   (:export . #.(let ((e '()))
>                  (do-external-symbols (s "COMMON-LISP" e)
>                    (push (symbol-name s) e)))))
>
> (in-package "BIGARRAY")
>
> #+test (defconstant ARRAY-TOTAL-SIZE-LIMIT 8)
>
> (defstruct bigvector
>   total-size
>   slice-size
>   last-slice-size
>   slices)
>
> (defun allocate-vector (size element-type #|fill-pointer etc|#)
>   (multiple-value-bind (nslices last-slice-size)
>       (truncate size array-total-size-limit)
>     (if (plusp last-slice-size)
>         (incf nslices)
>         (setf last-slice-size array-total-size-limit))
>     (let ((v (make-bigvector :total-size size
>                              :slice-size array-total-size-limit
>                              :last-slice-size last-slice-size
>                              :slices (make-array nslices))))
>       ;; (bigvector-slices v) could be a bigvector too!
>       (dotimes (i nslices)
>         (setf (aref (bigvector-slices v) i)
>               (cl:make-array (if (= i (1- nslices))
>                                  last-slice-size
>                                  array-total-size-limit)
>                              :element-type element-type
>                              #|etc|#)))
>       v)))
>
> (defmethod make-array ((size integer) &rest parameters &key (element-type t) &allow-other-keys)
>   (if (< size array-total-size-limit)
>       (apply (function cl:make-array) size parameters)
>       (allocate-vector size element-type)))
>
> (defmethod make-array ((size list)  &rest parameters &key &allow-other-keys)
>
>   ;; For multi-dimensionnal arrays you have the opportunity to
>   ;; optimize the mapping of the planes into slices.
>
>   ;; For example, by processing (reverse size) and taking dimensions
>   ;; while their product is less than array-total-size-limit, we can
>   ;; use a CL multi-dimensionnal array for a slice, and going on with
>   ;; the remaining dimensions for the meta-slices and
>   ;; meta-meta-slices, etc.  So the slices could be smaller than
>   ;; array-total-size-limit, but that would allow us to process the
>   ;; multidimension array efficiently.
>
>   (not-implemented-yet))
>
>
> ;; Forward to CL classes:
>
> (defmethod aref ((a array) &rest indices)
>   (apply (function cl:aref) a indices))
>
> (defmethod (setf aref) (new-value (a array) &rest indices)
>   (setf (apply (function cl:aref) a indices) new-value))
>
> (defmethod length ((v sequence))
>   (cl:length v))
>
> ;; New methods for our classes:
>
> (defmethod aref ((v bigvector) &rest indices)
>   (assert (= 1 (length indices)))
>   (multiple-value-bind (slice index) (truncate (first indices) array-total-size-limit)
>     ;; Notice the recursive call to aref:
>     (cl:aref (aref (bigvector-slices v) slice) index)))
>
> (defmethod (setf aref) (new-value (v bigvector) &rest indices)
>   (assert (= 1 (length indices)))
>   (multiple-value-bind (slice index) (truncate (first indices) array-total-size-limit)
>     ;; Notice the recursive call to aref:
>     (setf (cl:aref (aref (bigvector-slices v) slice) index) new-value)))
>
> (defmethod length ((v bigvector))
>   (bigvector-total-size v))
>
>
> (defpackage "MY-PROGRAM"
>   (:use "CL-WITH-BIGARRAY"))
> (in-package "MY-PROGRAM")
>
> (pprint (make-array (+ 4 (expt 8 3))))
> ;; #S(bigvector :total-size 516 :slice-size 8 :last-slice-size 4
> ;;              :slices #S(bigvector :total-size 65 :slice-size 8 :last-slice-size 1
> ;;                                   :slices #S(bigvector :total-size 9 :slice-size 8 :last-slice-size 1
> ;;                                                        :slices #(#(#(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)))
> ;;                                                                  #(#(#(0 0 0 0)))))))
>
> (let ((v (make-array (+ 4 (expt 8 3)))))
>   (loop :for i :below (+ 4 (expt 8 3))
>         :do (setf (aref v i) i))
>   (loop :for i :below (+ 4 (expt 8 3))
>         :by 10
>         :do (prin1 (aref v i)) (princ " "))
>   (terpri)
>   (pprint v)
>   (values))
>
> ;; 0 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 200 210 220 230 240 250 260 270 280 290 300 310 320 330 340 350 360 370 380 390 400 410 420 430 440 450 460 470 480 490 500 510
> ;;
> ;; #S(bigvector :total-size 516 :slice-size 8 :last-slice-size 4
> ;;              :slices #S(bigvector :total-size 65 :slice-size 8 :last-slice-size 1
> ;;                                   :slices #S(bigvector :total-size 9 :slice-size 8 :last-slice-size 1
> ;;                                                        :slices #(#(#(#(0 1 2 3 4 5 6 7) #(8 9 10 11 12 13 14 15)
> ;;                                                                      #(16 17 18 19 20 21 22 23)
> ;;                                                                      #(24 25 26 27 28 29 30 31)
> ;;                                                                      #(32 33 34 35 36 37 38 39)
> ;;                                                                      #(40 41 42 43 44 45 46 47)
> ;;                                                                      #(48 49 50 51 52 53 54 55)
> ;;                                                                      #(56 57 58 59 60 61 62 63))
> ;;                                                                    #(#(64 65 66 67 68 69 70 71)
> ;;                                                                      #(72 73 74 75 76 77 78 79)
> ;;                                                                      #(80 81 82 83 84 85 86 87)
> ;;                                                                      #(88 89 90 91 92 93 94 95)
> ;;                                                                      #(96 97 98 99 100 101 102 103)
> ;;                                                                      #(104 105 106 107 108 109 110 111)
> ;;                                                                      #(112 113 114 115 116 117 118 119)
> ;;                                                                      #(120 121 122 123 124 125 126 127))
> ;;                                                                    #(#(128 129 130 131 132 133 134 135)
> ;;                                                                      #(136 137 138 139 140 141 142 143)
> ;;                                                                      #(144 145 146 147 148 149 150 151)
> ;;                                                                      #(152 153 154 155 156 157 158 159)
> ;;                                                                      #(160 161 162 163 164 165 166 167)
> ;;                                                                      #(168 169 170 171 172 173 174 175)
> ;;                                                                      #(176 177 178 179 180 181 182 183)
> ;;                                                                      #(184 185 186 187 188 189 190 191))
> ;;                                                                    #(#(192 193 194 195 196 197 198 199)
> ;;                                                                      #(200 201 202 203 204 205 206 207)
> ;;                                                                      #(208 209 210 211 212 213 214 215)
> ;;                                                                      #(216 217 218 219 220 221 222 223)
> ;;                                                                      #(224 225 226 227 228 229 230 231)
> ;;                                                                      #(232 233 234 235 236 237 238 239)
> ;;                                                                      #(240 241 242 243 244 245 246 247)
> ;;                                                                      #(248 249 250 251 252 253 254 255))
> ;;                                                                    #(#(256 257 258 259 260 261 262 263)
> ;;                                                                      #(264 265 266 267 268 269 270 271)
> ;;                                                                      #(272 273 274 275 276 277 278 279)
> ;;                                                                      #(280 281 282 283 284 285 286 287)
> ;;                                                                      #(288 289 290 291 292 293 294 295)
> ;;                                                                      #(296 297 298 299 300 301 302 303)
> ;;                                                                      #(304 305 306 307 308 309 310 311)
> ;;                                                                      #(312 313 314 315 316 317 318 319))
> ;;                                                                    #(#(320 321 322 323 324 325 326 327)
> ;;                                                                      #(328 329 330 331 332 333 334 335)
> ;;                                                                      #(336 337 338 339 340 341 342 343)
> ;;                                                                      #(344 345 346 347 348 349 350 351)
> ;;                                                                      #(352 353 354 355 356 357 358 359)
> ;;                                                                      #(360 361 362 363 364 365 366 367)
> ;;                                                                      #(368 369 370 371 372 373 374 375)
> ;;                                                                      #(376 377 378 379 380 381 382 383))
> ;;                                                                    #(#(384 385 386 387 388 389 390 391)
> ;;                                                                      #(392 393 394 395 396 397 398 399)
> ;;                                                                      #(400 401 402 403 404 405 406 407)
> ;;                                                                      #(408 409 410 411 412 413 414 415)
> ;;                                                                      #(416 417 418 419 420 421 422 423)
> ;;                                                                      #(424 425 426 427 428 429 430 431)
> ;;                                                                      #(432 433 434 435 436 437 438 439)
> ;;                                                                      #(440 441 442 443 444 445 446 447))
> ;;                                                                    #(#(448 449 450 451 452 453 454 455)
> ;;                                                                      #(456 457 458 459 460 461 462 463)
> ;;                                                                      #(464 465 466 467 468 469 470 471)
> ;;                                                                      #(472 473 474 475 476 477 478 479)
> ;;                                                                      #(480 481 482 483 484 485 486 487)
> ;;                                                                      #(488 489 490 491 492 493 494 495)
> ;;                                                                      #(496 497 498 499 500 501 502 503)
> ;;                                                                      #(504 505 506 507 508 509 510 511)))
> ;;                                                                  #(#(#(512 513 514 515)))))))
>
> --
> __Pascal Bourguignon__                 http://www.informatimago.com/
> “The factory of the future will have only two employees, a man and a
> dog. The man will be there to feed the dog. The dog will be there to
> keep the man from touching the equipment.” -- Carl Bass CEO Autodesk
>
> _______________________________________________
> Lisp Hug - the mailing list for LispWorks users
> lisp-hug@lispworks.com
> http://www.lispworks.com/support/lisp-hug.html
>

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Re: How to create an array which size is larger then array-total-size-limit

Hi Pascal,

I changed your code to use lispworks's advice facility,here is the
implementation,hope it is useful for someone else here.

Thanks again.

(defconstant array-max-size (1- array-total-size-limit))
(defstruct bigvector
  total-size
  slice-size
  last-slice-size
  slices)

(declaim (inline allocate-vector))
(defun allocate-vector (size element-type)
  (declare (type integer size))
  (multiple-value-bind (nslices last-slice-size)
      (truncate size array-max-size)
    (if (plusp last-slice-size)
        (incf nslices)
        (setf last-slice-size array-max-size))
    (let ((v (make-bigvector :total-size size
                             :slice-size array-max-size
                             :last-slice-size last-slice-size
                             :slices (make-array nslices))))
      ;; (bigvector-slices v) could be a bigvector too!
      (dotimes (i nslices)
        (setf (aref (bigvector-slices v) i)
              (cl:make-array (if (= i (1- nslices))
                                 last-slice-size
                                 array-max-size)
                             :element-type element-type)))
      v)))

#+(and lispworks bigarray)
(lw:defadvice (make-array make-bigarray :around)
    (dimensions &rest parameters &key (element-type t)
                initial-element initial-contents adjustable
                fill-pointer displaced-to displaced-index-offset
&allow-other-keys)
  (if (and (integerp dimensions)
           (> dimensions array-max-size)
           (null adjustable)
           (null fill-pointer)
           (null displaced-to)
           (null displaced-index-offset)
           (null initial-element)
           (null initial-contents))
    (allocate-vector dimensions element-type)
    (apply #'lw:call-next-advice dimensions parameters)))

#+(and lispworks bigarray)
(lw:defadvice (aref aref-bigarray :around)
    (array &rest subscripts)
  (cond ((arrayp array)
         (apply #'lw:call-next-advice array subscripts))
        (t
         (assert (= 1 (length subscripts)))
         (multiple-value-bind (slice index)
             (truncate (first subscripts) array-max-size)
           ;; Notice the recursive call to aref:
           (lw:call-next-advice
            (lw:call-next-advice (bigvector-slices array) slice) index)))))

#+(and lispworks bigarray)
(lw:defadvice ((setf aref) set-aref-bigarray :around)
    (new-value array &rest subscripts)
  (cond ((arrayp array)
         (apply #'lw:call-next-advice new-value array subscripts))
        (t
         (assert (= 1 (length subscripts)))
         (multiple-value-bind (slice index)
             (truncate (first subscripts) array-max-size)
           ;; Notice the recursive call to aref:
           (lw:call-next-advice new-value (aref (bigvector-slices
array) slice) index)))))

#+(and lispworks bigarray)
(lw:defadvice (elt elt-bigarray :around)
    (sequence index)
  (cond ((bigvector-p sequence) (aref sequence index))
        (t (lw:call-next-advice sequence index))))

;; #+(and lispworks bigarray)
;; (lw:defadvice ((setf elt) set-elt-bigarray :around)
;;     (new-value sequence index)
;;   (cond ((bigvector-p array) (setf (aref array index) new-value))
;;         (t (lw:call-next-advice new-value sequence index))))

#+(and lispworks bigarray)
(lw:defadvice (length length-bigarray :around)
    (sequence)
  (cond ((bigvector-p sequence)
         (bigvector-total-size sequence))
        (t (lw:call-next-advice sequence))))


With Best Regards,
jingtao.

On Fri, Apr 8, 2016 at 9:39 AM, Jingtao Xu <jingtaozf@gmail.com> wrote:
> Hi Pascal:
>
> That's what I want, thanks.
>
> By this wrapper, it will make large data analysis more easier.:)
>
> With Best Regards,
> jingtao.
>
>
> On Fri, Apr 8, 2016 at 6:42 AM, Pascal J. Bourguignon
> <pjb@informatimago.com> wrote:
>>
>> Jingtao Xu <jingtaozf@gmail.com> writes:
>>
>>> Hello all,
>>>
>>>
>>> Common lisp has a constant variable array-total-size-limit which limit
>>> the maximum size of an array,
>>> but in some situation I want to read a very large file(for example its
>>> size is 1G) to one string then parse it.
>>>
>>> So my question is that Is there one way to create a very large string
>>> which exceed the size specified by array-total-size-limit?
>>
>> You can do something like the following (of course, you will have to
>> implement like aref and length all the other functions of CL you would
>> want to apply on your big arrays (eg. map, map-into, subseq, etc).
>>
>>
>> (eval-when (:compile-toplevel :load-toplevel :execute)
>>   (pushnew :test *features*))
>>
>> (defpackage "BIGARRAY"
>>   (:use "COMMON-LISP")
>>   (:shadow "MAKE-ARRAY" "AREF" "LENGTH"
>>            #+test "ARRAY-TOTAL-SIZE-LIMIT")
>>   (:export "MAKE-ARRAY" "AREF" "LENGTH"
>>            #+test "ARRAY-TOTAL-SIZE-LIMIT"))
>>
>> (defpackage "CL-WITH-BIGARRAY"
>>   (:use "COMMON-LISP" "BIGARRAY")
>>   (:shadowing-import-from "BIGARRAY"
>>                           "MAKE-ARRAY" "AREF" "LENGTH"
>>                           #+test "ARRAY-TOTAL-SIZE-LIMIT")
>>   (:export . #.(let ((e '()))
>>                  (do-external-symbols (s "COMMON-LISP" e)
>>                    (push (symbol-name s) e)))))
>>
>> (in-package "BIGARRAY")
>>
>> #+test (defconstant ARRAY-TOTAL-SIZE-LIMIT 8)
>>
>> (defstruct bigvector
>>   total-size
>>   slice-size
>>   last-slice-size
>>   slices)
>>
>> (defun allocate-vector (size element-type #|fill-pointer etc|#)
>>   (multiple-value-bind (nslices last-slice-size)
>>       (truncate size array-total-size-limit)
>>     (if (plusp last-slice-size)
>>         (incf nslices)
>>         (setf last-slice-size array-total-size-limit))
>>     (let ((v (make-bigvector :total-size size
>>                              :slice-size array-total-size-limit
>>                              :last-slice-size last-slice-size
>>                              :slices (make-array nslices))))
>>       ;; (bigvector-slices v) could be a bigvector too!
>>       (dotimes (i nslices)
>>         (setf (aref (bigvector-slices v) i)
>>               (cl:make-array (if (= i (1- nslices))
>>                                  last-slice-size
>>                                  array-total-size-limit)
>>                              :element-type element-type
>>                              #|etc|#)))
>>       v)))
>>
>> (defmethod make-array ((size integer) &rest parameters &key (element-type t) &allow-other-keys)
>>   (if (< size array-total-size-limit)
>>       (apply (function cl:make-array) size parameters)
>>       (allocate-vector size element-type)))
>>
>> (defmethod make-array ((size list)  &rest parameters &key &allow-other-keys)
>>
>>   ;; For multi-dimensionnal arrays you have the opportunity to
>>   ;; optimize the mapping of the planes into slices.
>>
>>   ;; For example, by processing (reverse size) and taking dimensions
>>   ;; while their product is less than array-total-size-limit, we can
>>   ;; use a CL multi-dimensionnal array for a slice, and going on with
>>   ;; the remaining dimensions for the meta-slices and
>>   ;; meta-meta-slices, etc.  So the slices could be smaller than
>>   ;; array-total-size-limit, but that would allow us to process the
>>   ;; multidimension array efficiently.
>>
>>   (not-implemented-yet))
>>
>>
>> ;; Forward to CL classes:
>>
>> (defmethod aref ((a array) &rest indices)
>>   (apply (function cl:aref) a indices))
>>
>> (defmethod (setf aref) (new-value (a array) &rest indices)
>>   (setf (apply (function cl:aref) a indices) new-value))
>>
>> (defmethod length ((v sequence))
>>   (cl:length v))
>>
>> ;; New methods for our classes:
>>
>> (defmethod aref ((v bigvector) &rest indices)
>>   (assert (= 1 (length indices)))
>>   (multiple-value-bind (slice index) (truncate (first indices) array-total-size-limit)
>>     ;; Notice the recursive call to aref:
>>     (cl:aref (aref (bigvector-slices v) slice) index)))
>>
>> (defmethod (setf aref) (new-value (v bigvector) &rest indices)
>>   (assert (= 1 (length indices)))
>>   (multiple-value-bind (slice index) (truncate (first indices) array-total-size-limit)
>>     ;; Notice the recursive call to aref:
>>     (setf (cl:aref (aref (bigvector-slices v) slice) index) new-value)))
>>
>> (defmethod length ((v bigvector))
>>   (bigvector-total-size v))
>>
>>
>> (defpackage "MY-PROGRAM"
>>   (:use "CL-WITH-BIGARRAY"))
>> (in-package "MY-PROGRAM")
>>
>> (pprint (make-array (+ 4 (expt 8 3))))
>> ;; #S(bigvector :total-size 516 :slice-size 8 :last-slice-size 4
>> ;;              :slices #S(bigvector :total-size 65 :slice-size 8 :last-slice-size 1
>> ;;                                   :slices #S(bigvector :total-size 9 :slice-size 8 :last-slice-size 1
>> ;;                                                        :slices #(#(#(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
>> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
>> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
>> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
>> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
>> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
>> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0))
>> ;;                                                                    #(#(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)
>> ;;                                                                      #(0 0 0 0 0 0 0 0) #(0 0 0 0 0 0 0 0)))
>> ;;                                                                  #(#(#(0 0 0 0)))))))
>>
>> (let ((v (make-array (+ 4 (expt 8 3)))))
>>   (loop :for i :below (+ 4 (expt 8 3))
>>         :do (setf (aref v i) i))
>>   (loop :for i :below (+ 4 (expt 8 3))
>>         :by 10
>>         :do (prin1 (aref v i)) (princ " "))
>>   (terpri)
>>   (pprint v)
>>   (values))
>>
>> ;; 0 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 200 210 220 230 240 250 260 270 280 290 300 310 320 330 340 350 360 370 380 390 400 410 420 430 440 450 460 470 480 490 500 510
>> ;;
>> ;; #S(bigvector :total-size 516 :slice-size 8 :last-slice-size 4
>> ;;              :slices #S(bigvector :total-size 65 :slice-size 8 :last-slice-size 1
>> ;;                                   :slices #S(bigvector :total-size 9 :slice-size 8 :last-slice-size 1
>> ;;                                                        :slices #(#(#(#(0 1 2 3 4 5 6 7) #(8 9 10 11 12 13 14 15)
>> ;;                                                                      #(16 17 18 19 20 21 22 23)
>> ;;                                                                      #(24 25 26 27 28 29 30 31)
>> ;;                                                                      #(32 33 34 35 36 37 38 39)
>> ;;                                                                      #(40 41 42 43 44 45 46 47)
>> ;;                                                                      #(48 49 50 51 52 53 54 55)
>> ;;                                                                      #(56 57 58 59 60 61 62 63))
>> ;;                                                                    #(#(64 65 66 67 68 69 70 71)
>> ;;                                                                      #(72 73 74 75 76 77 78 79)
>> ;;                                                                      #(80 81 82 83 84 85 86 87)
>> ;;                                                                      #(88 89 90 91 92 93 94 95)
>> ;;                                                                      #(96 97 98 99 100 101 102 103)
>> ;;                                                                      #(104 105 106 107 108 109 110 111)
>> ;;                                                                      #(112 113 114 115 116 117 118 119)
>> ;;                                                                      #(120 121 122 123 124 125 126 127))
>> ;;                                                                    #(#(128 129 130 131 132 133 134 135)
>> ;;                                                                      #(136 137 138 139 140 141 142 143)
>> ;;                                                                      #(144 145 146 147 148 149 150 151)
>> ;;                                                                      #(152 153 154 155 156 157 158 159)
>> ;;                                                                      #(160 161 162 163 164 165 166 167)
>> ;;                                                                      #(168 169 170 171 172 173 174 175)
>> ;;                                                                      #(176 177 178 179 180 181 182 183)
>> ;;                                                                      #(184 185 186 187 188 189 190 191))
>> ;;                                                                    #(#(192 193 194 195 196 197 198 199)
>> ;;                                                                      #(200 201 202 203 204 205 206 207)
>> ;;                                                                      #(208 209 210 211 212 213 214 215)
>> ;;                                                                      #(216 217 218 219 220 221 222 223)
>> ;;                                                                      #(224 225 226 227 228 229 230 231)
>> ;;                                                                      #(232 233 234 235 236 237 238 239)
>> ;;                                                                      #(240 241 242 243 244 245 246 247)
>> ;;                                                                      #(248 249 250 251 252 253 254 255))
>> ;;                                                                    #(#(256 257 258 259 260 261 262 263)
>> ;;                                                                      #(264 265 266 267 268 269 270 271)
>> ;;                                                                      #(272 273 274 275 276 277 278 279)
>> ;;                                                                      #(280 281 282 283 284 285 286 287)
>> ;;                                                                      #(288 289 290 291 292 293 294 295)
>> ;;                                                                      #(296 297 298 299 300 301 302 303)
>> ;;                                                                      #(304 305 306 307 308 309 310 311)
>> ;;                                                                      #(312 313 314 315 316 317 318 319))
>> ;;                                                                    #(#(320 321 322 323 324 325 326 327)
>> ;;                                                                      #(328 329 330 331 332 333 334 335)
>> ;;                                                                      #(336 337 338 339 340 341 342 343)
>> ;;                                                                      #(344 345 346 347 348 349 350 351)
>> ;;                                                                      #(352 353 354 355 356 357 358 359)
>> ;;                                                                      #(360 361 362 363 364 365 366 367)
>> ;;                                                                      #(368 369 370 371 372 373 374 375)
>> ;;                                                                      #(376 377 378 379 380 381 382 383))
>> ;;                                                                    #(#(384 385 386 387 388 389 390 391)
>> ;;                                                                      #(392 393 394 395 396 397 398 399)
>> ;;                                                                      #(400 401 402 403 404 405 406 407)
>> ;;                                                                      #(408 409 410 411 412 413 414 415)
>> ;;                                                                      #(416 417 418 419 420 421 422 423)
>> ;;                                                                      #(424 425 426 427 428 429 430 431)
>> ;;                                                                      #(432 433 434 435 436 437 438 439)
>> ;;                                                                      #(440 441 442 443 444 445 446 447))
>> ;;                                                                    #(#(448 449 450 451 452 453 454 455)
>> ;;                                                                      #(456 457 458 459 460 461 462 463)
>> ;;                                                                      #(464 465 466 467 468 469 470 471)
>> ;;                                                                      #(472 473 474 475 476 477 478 479)
>> ;;                                                                      #(480 481 482 483 484 485 486 487)
>> ;;                                                                      #(488 489 490 491 492 493 494 495)
>> ;;                                                                      #(496 497 498 499 500 501 502 503)
>> ;;                                                                      #(504 505 506 507 508 509 510 511)))
>> ;;                                                                  #(#(#(512 513 514 515)))))))
>>
>> --
>> __Pascal Bourguignon__                 http://www.informatimago.com/
>> “The factory of the future will have only two employees, a man and a
>> dog. The man will be there to feed the dog. The dog will be there to
>> keep the man from touching the equipment.” -- Carl Bass CEO Autodesk
>>
>> _______________________________________________
>> Lisp Hug - the mailing list for LispWorks users
>> lisp-hug@lispworks.com
>> http://www.lispworks.com/support/lisp-hug.html
>>

_______________________________________________
Lisp Hug - the mailing list for LispWorks users
lisp-hug@lispworks.com
http://www.lispworks.com/support/lisp-hug.html


Updated at: 2020-12-10 08:32 UTC