Question about very big arrays

if i want to make a 2dimentional aray that maybe very
large it may get up to 1000 elements or even more and its size
may vary at runtime
question
1)what do i need to use[b] ?
2)does anyone have a example code they could post[b] ?
3)if their isnt a way to do a 2darray at runtime
how would i do i 1dimentional array that will vary in size at runtime[b] ?
my goal at this time (for example) is to make a 2dimentional array
called say RTarray [] []
during runtime it will increment the size of the array
from [1 to 1000] ,[2] then decrement it back down to 1
...(each of the array elements might be set to 1 or)
...(anything thats not really whats important )
thanks in advance lightwave

You can try using a variable to set the array at runtime,
one that varies depending on incoming data:
protected int DATA_FIELD = IncomingData.length();
protected int[][] array = new array[DATA_FIELD ][2];Don't know if that's what your looking for?

Similar Messages

Question about comparing an array of names to a hash table

I'm still learning Powershell but feel like I have the basics now. I have a new project I'm working on and want some input as the best way to do this:
The Problem:
Let's say you have a list of several hundred video game titles and the dollar value of each in a text or two column CSV file.
The example CSV file looks likes this:
Game, Price
Metroid, $15.00
The Legend of Zelda!, $12.00
Mike Tyson's Punch-Out!, $18.00
Super Mario Bros., $16.00
Kung Fu, $7.00
You have another list of just the video game titles, this most likely is just a text file with each title listed on its own line.
The example text file looks like this:
Kung Fu
Metroid
Mike Tysons Punch-Out
Legend of Zelda
What I think would happen in the Script:
Use import-csv and create a hash table that will contain a key = Title and the value = the price.
Use import-csv and create an array for the title names.
Foreach loop through each Game Title and match the value against the Hash Table, if there's a match found, put that into another array that will later add all prices of each item and give you a total sum.
The challenge:
So far when I try and do one line examples of comparing names against the hash table it seems to only work with exact name matches. In the above example I've purposely made the game titles slightly different because in the real world people just write things
differently.
With that said, I've tried using the following single line to match things up and it only seems to work if the values match exactly.
$hash_table.ContainsKey("Game Title")
Is there a regex I should use to change the input of the game titles before creating the hash table or doing the compare? Is there another matching operator that is better and matching with String values that have slightly different grammar. An example would
be the game "The Legend of Zelda". Sometimes people just put "Legend of Zelda", that's close but not exact. I think using a regex to remove extra spaces and symbols would work, but what about for matching of words or letters??
Any ideas would be very helpful and thanks!

There's no pat answer for this.
You can create an array from the hash table keys:
$hashtable = @{"The Legend of Zelda" = 15.00}
$titles = $hashtable.getenumerator() | select -ExpandProperty Name
And then test that using a wildcard match:
$titles -like "*Game Title*"
and see if it returns just one match. If it does then use that match to do your lookup in the hash table. If it returns 0, or more than one match then you need to check the spelling or qualify the title search some more.
[string](0..33|%{[char][int](46+("686552495351636652556262185355647068516270555358646562655775 0645570").substring(($_*2),2))})-replace " "

Question about problem using arrays...

Hey guys, thanks a bunch for the help - I always really appreciate how you guys can take the time to help us people still learning about this amazing language. Anyway the problem goes like this:
Given an int array, return a new array with double the length where its last element is the same as the original array, and all the other elements are 0. The original array will be length 1 or more. Note: by default, a new int array contains all 0's.
makeLast({4, 5, 6}) ?? {0, 0, 0, 0, 0, 6}
makeLast({1, 2}) ?? {0, 0, 0, 2}
makeLast({3}) ?? {0, 3}//this is basically what it's supposed to do
public int[] makeLast (int[] nums)
So I'm just wonder on how the implementation would be like. I know that I would first want to double the array length. After that, I would want to replace every element of the original array with 0's but keep the last element the same. Any suggestions guys?

