Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 3276602
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 17, 20262026-05-17T19:16:35+00:00 2026-05-17T19:16:35+00:00

I am using this bit of code in order to reformat some large ajax

  • 0

I am using this bit of code in order to reformat some large ajax responseText into good binary data. It works, albeit slow.

The data that I am working with can be as large as 8-10 megs.

I need to get this code to be absolutely efficient. How would loop unrolling or Duff’s device be applied to this code while still keeping my binary data intact, or does anyone see anything that can be changed that would help increase it’s speed?

    var ff = [];
var mx = text.length;   
var scc= String.fromCharCode;
for (var z = 0; z < mx; z++) {
    ff[z] = scc(text.charCodeAt(z) & 255);
}
var b = ff.join("");
this.fp=b;
return b;

Thanks
Pat

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-17T19:16:35+00:00Added an answer on May 17, 2026 at 7:16 pm

    Your time hog isn’t the loop. It’s this: ff[z] = scc(text.charCodeAt(z) & 255); Are you incrementally growing ff? That will be a pig, guaranteed.

    If you just run it under the debugger and pause it, I bet you will see it in the process of growing ff. Pre-allocate.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have this bit of code: using System; using System.Collections.Generic; using System.ComponentModel; using System.Data;
I am using this bit of code successfully: $(window).bind('resize',function() { window.location.href = window.location.href; });
I have a costume class called Region and I am using this bit of
Currently I'm using this minor bit of javascript to remove a small list of
I'm a bit stuck on this - I am using a Wordpress shortcode with
This is my first time using an external library, and I'm a bit nervous
I am using ubuntu 12.04 on 64 bit machine, I have this simple C
I've been trying to figure this one out for a bit using patterns or
Looking to do a bit of refactoring... Using NHibernate I have this query currently
Using the code below in order to get names of my drives: const DWORD

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.