So I'm just wonder on how the implementation would be like. I know that I would first want to double the array length.Well, you can't double the length per se. You can't dynamically change the size of an array. Rather, you'll need to create a new array with the size as specified by the homework assignment.
After that, I would want to replace every element of the original array with 0's but keep the last element the same.Since it's a new array, you wouldn't actually replace anything.
Any suggestions guys?Hint: the default value, in an array of numbers, is zero.

Another question about problem using arrays

Hey guys, if you helped me answer my other problems thanks a bunch and again thank you to all the people who try to help us learn the unique language of Java. Anyway the other problem goes like this:
Return the number of even ints in the given array. Note: the % "mod" operator computes the remainder, e.g. 5 % 2 is 1.
countEvens({2, 1, 2, 3, 4}) ?? 3
countEvens({2, 2, 2}) ?? 3
countEvens({1, 3, 5}) ?? 0
Ok so basically I would want to count all the evens in an array and basically if I use the module operator I can figure out whether something is even or not if it returns me a 0. So I know there will be an if statement there. I'm wondering if I would have to also use a "for each" statement to check every element. I would also need a variable to keep count of the number of elements that are even. Any suggestions on how the implementation of this method should be like?

Hey thanks a bunch actually, I just pretty much reasoned it out and ended up with this:
public int countEvens(int[] nums) {
int count = 0;
for (int e:nums)
     if ((e%2)==0)
        count++;
   return count;
}Really appreciate the help.

Question about reading a very big file into a buffer.

Hi, everyone!
I want to randomly load several characters from
GB2312 charset to form a string.
I have two questions:
1. Where can I find the charset table file? I have used
google for hours to search but failed to find GB2312 charset
file out.
2. I think the charset table file is very big and I doubted
whether I can loaded it into a String or StringBuffer? Anyone
have some solutions? How to load a very big file and randomly
select several characters from it?
Have I made myself understood?
Thanks in advance,
George

The following can give the correspondence between GB2312 encoded byte arrays and characters (in hexadecimal integer expression).
import java.nio.charset.*;
import java.io.*;
public class GBs{
static String convert() throws java.io.UnsupportedEncodingException{
StringBuffer buffer = new StringBuffer();
String l_separator = System.getProperty("line.separator");
Charset chset = Charset.forName("EUC_CN");// GB2312 is an alias of this encoding
CharsetEncoder encoder = chset.newEncoder();
int[] indices = new int[Character.MAX_VALUE+1];
for(int j=0;j<indices.length;j++){
       indices[j]=0;
for(int j=0;j<=Character.MAX_VALUE;j++){
    if(encoder.canEncode((char)j)) indices[j]=1;
byte[] encoded;
String data;
for(int j=0;j<indices.length;j++) {
     if(indices[j]==1) {
            encoded =(Character.toString((char)j)).getBytes("EUC_CN");
                      for(int q=0;q<encoded.length;q++){
                      buffer.append(Byte.toString(encoded[q]));
                      buffer.append(" ");
            buffer.append(": 0x");buffer.append(Integer.toHexString(j));
            buffer.append(l_separator);
    return buffer.toString();
//the following is for testing
/*public static void main(String[] args) throws java.lang.Exception{
   String str = GBs.convert();
   System.out.println(str);*/

Question about C array initialization

I understand that the statement
char string[] = "chars";
initializes string[5] to 0 ('\000'). My question is does the statement
char *strings[] = { "string1", "string2", "string3" };
initialize strings[3] to (void *) 0, i.e. NULL? I can't find the answer to this question in the ansi standard. GCC seems to tack on a NULL pointer at the end (even with the -ansi and -pedantic-errors flags), which is really convenient for finding the boundary, but I'm not sure whether it's a GCC thing or an official C thing. I see where the standard talks about terminating char arrays initialized by a string literal with a null byte, but it doesn't talk about the analogous case with arrays of pointers.
Last edited by nbtrap (2012-06-25 03:18:20)

nbtrap wrote:
Not necessarily. A declaration like:
char arr[3] = "str";
doesn't get null-terminated.
It doesn't get null-terminated because you don't leave enough room in the array for the null character. "char arr[3]" can only contain 3 characters, the same way that "char arr[2] = "str" will only contain 2. The second example generates a warning whereas the first does not, but only because it is very common to work with non-null-terminated strings.
nbtrap wrote:
And besides, my point is that initializing strings[3] *would* make sense for the same reason that intializing
char foo[] = "bar";
with a terminating null byte *does* make sense.
I know that arrays of pointers are not the same. My questions assumes that much. The fact of the matter is, however, GCC terminates pointer arrays of unknown size with a null pointer, and my question is simply "is this an ansi C thing or a GCC thing?".
In fact, it seems that GCC terminates all arrays of unknown size that are explicitly initialized with the appropriate number of null bytes. For example:
struct tag { int i; char c; char *str; } tags[] = {
{ 1, 'a', "string1" },
{ 2, 'b', "string2" },
{ 3, 'c', "string3" }
initializes tags[3] to sizeof (struct tag) null bytes. Try it for yourself.
I get the following:
test.c
#include <stdio.h>
int
main(int argc, char * * argv)
int i;
char *strings[] = { "string1", NULL, "string3"};
for (i=0;i<5;i++)
printf("strings[%d]: %s\n", i, strings[i]);
return 0;
output
strings[0]: string1
strings[1]: (null)
strings[2]: string3
Segmentation fault
test2.c
#include <stdio.h>
#include <string.h>
int
main(int argc, char * * argv)
int i;
struct tag {int i; char c; char *str;};
struct tag null;
memset(&null, 0, sizeof(struct tag));
struct tag tags[] =
{ 1, 'a', "string1" },
// { 2, 'b', "string2" },
null,
{ 3, 'c', "string3" }
for (i=0;i<5;i++)
printf(
"tags[%d]: (%p) %1d %c %s\n",
i, tags + i, tags[i].i, tags[i].c, tags[i].str
return 0;
output
tags[0]: (0x7fffd2df4e80) 1 a string1
tags[1]: (0x7fffd2df4e90) 0 (null)
tags[2]: (0x7fffd2df4ea0) 3 c string3
tags[3]: (0x7fffd2df4eb0) 0 (null)
Segmentation fault
The above behavior appears to conflict.
Given that string constants in C are defined as null-terminated, i.e. "str" is equivalent to "{'s', 't', 'r', '\0'}", the assignment 'arr[] = "str"' explicitly includes a null terminator. The other examples above do not include such a terminator. Even if it would be convenient sometimes, the standard should adopt a minimally invasive approach. It's easy to add a NULL at the end of an array declaration, but impossible to remove an extra element from such a declaration.
This may be informative too:
test3.c
#include <stdio.h>
#include <string.h>
int
main(int argc, char * * argv)
char str[] = "test";
char *strings[] = {"string1", NULL, "string3"};
struct tag {int i; char c; char *str;};
struct tag null;
memset(&null, 0, sizeof(struct tag));
struct tag tags[] =
{ 1, 'a', "string1" },
// { 2, 'b', "string2" },
null,
{ 3, 'c', "string3" }
printf(
"str\n size: %lu\n length: %lu\n"
"strings\n size: %lu\n length: %lu\n"
"tags\n size: %lu\n length: %lu\n",
sizeof(str), sizeof(str)/sizeof(char),
sizeof(strings), sizeof(strings)/sizeof(char *),
sizeof(tags), sizeof(tags)/sizeof(struct tag)
return 0;
output
str
size: 5
length: 5
strings
size: 24
length: 3
tags
size: 48
length: 3
The string length (actual number of chars in array) is reported as 5 ('t', 'e', 's', 't', '\0'), which is expected. The array of strings and tags are both reported as 3, even though you can access a null value after the last initialized index of the tags array. If that null value was really supposed to be there, it should be accounted for using sizeof, just as the null character is in the string.
Maybe the ultimate null element of the tags array is some artefact of memory alignment.

Here's a very basic question about 2 TB external drives and Time Machine.

Here's a very basic question about 2 TB external drives and Time Machine.
Ihave a Mac Pro with a .75 TB and 1 TB drive. It also has a 1 TB 2ndinternal drive. My current external drive is too small so I'll begetting a 1.5 TB or 2 TB drive.
Obviouslythe new larger 2 TB drive will backup everything on the Mac Prointernal drive with Time Machine. But there will be 1 TB of space leftover going to waste.
ShouldI partition the external drive so that the TM portion will be 1 TB andthe use the remaining extra partition for additional file backups withCarbon Copy?
Thanks for any insights.
I tried searching around on the new Apple discussion forum, but I find it much harder to use than the old forum I used to use.

The problem with terabyte drives is that that a 3 TB is about as big as you can get without going into RAID territory. Ideally, a Time Machine drive should be 3 times as large as all the drives you are backing up. So, if you have 2.75 TB of internal storage, you should have 8 TB of Time Machine space.
Of course, that is "should". If your TB drives are mostly empty, then you can get away with something 3 times the size of your used disk space. Just remember that you are pushing it. Linc is right about Time Machine needing space to work.
It is unlikely that you have regular churn on 2.75 TB of disk. I suggest identifying which drives and folders have the most activity and excluding those drives and directories that don't change much. It would be better to archive the data that doesn't change often and keep it out of Time Machine. Then you may be able to get away with a 2 TB Time Machine drive.

Very big problem with JSF about FORM and "id=" for HTML form's elements and

I have discovered a very big problem with JSF about FORM and "id=" for HTML form's elements and java instruction "request.getParameterNames()".
Suppose you have something like this, to render some datas form a Java Beans :
<h:dataTable value="#{TablesDb2Bean.myDataDb2ListSelection}" var="current" border="2" width="50%" cellpadding="2" cellspacing="2" style="text-align: center">
<h:column>
<f:facet name="header">
<h:outputText value="Name"/>
</f:facet>
<h:outputText id="nameTableDb2" value="#{current.db2_name_table}"/>
</h:column>
</h:dataTable>
Everything works fine...
Suppose you want to get the name/value pairs for id="nameTableDb2" and #{current.db2_name_table} to process them in a servlet. Here is the HTML generated :
<td><span <span class="attribute-name">id=<span class="attribute-value">"j_id_jsp_1715189495_22:0:nameTableDb2">my-table-db2-xxxxx</span></td>
You think you can use the java instructions :
Enumeration NamesParam = request.getParameterNames();
while (NomsParam.hasMoreElements()) {
String NameParam = (String) NamesParam.nextElement();
out.println("<h4>"++NameParam+ "+</h4>);
YOU ARE WRONG : request.getParameterNames() wants the syntax *name="nameTableDb2" but JSF must use id="nameTableDb2" for "<h:outputText"... So, you can't process datas in a FORM generated with JSF in a Servlet ! Perhaps I have made an error, but really, I wonder which ?
Edited by: ungars on Jul 18, 2010 12:43 AM
Edited by: ungars on Jul 18, 2010 12:45 AM

While I certainly appreciate ejb's helpful responses, this thread shows up a difference in perspective between how I read the forum and how others do. Author ejb is correct in advising you to stay inside JSF for form processing if form processing is what you want to do.
However, I detect another aspect to this post which reminds me of something Marc Andreesen once said when he was trying to get Netscape off the ground: "there's no such thing as bad HTML."
In this case, I interpret ungar's request as a new feature request. Can I phrase it like this?
"Wouldn't it be nice if I could render my nice form with JSF but, in certain cases, when I REALLY know what I'm doing" just post out to a separate servlet? I know that in this case I'll be missing out on all the nice validation, conversion, l10n, i18n, ajax, portlet and other features provided by JSF".
If this is the case, because it really misses the point of JSF, we don't allow it, but we do have an issue filed for it
https://javaserverfaces-spec-public.dev.java.net/issues/show_bug.cgi?id=127
If you can't wait for it to be fixed, you could decorate the FormRenderer to fix what you want.
I have an example in my JSF book that shows how to do this decoration. http://bit.ly/edburnsjsf2
Ed

One very basic question about inheritance

One very basic question about inheritance.
Why we need inheritance?
the benefit of inheritance also achieve by creating instance of base class using it in other class instead of extending the base class.
Can any one please explain why we are using inheritance instead of creating object of base class????

SumitThokal wrote:
One very basic question about inheritance.
Why we need inheritance?
the benefit of inheritance also achieve by creating instance of base class using it in other class instead of extending the base class.
Can any one please explain why we are using inheritance instead of creating object of base class????What did you find out when you looked on Google?
One example of inheritance comes in the form of a vehicle. Each vehicle has similarities however they differ in their own retrospect. A car is not a bus, a bus is not a truck, and a truck is not a motorbike. If you can define the similarities between these vehicles then you have a class in which you can extend into either of the previous mentioned vehicles. Resulting in a reusable class, dramatically reduces the size of code, creates a single point of definition, increases maintainability, you name it.
In short there are thousands of benefits from using inheritance, listing the benefits could take a while. A quick Google search should give you a few hundred k if not million links to read.
Mel

A very simple question about WF

hi experts
I would like to ask a question about workflow
as u may know there is 'Loop' step in workflow, but I am confused when should I use Loop?
Is this step used for processing internal table? if yes, why shouldn't I create a custom BOR method and pass the entire internal table to the method?
many thanks

hi
loop step for not process the internal table,
this is used to process the some steps repetely until condition True or False.
we have two loop steps is there
WHILE AND UNTIL.
Thanks
sitaram

Some questions about importing HTML files

Hi, folks
Let's suppose we want to import a pack of HTML files formatted in HTML5 wit's it's CSS into a double-oriented folio. A couple or three questions about that, please:
1. Is there a limit for a reasonable quantity of HTML files I can import into a folio? I mean.. 100 would be way too much, for instance?
2. These HTML files could be navigated and referenced from inside TOC-pages made in InDesign,right? (navto://..., I gues?)
2. Will it be possible, by means of HTML adaptative design techniques, to treat both orientations (vertical and horizontal) as different viewports or screen sizes so that the design adapts for instance the column width with its CSS?
3. That said, will the InDesign final app. respect that adaptative CSS rules?
I am asking this because we are looking for a way to inject big quantities of content with a very similar design into our application in a really fast and automatizable way and I have the suspicion* that importing HTML5 preformated CSS files could be the a very good and simple alternative to importing XML into InDesign templates as we start out content as tagged almost-html files.
Thanks a lot
Gustavo Sánchez (Posting from Madrid)

I assume you are asking about using HTML articles.
1. There is no limit beyond simply keeping things reasonable.
2. Yes. Just use navto://articlename
3. Yes. I've used min-width of 768 and max width of 1024 to control it.
4. InDesign does not enter into any of this with the exception of using the folio builder panel. Everything else is done in Dreamweaver or whatever program you decide to use for the article.
If you want to restrict the HTML articles to one orientation or the other, use the _h and _v suffixes.
Bob

Need help optimizing the writing of a very large array and streaming it a file

Hi,
I have a very large array that I need to create and later write to a TDMS file. The array has 45 million entries, or 4.5x10^7 data points. These data points are of double format. The array is created by using a square pulse waveform generator and user-defined specifications of the delay, wait time, voltages, etc.
I'm not sure how to optimize the code so it doesn't take forever. It currently takes at least 40 minutes, and I'm still running it, to create and write this array. I know there needs to be a better way, as the array is large and consumes a lot of memory but it's not absurdly large. The computer I'm running this on is running Windows Vista 32-bit, and has 4GB RAM and an Intel Core 2 CPU @ 1.8Mhz.
I've read the "Managing Large Data Sets in LabVIEW" article (http://zone.ni.com/devzone/cda/tut/p/id/3625), but I'm unsure how to apply the principles here. I believe the problem lies in making too many copies of the array, as creating and writing 1x10^6 values takes < 10 seconds, but writing 4x10^6 values, which should theoretically take < 40 seconds, takes minutes.
Is there a way to work with a reference of an array instead of a copy of an array?
Attached is my current VI, Generate_Square_Pulse_With_TDMS_Stream.VI and it's two dependencies, although I doubt they are bottlenecking the program.
Any advice will be very much appreciated.
Thanks
Attachments:
Generate_Square_Pulse_With_TDMS_Stream.vi ‏13 KB
Square_Pulse.vi ‏13 KB
Write_TDMS_File.vi ‏27 KB

Thanks Ravens Fan, using replace array subset and initializing the array beforehand sped up the process immensely. I can now generate an array of 45,000,000 doubles in about one second.
However, when I try to write all of that out to TDMS at the end LV runs out of memory and crashes. Is it possible to write out the data in blocks and make sure memory is freed up before writing out the next block? I can use a simple loop to write out the blocks, but I'm unsure how to verify that memory has been cleared before proceeding. Furthermore, is there a way to ensure that memory and all resources are freed up at the end of the waveform generation VI?
Attached is my new VI, and a refined TDMS write VI (I just disabled the file viewer at the end). Sorry that it's a tad bit messy at the moment, but most of that mess comes from doing some arithmetic to determine which indices to replace array subsets with. I currently have the TDMS write disabled.
Just to clarify the above, I understand how to write out the data in blocks; my question is: how do I ensure that memory is freed up between subsequent writes, and how do I ensure that memory is freed up after execution of the VI?
@Jeff: I'm generating the waveform here, not reading it. I guess I'm not generating a "waveform" but rather a set of doubles. However, converting that into an actual waveform can come later.
Thanks for the replies!
Attachments:
Generate_Square_Pulse_With_TDMS_Stream.vi ‏14 KB
Write_TDMS_File.vi ‏27 KB

Question about Tritton AX 720 Dolby Digital Surround Gaming Headset

Hello, I have a question about the AX 720 that I hope someone can answer. I emailed Tritton and I'm not sure they understood what I was asking, so Ill try here. Ok, my question is this, Will I get audio through the headset if my set up is this: My X-BOX 360, my PS3 , and my Direct TV box are all hooked up to my TV via HDMI. My TV has an optical audio output, so if I hook up the AX 720's amp to my TV with the optical cable will I get the audio that is coming from that output into my headset? I'm using the Tritton AX 180's now hooked up almost exactly the same, except instead of the optical out, I'm using the red and white out that is right next to the optical out, and it works perfect. I get full audio from all 3, and the only time I have to change any cables is when I want to chat, but thats rare. I'm looking to upgrade to the 720 because I'm on my 3rd set of broken AX 180's. Ive read several reviews about the 720's and a few of them said that if your TV has an optical output that you can use that, and I hope its true. I hope this question makes sense, and thanks in advance for the help.

@Rockadile: You are totally right about the AX 180's breaking, like I said Im on my 3rd set. Thankfully for the first break it was within the return period, then I made sure to buy the warranty when I got the second. Now that the 3rd has broken in the same exact place Im done with these. The problem is my heads big (wide), and because of this theres extra pressure on the plastic piece that connects to the ear piece. I had to make a custom metal bracket to fix it. What I did was take 2 pieces of flat metal and bent them into the shape and angle of the plastic that attaches the earpiece, then I electrical taped them VERY tight. So basically instead of the plastic getting the stress, the metal does. And it worked great up until now, its breaking just below the adjustable part where the plastic goes into top of the headset. I looked at the AX 720's and it seems like there alot wider and stronger in that area. But if I do get them I will be sure to buy the replacement warranty. Sucks having a big head!

Very Big Table (36 Indexes, 1000000 Records)

Hi
I have a very big table (76 columns, 1000000 records), these 76 columns include 36 foreign key columns , each FK has an index on the table, and only one of these FK columns has a value at the same time while all other FK have NULL value. All these FK columns are of type NUMBER(20,0).
I am facing performance problem which I want to resolve taking in consideration that this table is used with DML (Insert,Update,Delete) along with Query (Select) operations, all these operations and queries are done daily. I want to improve this table performance , and I am facing these scenarios:
1- Replace all these 36 FK columns with 2 columns (ID, TABLE_NAME) (ID for master table ID value, and TABLE_NAME for master table name) and create only one index on these 2 columns.
2- partition the table using its YEAR column, keep all FK columns but drop all indexes on these columns.
3- partition the table using its YEAR column, and drop all FK columns, create (ID,TABLE_NAME) columns, and create index on (TABLE_NAME,YEAR) columns.
Which way has more efficiency?
Do I have to take "master-detail" relations in mind when building Forms on this table?
Are there any other suggestions?
I am using Oracle 8.1.7 database.
Please Help.

Hi everybody
I would like to thank you for your cooperation and I will try to answer your questions, but please note that I am a developer in the first place and I am new to oracle database administration, so please forgive me if I did any mistakes.
Q: Have you gathered statistics on the tables in your database?
A: No I did not. And if I must do it, must I do it for all database tables or only for this big table?
Q:Actually tracing the session with 10046 level 8 will give some clear idea on where your query is waiting.
A: Actually I do not know what you mean by "10046 level 8".
Q: what OS and what kind of server (hardware) are you using
A: I am using Windows2000 Server operating system, my server has 2 Intel XEON 500MHz + 2.5GB RAM + 4 * 36GB Hard Disks(on RAID 5 controller).
Q: how many concurrent user do you have an how many transactions per hour
A: I have 40 concurrent users, and an average 100 transaction per hour, but the peak can goes to 1000 transaction per hour.
Q: How fast should your queries be executed
A: I want the queries be executed in about 10 to 15 seconds, or else every body here will complain. Please note that because of this table is highly used, there is a very good chance to 2 or more transaction to exist at the same time, one of them perform query, and the other perform DML operation. Some of these queries are used in reports, and it can be long query(ex. retrieve the summary of 50000 records).
Q:please show use the explain plan of these queries
A: If I understand your question, you ask me to show you the explain plan of those queries, well, first, I do not know how , an second, I think it is a big question because I can not collect all kind of queries that have been written on this table (some of them exist in server packages, and the others performed by Forms or Reports).

2 question about GPU and Lens correction ,cs5

Hi
i have 2 questions about Gpu and lens correction in Cs5
1)Filter->lens correction->search online
i get often and almost every connection time out at the first click on search online , at the second click i get no online profile
is it normal?
2) question is about Gpu
it run faster , but talking about ajustament layer
like saturation or vibrance for example
i found with the gpu on , a light slow refresh compared with gpu off
i have set cache levels 6 ,history 20
i guess are the defaul
well i add a saturation layer and move the saturation slide ,increase o decrease saturation
with Gpu Off , the changes are immedially , i mean i can see in real time the increase o decrease of saturation
with Gpu On it takes a few(very few) time more
again is normal ?
don't be angry , i'm going to buy cs5 and i'm unsecure ... the price make a big role
thanks

For what it's worth, I also see a timeout on the first [ Search Online ] click, after about half a minute delay. Second click turns up results immediately. This happens each time Lens Correction is started, even without restarting Photoshop, and in both 32 and 64 bit versions. Also note that I started with one profile listed by default (though from the wrong camera) for my 40D with 28-135 zoom.
I alsow noticed that I was seeing progress bar activity in the Lens Correction dialog while I was typing this (even though Lens Correction was NOT the active window) every time I hit the 'L' key. Strange.
Windows 7 x64.
-Noel

Question about very big arrays

Similar Messages

Maybe you are looking for