PostId int64 13 11.8M | PostCreationDate stringlengths 19 19 | OwnerUserId int64 3 1.57M | OwnerCreationDate stringlengths 10 19 | ReputationAtPostCreation int64 -33 210k | OwnerUndeletedAnswerCountAtPostTime int64 0 5.77k | Title stringlengths 10 250 | BodyMarkdown stringlengths 12 30k | Tag1 stringlengths 1 25 ⌀ | Tag2 stringlengths 1 25 ⌀ | Tag3 stringlengths 1 25 ⌀ | Tag4 stringlengths 1 25 ⌀ | Tag5 stringlengths 1 25 ⌀ | PostClosedDate stringlengths 19 19 ⌀ | OpenStatus stringclasses 5 values | unified_texts stringlengths 47 30.1k | OpenStatus_id int64 0 4 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2,119,699 | 01/22/2010 19:00:24 | 27,457 | 10/13/2008 15:01:44 | 1,458 | 67 | How can I get the href attribute value out of an `<?xml-stylesheet>` node? | We are getting an XML document from a vendor that we need to perform an XSL transform on using their stylesheet so that we can convert the resulting HTML to a PDF. The actual stylesheet is referenced in an `href` attribute of the `?xml-stylesheet` definition in the XML document. Is there any way that I can get that URL out? I don't trust the vendor not to change the URL and obviously don't want to hardcode it. | xml | xslt | c# | null | null | null | open | How can I get the href attribute value out of an `<?xml-stylesheet>` node?
===
We are getting an XML document from a vendor that we need to perform an XSL transform on using their stylesheet so that we can convert the resulting HTML to a PDF. The actual stylesheet is referenced in an `href` attribute of the `?xml-stylesheet` definition in the XML document. Is there any way that I can get that URL out? I don't trust the vendor not to change the URL and obviously don't want to hardcode it. | 0 |
2,587,509 | 04/06/2010 19:02:45 | 310,306 | 04/06/2010 18:46:16 | 1 | 0 | Event OnLoad on Telerik's grid (client selection) | I'm using Grid with "Client Selection" (http://demos.telerik.com/aspnet-mvc-beta/grid/selectionclientside) of Telerik, and my page loads with one of the lines already marked. I wonder how it could activate the event OnRowSelected (on the marked line) when the page loads.
Thanks everyone! | telerik | null | null | null | null | null | open | Event OnLoad on Telerik's grid (client selection)
===
I'm using Grid with "Client Selection" (http://demos.telerik.com/aspnet-mvc-beta/grid/selectionclientside) of Telerik, and my page loads with one of the lines already marked. I wonder how it could activate the event OnRowSelected (on the marked line) when the page loads.
Thanks everyone! | 0 |
10,560,063 | 05/12/2012 00:23:57 | 1,390,486 | 05/12/2012 00:16:27 | 1 | 0 | new to php - need help creating/loading simple table | I'm new to php, but have done some programming with html and javascript. I'm at the point of needing to dynamically change and load data in a table, so I'm forced to learn php.
Basically here's what I'm wanting to do:
1) Have a very simple form page that lets the user enter an ID number and one or several pre-defined keywords to be used as tags. This information should be saved in a file that can be later referenced.
2) Have a second page that has a list of the available keywords as clickable links, and upon selecting one will load the ID's associated with that keyword and display them.
What's the easiest way to accomplish this?
Thanks! | php | table | tags | load | save | 05/14/2012 13:50:40 | not a real question | new to php - need help creating/loading simple table
===
I'm new to php, but have done some programming with html and javascript. I'm at the point of needing to dynamically change and load data in a table, so I'm forced to learn php.
Basically here's what I'm wanting to do:
1) Have a very simple form page that lets the user enter an ID number and one or several pre-defined keywords to be used as tags. This information should be saved in a file that can be later referenced.
2) Have a second page that has a list of the available keywords as clickable links, and upon selecting one will load the ID's associated with that keyword and display them.
What's the easiest way to accomplish this?
Thanks! | 1 |
10,931,316 | 06/07/2012 11:57:30 | 946,226 | 09/15/2011 07:28:14 | 177 | 8 | “Real” programs written in Agda | Agda is a nice programming language to explore dependent types and play around with intuitionistic type theory and to experiment with the implementation of these things. But are there already examples for “real” programs written in Agda? Maybe even examples that show off its features (similar to how xmonad is often mentioned as an example of a “real” Haskell program)?
(Bonus points for answers in time before my [Agda talk](https://entropia.de/GPN12:Agda_-_Mit_starken_Typen_abh%C3%A4ngen) tonight, 22:00 CEST. :-)) | agda | null | null | null | null | 07/31/2012 12:17:28 | not constructive | “Real” programs written in Agda
===
Agda is a nice programming language to explore dependent types and play around with intuitionistic type theory and to experiment with the implementation of these things. But are there already examples for “real” programs written in Agda? Maybe even examples that show off its features (similar to how xmonad is often mentioned as an example of a “real” Haskell program)?
(Bonus points for answers in time before my [Agda talk](https://entropia.de/GPN12:Agda_-_Mit_starken_Typen_abh%C3%A4ngen) tonight, 22:00 CEST. :-)) | 4 |
2,669,626 | 04/19/2010 17:48:44 | 320,619 | 04/19/2010 17:48:44 | 1 | 0 | Determining smallest number of samples for 99% accuracy | I'm trying to compare 100,000 records on a local database (L) with 100,000 records on a remote database (R).
Basically I want to know if an elment in L exusts in R. To determine that, I have to make a request against the R for each L, which takes a long time (I know, there should be a better way, there isn't, that's the API I've got).
So I would like to test a small sample of L against R, and then infer with some level of confidence how many are present in the whole R. How many do I have to test to have a 99% confidence level? | statistics | null | null | null | null | null | open | Determining smallest number of samples for 99% accuracy
===
I'm trying to compare 100,000 records on a local database (L) with 100,000 records on a remote database (R).
Basically I want to know if an elment in L exusts in R. To determine that, I have to make a request against the R for each L, which takes a long time (I know, there should be a better way, there isn't, that's the API I've got).
So I would like to test a small sample of L against R, and then infer with some level of confidence how many are present in the whole R. How many do I have to test to have a 99% confidence level? | 0 |
9,554,807 | 03/04/2012 12:20:55 | 1,166,635 | 01/24/2012 09:11:37 | 82 | 0 | How to use criterias for "many-to-many" relation? | Good afternoon. Learn Hibernate, it became necessary to write the following query using the criteria. There are two entities - a fruit shop and the type of communication - many to many. Accordingly, we have literally three tables (and the corresponding classes of Java): Fruit (id, name), Shop (id, name) and ShopFruit (shop_id, fruit_id). So, as with the criterion to obtain a list of stores selling, say, a tangerine? Thanks in advance. | java | hibernate | null | null | null | null | open | How to use criterias for "many-to-many" relation?
===
Good afternoon. Learn Hibernate, it became necessary to write the following query using the criteria. There are two entities - a fruit shop and the type of communication - many to many. Accordingly, we have literally three tables (and the corresponding classes of Java): Fruit (id, name), Shop (id, name) and ShopFruit (shop_id, fruit_id). So, as with the criterion to obtain a list of stores selling, say, a tangerine? Thanks in advance. | 0 |
10,805,371 | 05/29/2012 19:23:52 | 840,546 | 07/12/2011 11:00:59 | 114 | 1 | How to create an installable toolkit with codes from python and perl? | Am creating a toolkit for my new anomaly analysis framework. Am writing a few scripts for data collection in perl and some analysis tools in python(uses numpy, scipy and matplotlib). There are a few perl dependencies (perl packages) and python libraries.
I need to create package so that it can install packages like numpy,scipy etc (whihc in turn needs atlas, etc)
How can I achieve my toolkit to take care of dependencies in a system ?
I dont have any experience to toolkit creations. | installation | dependencies | toolkit | null | null | null | open | How to create an installable toolkit with codes from python and perl?
===
Am creating a toolkit for my new anomaly analysis framework. Am writing a few scripts for data collection in perl and some analysis tools in python(uses numpy, scipy and matplotlib). There are a few perl dependencies (perl packages) and python libraries.
I need to create package so that it can install packages like numpy,scipy etc (whihc in turn needs atlas, etc)
How can I achieve my toolkit to take care of dependencies in a system ?
I dont have any experience to toolkit creations. | 0 |
9,553,877 | 03/04/2012 09:48:19 | 938,221 | 09/10/2011 13:38:04 | 163 | 4 | Good Image reader on linux | I am looking for a good image program on linux which can show me the RGBA value of the pixel under my mouse cursor i.e. as I move my mouse it should show me the current pixel location and its RGBA value.
I have tried several packages, including GIMP but none of them provides it. It is okay if they don't provide any image manipulation as long as they are able to read common file formats like TGA/BMP/JPG/PNG. I can of-course write my own easily, but I dont want to spend time on it. I guess someone might have done it already in the universe, its just I am not able to find out.
Any suggestions are very much appreciated. Thanks in advance. | linux | image | image-processing | null | null | 03/04/2012 09:58:15 | off topic | Good Image reader on linux
===
I am looking for a good image program on linux which can show me the RGBA value of the pixel under my mouse cursor i.e. as I move my mouse it should show me the current pixel location and its RGBA value.
I have tried several packages, including GIMP but none of them provides it. It is okay if they don't provide any image manipulation as long as they are able to read common file formats like TGA/BMP/JPG/PNG. I can of-course write my own easily, but I dont want to spend time on it. I guess someone might have done it already in the universe, its just I am not able to find out.
Any suggestions are very much appreciated. Thanks in advance. | 2 |
10,752,178 | 05/25/2012 09:48:51 | 964,494 | 09/26/2011 06:26:09 | 69 | 4 | Memory Usage In ADO Recordset | How to reduce memory usage of ADO Record set? for one record set it takes 128k until it release memory.. | c++ | visual-c++ | ado | recordset | null | 05/26/2012 00:16:06 | not a real question | Memory Usage In ADO Recordset
===
How to reduce memory usage of ADO Record set? for one record set it takes 128k until it release memory.. | 1 |
1,915,316 | 12/16/2009 15:22:22 | 233,050 | 12/16/2009 15:22:22 | 1 | 0 | MDX WHERE NOT IN() equivalent in many-to-many dimension | I have a many-to-many dimension in my cube (next to other regular dimensions). When I want to exclude fact rows in my row count measure, I usually do something like the following in MDX
SELECT [Measures].[Row Count] on 0
FROM cube
WHERE ([dimension].[attribute].Children - [dimension].[attribute].&[value])
This might seem more complicated than needed in this simple example, but in this case the WHERE can grow sometimes, also including UNIONs.
So this works for regular dimensions, but now I have a many-to-many dimension. If I perform the trick above it does not produce the desired result, namely I want to exclude all rows that have that specific attribute in the many-to-many dimension.
Actually it does exactly what the MDX asks, namely count all rows, but ignore the specified attribute. Since a row in the fact table can have multiple attributes in a many-to-many dimension, the row will still be counted.
That's not what I need, I need it to explicitly exclude rows that have that dimension attribute value. Also, I might exclude multiple values. So what I need is something similar to T-SQL's WHERE .. NOT IN (...)
I realize that I can just subtract the resulting values from [attribute].all and [attribute].&[value], but that won't work any more when UNIONing multiple WHERE statements.
Anybody got a good idea on how to solve this?
Thanks in advance,
Delta | ssas | mdx | null | null | null | null | open | MDX WHERE NOT IN() equivalent in many-to-many dimension
===
I have a many-to-many dimension in my cube (next to other regular dimensions). When I want to exclude fact rows in my row count measure, I usually do something like the following in MDX
SELECT [Measures].[Row Count] on 0
FROM cube
WHERE ([dimension].[attribute].Children - [dimension].[attribute].&[value])
This might seem more complicated than needed in this simple example, but in this case the WHERE can grow sometimes, also including UNIONs.
So this works for regular dimensions, but now I have a many-to-many dimension. If I perform the trick above it does not produce the desired result, namely I want to exclude all rows that have that specific attribute in the many-to-many dimension.
Actually it does exactly what the MDX asks, namely count all rows, but ignore the specified attribute. Since a row in the fact table can have multiple attributes in a many-to-many dimension, the row will still be counted.
That's not what I need, I need it to explicitly exclude rows that have that dimension attribute value. Also, I might exclude multiple values. So what I need is something similar to T-SQL's WHERE .. NOT IN (...)
I realize that I can just subtract the resulting values from [attribute].all and [attribute].&[value], but that won't work any more when UNIONing multiple WHERE statements.
Anybody got a good idea on how to solve this?
Thanks in advance,
Delta | 0 |
11,290,271 | 07/02/2012 08:36:28 | 1,495,522 | 07/02/2012 08:26:30 | 1 | 0 | Analyzing BSOD without a dump | One of the drivers I'm developing has caused a BSOD. Unfortunately a dump file was not created since it was not configured / low resources. I was trying to reproduce this crash but no luck so far.
Is there any way to get some info using WinDbg or any other tool?
I have this information:
* A screenshot of the BSOD
* The .sys file.
* Its pdb
* The source code
* The machine it was crashed on
I have everything except the dump itself.
Your help will be much appreciated.
Thanks,
EE.
| c | driver | kernel-programming | bsod | null | 07/03/2012 12:42:17 | off topic | Analyzing BSOD without a dump
===
One of the drivers I'm developing has caused a BSOD. Unfortunately a dump file was not created since it was not configured / low resources. I was trying to reproduce this crash but no luck so far.
Is there any way to get some info using WinDbg or any other tool?
I have this information:
* A screenshot of the BSOD
* The .sys file.
* Its pdb
* The source code
* The machine it was crashed on
I have everything except the dump itself.
Your help will be much appreciated.
Thanks,
EE.
| 2 |
2,334,987 | 02/25/2010 15:07:30 | 54,956 | 01/14/2009 11:00:09 | 270 | 6 | Looking for a lock-free RT-safe single-reader single-writer structure | I'm looking for a **lock-free structure** conforming to these requisites: a **single writer** writes into a lock-free structure and a **single reader** reads from lock-free structure; but **at some time, the lock-free structure needs to be changed by the writer, which then initialises, switches and writes into a new lock-free structure** (of the same type but with another content), and **at the next time the reader reads, it reads from this new lock-free structure** (if the writer multiply switches to a new lock-free structure, the reader discards these structures, ignoring their data). The **lock-free structures must be reused**, i.e. no heap memory allocation/free is allowed during write/read/switch operation, for **RT purposes**.
I have currently implemented a ringbuffer containing multiple of this lock-free structure instances ; but this implementation suffers from the fact that when the writer has used all the ringbuffer units present in the ring, there is no more place to change from ringbuffer... But the rest of the ringbuffer has data which don't have to be read by the reader but can't be re-used by the writer. The ringbuffer structure then does not fit this purpose.
**Any idea** (name or pseudo-implementation, c++ prefered) **of such a lock-free structure?** Thanks for having considered this problem. | lock-free | real-time | design | c++ | null | null | open | Looking for a lock-free RT-safe single-reader single-writer structure
===
I'm looking for a **lock-free structure** conforming to these requisites: a **single writer** writes into a lock-free structure and a **single reader** reads from lock-free structure; but **at some time, the lock-free structure needs to be changed by the writer, which then initialises, switches and writes into a new lock-free structure** (of the same type but with another content), and **at the next time the reader reads, it reads from this new lock-free structure** (if the writer multiply switches to a new lock-free structure, the reader discards these structures, ignoring their data). The **lock-free structures must be reused**, i.e. no heap memory allocation/free is allowed during write/read/switch operation, for **RT purposes**.
I have currently implemented a ringbuffer containing multiple of this lock-free structure instances ; but this implementation suffers from the fact that when the writer has used all the ringbuffer units present in the ring, there is no more place to change from ringbuffer... But the rest of the ringbuffer has data which don't have to be read by the reader but can't be re-used by the writer. The ringbuffer structure then does not fit this purpose.
**Any idea** (name or pseudo-implementation, c++ prefered) **of such a lock-free structure?** Thanks for having considered this problem. | 0 |
9,168,236 | 02/06/2012 22:22:30 | 1,193,424 | 02/06/2012 22:18:39 | 1 | 0 | Web app hyperlinks | I have built a web app that contains a number of hyperlinks to external URL's. The problem I am encountering that I seem unable to find an answer for after scouring this site and others is... when the hyperlink is tapped, Safari opens a new window for the hyperlinked URL, which is fine, but in the background it closes my full-screen web app, requiring the user to reload the web app once they are done with the hyperlinked URL. This behavior is highly undesirable and I am hoping there is a simple solution for it. Any help would be MUCH appreciated.
Cheers,
J | application | safari | hyperlink | web | fullscreen | 02/07/2012 13:52:50 | not a real question | Web app hyperlinks
===
I have built a web app that contains a number of hyperlinks to external URL's. The problem I am encountering that I seem unable to find an answer for after scouring this site and others is... when the hyperlink is tapped, Safari opens a new window for the hyperlinked URL, which is fine, but in the background it closes my full-screen web app, requiring the user to reload the web app once they are done with the hyperlinked URL. This behavior is highly undesirable and I am hoping there is a simple solution for it. Any help would be MUCH appreciated.
Cheers,
J | 1 |
5,047,000 | 02/18/2011 21:54:50 | 143,273 | 07/22/2009 23:02:38 | 591 | 11 | Inject property into existing List with LINQ | I have a Generic List of objects. Those objects have 4 properties. 3 are set by LINQ earlier in the app. Is it possible to insert the 4th property into the existing List using LINQ to SQL without looping through each object in the List?
***EDIT***
For reference sake, one of the first properties is an ID on the record, so I will know with each object in the List what the 4th property should be in the database, but I was hoping to do it without a For Loop as the List might be rather huge. | linq | linq-to-sql | null | null | null | 02/18/2011 22:15:28 | too localized | Inject property into existing List with LINQ
===
I have a Generic List of objects. Those objects have 4 properties. 3 are set by LINQ earlier in the app. Is it possible to insert the 4th property into the existing List using LINQ to SQL without looping through each object in the List?
***EDIT***
For reference sake, one of the first properties is an ID on the record, so I will know with each object in the List what the 4th property should be in the database, but I was hoping to do it without a For Loop as the List might be rather huge. | 3 |
7,857,725 | 10/22/2011 05:57:49 | 880,596 | 08/05/2011 12:47:34 | 42 | 6 | How to save web page locally in android? | I want to save web page as html file in android and then show in webview.
| android | null | null | null | null | 10/25/2011 20:23:26 | not a real question | How to save web page locally in android?
===
I want to save web page as html file in android and then show in webview.
| 1 |
8,358,140 | 12/02/2011 14:54:36 | 924,148 | 09/01/2011 19:52:25 | 1 | 0 | Which database is Freebase.com using? |
Is it a custom database, or are they using a 'classic' triple store ?
| database | sparql | freebase | mql | null | 12/02/2011 16:14:20 | off topic | Which database is Freebase.com using?
===
Is it a custom database, or are they using a 'classic' triple store ?
| 2 |
577,254 | 02/23/2009 11:07:38 | 5,559 | 09/10/2008 14:02:58 | 23 | 2 | Absolutely cntered content inside a WPF layout panel | I need to find a way of absolutely centering the content of a LayoutPanel in WPF. I have two textblock elements which must render at the vertical and horizontal center of the panel without relying on absolute heights and widths.
This is something i can do quite easily with a single element since any ContentControl can have it's verticalContentAlignment property set but then you only have a single child element to play with and i'm back to square one.
Any help would be massively appreciated. | wpf | layout | alignment | null | null | null | open | Absolutely cntered content inside a WPF layout panel
===
I need to find a way of absolutely centering the content of a LayoutPanel in WPF. I have two textblock elements which must render at the vertical and horizontal center of the panel without relying on absolute heights and widths.
This is something i can do quite easily with a single element since any ContentControl can have it's verticalContentAlignment property set but then you only have a single child element to play with and i'm back to square one.
Any help would be massively appreciated. | 0 |
3,152,129 | 06/30/2010 18:14:53 | 331,747 | 05/03/2010 19:59:20 | 201 | 10 | JSF/Seam -- Nested/Recursive iteration | I've got a situation where I would like to perform nested iterations on a series of options and display the results using JSF. As an example, think of a discussion board. Each comment may contain a parent comment and 0-n child comments. So, my root object would be something like this:
public class MyObject {
...
public List<Comment> getComments();
...
}
And my comments would look like this:
public class Comment {
...
public Comment getParent();
...
public List<Comment> getChildComments();
...
}
I've got all of my entities setup using JPA and they are populated within the database. But, my dilema is, how do I iterate over each comment so I can display its child comments inline? I know I can use `<ui:repeat value="#{myObj}" var="comment" />` to iterate over the root-level comments for an object. But, how do I then iterate over the children comments for each of those? And then, how do I iterate over *their* child comments. And so on, and so on.
Has anyone ever done anything like this? I suppose "Nested Iteration" could really be thought of more as "recursive iteration". Thoughts? | jsf | recursion | nested | seam | iteration | null | open | JSF/Seam -- Nested/Recursive iteration
===
I've got a situation where I would like to perform nested iterations on a series of options and display the results using JSF. As an example, think of a discussion board. Each comment may contain a parent comment and 0-n child comments. So, my root object would be something like this:
public class MyObject {
...
public List<Comment> getComments();
...
}
And my comments would look like this:
public class Comment {
...
public Comment getParent();
...
public List<Comment> getChildComments();
...
}
I've got all of my entities setup using JPA and they are populated within the database. But, my dilema is, how do I iterate over each comment so I can display its child comments inline? I know I can use `<ui:repeat value="#{myObj}" var="comment" />` to iterate over the root-level comments for an object. But, how do I then iterate over the children comments for each of those? And then, how do I iterate over *their* child comments. And so on, and so on.
Has anyone ever done anything like this? I suppose "Nested Iteration" could really be thought of more as "recursive iteration". Thoughts? | 0 |
6,792,274 | 07/22/2011 15:26:13 | 542,925 | 10/10/2010 03:19:15 | 45 | 0 | keep record in database of emails and replies | Site admin will make email correspondence with clients through the web form. All the emails and replies need to be stored in db accordingly so that those can be viewed next time just as we do in email services(yahoo, gmail etc), and fresh emails or replies can be made .
How can I implement that? | php | javascript | mysql | null | null | 07/22/2011 17:26:17 | not a real question | keep record in database of emails and replies
===
Site admin will make email correspondence with clients through the web form. All the emails and replies need to be stored in db accordingly so that those can be viewed next time just as we do in email services(yahoo, gmail etc), and fresh emails or replies can be made .
How can I implement that? | 1 |
5,080,033 | 02/22/2011 15:21:05 | 625,139 | 02/20/2011 10:13:10 | 8 | 0 | Need to make a List | Need to make a List that each line have Image and data (text)
what is the right way? with list of table row ? or it is possible with ListView?
thanks for your help
| android | null | null | null | null | 05/22/2012 12:29:20 | not a real question | Need to make a List
===
Need to make a List that each line have Image and data (text)
what is the right way? with list of table row ? or it is possible with ListView?
thanks for your help
| 1 |
11,314,796 | 07/03/2012 15:59:50 | 520,957 | 11/26/2010 05:44:11 | 6,492 | 318 | When should one let an application crash because of an exception in Java (design issue)? | In most cases, it is possible to catch exceptions in Java, even unchecked ones. But, it is not necessarily possible to do something about it (for example out of memory).
For other cases, the issue I am trying to solve is a design principle one. I am trying to set-up a design principle or a set of rules indicating when one should give up on an exceptional situation, even if it is detected in time. The objective is trying to not crash the application as much as possible.
Has someone already brainstormed and communicated about this? I am looking for specific generic cases and possible solutions, or thumb-rules.
| java | exception | crash | null | null | 07/04/2012 12:58:21 | off topic | When should one let an application crash because of an exception in Java (design issue)?
===
In most cases, it is possible to catch exceptions in Java, even unchecked ones. But, it is not necessarily possible to do something about it (for example out of memory).
For other cases, the issue I am trying to solve is a design principle one. I am trying to set-up a design principle or a set of rules indicating when one should give up on an exceptional situation, even if it is detected in time. The objective is trying to not crash the application as much as possible.
Has someone already brainstormed and communicated about this? I am looking for specific generic cases and possible solutions, or thumb-rules.
| 2 |
8,962,740 | 01/22/2012 16:49:11 | 1,122,200 | 12/30/2011 02:27:16 | 69 | 0 | Database connectivity ASP.net? | I've googled this question to repeatedly, but have not found a great answer anywhere. I'm sure someone familiar with ASP.net could answer this pretty easily. What is the best way to connect to a database through ASP.net? LINQ to SQL? Entity framework? I'm not able to find an overview of the different methods to connect or of the place that these technologies have in ASP.net. An explanation or a pointer to a great link would be appreciated. Thanks.
| asp.net | sql | linq | null | null | null | open | Database connectivity ASP.net?
===
I've googled this question to repeatedly, but have not found a great answer anywhere. I'm sure someone familiar with ASP.net could answer this pretty easily. What is the best way to connect to a database through ASP.net? LINQ to SQL? Entity framework? I'm not able to find an overview of the different methods to connect or of the place that these technologies have in ASP.net. An explanation or a pointer to a great link would be appreciated. Thanks.
| 0 |
10,383,248 | 04/30/2012 11:51:31 | 1,326,314 | 04/11/2012 10:25:34 | 1 | 0 | best architecture for low latency | What is the best model for low-latency?
1) apache-prefork + mod_php - more memory + more cpu
2) apache-worker + mod-php - less memory + more cpu but will memcached, apc and all standard extensions be usable here as I read that PHP is mostly not thread safe.
3) apache-prefork + PHP-FPM - more memory + less cpu
4) apache-worker + PHP-FPM - less memory + less cpu
| performance | apache | null | null | null | 04/30/2012 18:45:16 | not constructive | best architecture for low latency
===
What is the best model for low-latency?
1) apache-prefork + mod_php - more memory + more cpu
2) apache-worker + mod-php - less memory + more cpu but will memcached, apc and all standard extensions be usable here as I read that PHP is mostly not thread safe.
3) apache-prefork + PHP-FPM - more memory + less cpu
4) apache-worker + PHP-FPM - less memory + less cpu
| 4 |
906,841 | 05/25/2009 14:00:37 | 985 | 08/11/2008 12:12:42 | 941 | 50 | CSV parser/reader for C#? | is there a good and free implementation of CSV parser available under some liberal licence? Some counterpart of [SuperCSV][1] for Java, perhaps a port?
[1]: http://supercsv.sourceforge.net/ | c# | csv | null | null | null | 06/29/2012 03:15:13 | not constructive | CSV parser/reader for C#?
===
is there a good and free implementation of CSV parser available under some liberal licence? Some counterpart of [SuperCSV][1] for Java, perhaps a port?
[1]: http://supercsv.sourceforge.net/ | 4 |
2,502,032 | 03/23/2010 17:13:42 | 57,083 | 01/20/2009 12:44:23 | 292 | 13 | SQL Update to the SUM if it's joined values | I'm trying to update a field in the database to the sum of it's joined values:
UPDATE P
SET extrasPrice = SUM(E.price)
FROM dbo.BookingPitchExtras AS E
INNER JOIN dbo.BookingPitches AS P ON E.pitchID = P.ID
AND P.bookingID = 1
WHERE E.[required] = 1
When I run this I get the following error:
"An aggregate may not appear in the set list of an UPDATE statement."
Any ideas? | sql | update | sum | null | null | null | open | SQL Update to the SUM if it's joined values
===
I'm trying to update a field in the database to the sum of it's joined values:
UPDATE P
SET extrasPrice = SUM(E.price)
FROM dbo.BookingPitchExtras AS E
INNER JOIN dbo.BookingPitches AS P ON E.pitchID = P.ID
AND P.bookingID = 1
WHERE E.[required] = 1
When I run this I get the following error:
"An aggregate may not appear in the set list of an UPDATE statement."
Any ideas? | 0 |
10,452,941 | 05/04/2012 16:48:14 | 1,265,822 | 03/13/2012 06:55:44 | 1 | 0 | EclipseLink Throwing Exception? | i'm working on a project based on jersey implementation of REST,and i i'm using JPA for persistence,spring IoC for DI.Now i have some objects that must be marshalled with JAXB (MOXy).Following step by step [this tuto][1] i tried to get things working but unfortunately i haven't succeeded yet.The folling are my classes,if you can help please:
Root classe :
package com.persistent.entity;
import java.util.HashMap;
import java.util.Map;
import javax.xml.bind.annotation.XmlAccessType;
import javax.xml.bind.annotation.XmlAccessorType;
import javax.xml.bind.annotation.XmlRootElement;
import javax.xml.bind.annotation.adapters.XmlJavaTypeAdapter;
@XmlAccessorType(XmlAccessType.NONE)
@XmlRootElement
public class Bar {
private Map<String,String> mapbar;
public Bar() {
}
public Bar(Map<String,String> map ){
this.mapbar = map;
}
@XmlJavaTypeAdapter(MapAdapter.class)
public Map<String, String> getMapbar() {
return mapbar;
}
public void setMapbar(Map<String, String> map) {
this.mapbar = map;
}
}
MapAdapter class :
package com.persistent.entity;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
//import javax.xml.bind.JAXBContext;
import javax.xml.bind.annotation.adapters.XmlAdapter;
import javax.xml.parsers.DocumentBuilder;
import javax.xml.parsers.DocumentBuilderFactory;
import org.w3c.dom.Document;
import org.w3c.dom.Element;
import org.w3c.dom.Node;
import org.w3c.dom.NodeList;
public class MapAdapter extends XmlAdapter<AdaptedMap, Map<String, String>> {
@Override
public AdaptedMap marshal(Map<String, String> map) throws Exception {
DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
DocumentBuilder db = dbf.newDocumentBuilder();
Document document = db.newDocument();
Element rootElement = document.createElement("bar");
document.appendChild(rootElement);
for(Entry<String,String> entry : map.entrySet()) {
Element mapElement = document.createElement(entry.getKey());
mapElement.setNodeValue(entry.getValue());
rootElement.appendChild(mapElement);
}
AdaptedMap adaptedMap = new AdaptedMap();
adaptedMap.setValue(document);
return adaptedMap;
}
@Override
public Map<String, String> unmarshal(AdaptedMap adaptedMap) throws Exception {
Map<String, String> map = new HashMap<String, String>();
Element rootElement = (Element) adaptedMap.getValue();
NodeList childNodes = rootElement.getChildNodes();
for(int x=0,size=childNodes.getLength(); x<size; x++) {
Node childNode = childNodes.item(x);
if(childNode.getNodeType() == Node.ELEMENT_NODE) {
map.put(childNode.getLocalName(), childNode.getTextContent());
}
}
return map;
}
}
AdaptedMap class :
package com.persistent.entity;
import javax.xml.bind.annotation.XmlAnyElement;
//import org.w3c.dom.Document;
public class AdaptedMap {
private Object value;
@XmlAnyElement
public Object getValue() {
return value;
}
public void setValue(Object value) {
this.value = value;
}
}
and finaly the resource class :
package com.persistent.rest;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import javax.ws.rs.DefaultValue;
import javax.ws.rs.GET;
import javax.ws.rs.Path;
import javax.ws.rs.Produces;
import javax.ws.rs.QueryParam;
import javax.ws.rs.core.MediaType;
import javax.ws.rs.core.Response;
import javax.xml.bind.JAXBContext;
import javax.xml.bind.Marshaller;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.context.annotation.Scope;
import org.springframework.stereotype.Component;
import com.persistent.entity.Bar;
import com.persistent.entity.BarList;
import com.persistent.entity.Pie;
import com.persistent.entity.Vente;
import com.persistent.entity.VentesList;
import com.persistent.entity.PieList;
import com.persistent.service.VenteService;
import com.sun.jersey.api.json.JSONWithPadding;
// The Java class will be hosted at the URI path "/myresource"
@Path("/myresource")
@Component
@Scope("request")
public class MyResource {
@Autowired
VenteService venteService;
@GET
@Produces("application/x-javascript")
public JSONWithPadding getBarService(@QueryParam("callback") String callback){
int i;
VentesList ventes = venteService.getAll();
Map<String,String> hmBar = new HashMap<String,String>();
for (i=0;i<ventes.getsimpleVentes().size();i++){
hmBar.put(ventes.getsimpleVentes().get(i).getProjet(),String.valueOf(ventes.getsimpleVentes().get(i).getNbrRsrv()));
}
Bar ba = new Bar(hmBar);
return new JSONWithPadding(ba,callback);
}
}
After running this on Tomcat i get this Exception :
GRAVE: "Servlet.service()" pour la servlet Jersey Spring Web Application a généré une exception
java.io.IOException: Error marshalling JAXB object of type "class com.persistent.entity.Bar".
at com.sun.jersey.core.provider.jaxb.AbstractRootElementProvider.writeTo(AbstractRootElementProvider.java:145)
at com.sun.jersey.spi.container.ContainerResponse.write(ContainerResponse.java:254)
at com.sun.jersey.server.impl.application.WebApplicationImpl._handleRequest(WebApplicationImpl.java:578)
at com.sun.jersey.server.impl.application.WebApplicationImpl.handleRequest(WebApplicationImpl.java:502)
at com.sun.jersey.server.impl.application.WebApplicationImpl.handleRequest(WebApplicationImpl.java:493)
at com.sun.jersey.spi.container.servlet.WebComponent.service(WebComponent.java:308)
at com.sun.jersey.spi.container.servlet.ServletContainer.service(ServletContainer.java:314)
at com.sun.jersey.spi.container.servlet.ServletContainer.service(ServletContainer.java:239)
at org.apache.catalina.core.ApplicationFilterChain.internalDoFilter(ApplicationFilterChain.java:290)
at org.apache.catalina.core.ApplicationFilterChain.doFilter(ApplicationFilterChain.java:206)
at org.apache.catalina.core.StandardWrapperValve.invoke(StandardWrapperValve.java:233)
at org.apache.catalina.core.StandardContextValve.invoke(StandardContextValve.java:191)
at org.apache.catalina.core.StandardHostValve.invoke(StandardHostValve.java:127)
at org.apache.catalina.valves.ErrorReportValve.invoke(ErrorReportValve.java:102)
at org.apache.catalina.core.StandardEngineValve.invoke(StandardEngineValve.java:109)
at org.apache.catalina.connector.CoyoteAdapter.service(CoyoteAdapter.java:298)
at org.apache.coyote.http11.Http11Processor.process(Http11Processor.java:859)
at org.apache.coyote.http11.Http11Protocol$Http11ConnectionHandler.process(Http11Protocol.java:588)
at org.apache.tomcat.util.net.JIoEndpoint$Worker.run(JIoEndpoint.java:489)
at java.lang.Thread.run(Thread.java:619)
Caused by: javax.xml.bind.MarshalException
- with linked exception:
[Exception [EclipseLink-25003] (Eclipse Persistence Services - 2.3.1.v20111018-r10243): org.eclipse.persistence.exceptions.XMLMarshalException
Exception Description: An error occurred marshalling the object
Internal Exception: Exception [EclipseLink-3001] (Eclipse Persistence Services - 2.3.1.v20111018-r10243): org.eclipse.persistence.exceptions.ConversionException
Exception Description: The object [{Dyar Al Baydae=6, TEST=8, test=5, Dyar Al Bahja=20, Dyar Al Mansour=87}], of class [class java.util.HashMap], could not be converted to [class com.persistent.entity.AdaptedMap].]
at org.eclipse.persistence.jaxb.JAXBMarshaller.marshal(JAXBMarshaller.java:326)
at com.sun.jersey.core.provider.jaxb.AbstractRootElementProvider.writeTo(AbstractRootElementProvider.java:167)
at com.sun.jersey.core.provider.jaxb.AbstractRootElementProvider.writeTo(AbstractRootElementProvider.java:143)
... 19 more
[1]: http://stackoverflow.com/questions/3941479/jaxb-how-to-marshall-map-into-keyvalue-key | jersey | eclipselink | null | null | null | null | open | EclipseLink Throwing Exception?
===
i'm working on a project based on jersey implementation of REST,and i i'm using JPA for persistence,spring IoC for DI.Now i have some objects that must be marshalled with JAXB (MOXy).Following step by step [this tuto][1] i tried to get things working but unfortunately i haven't succeeded yet.The folling are my classes,if you can help please:
Root classe :
package com.persistent.entity;
import java.util.HashMap;
import java.util.Map;
import javax.xml.bind.annotation.XmlAccessType;
import javax.xml.bind.annotation.XmlAccessorType;
import javax.xml.bind.annotation.XmlRootElement;
import javax.xml.bind.annotation.adapters.XmlJavaTypeAdapter;
@XmlAccessorType(XmlAccessType.NONE)
@XmlRootElement
public class Bar {
private Map<String,String> mapbar;
public Bar() {
}
public Bar(Map<String,String> map ){
this.mapbar = map;
}
@XmlJavaTypeAdapter(MapAdapter.class)
public Map<String, String> getMapbar() {
return mapbar;
}
public void setMapbar(Map<String, String> map) {
this.mapbar = map;
}
}
MapAdapter class :
package com.persistent.entity;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
//import javax.xml.bind.JAXBContext;
import javax.xml.bind.annotation.adapters.XmlAdapter;
import javax.xml.parsers.DocumentBuilder;
import javax.xml.parsers.DocumentBuilderFactory;
import org.w3c.dom.Document;
import org.w3c.dom.Element;
import org.w3c.dom.Node;
import org.w3c.dom.NodeList;
public class MapAdapter extends XmlAdapter<AdaptedMap, Map<String, String>> {
@Override
public AdaptedMap marshal(Map<String, String> map) throws Exception {
DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
DocumentBuilder db = dbf.newDocumentBuilder();
Document document = db.newDocument();
Element rootElement = document.createElement("bar");
document.appendChild(rootElement);
for(Entry<String,String> entry : map.entrySet()) {
Element mapElement = document.createElement(entry.getKey());
mapElement.setNodeValue(entry.getValue());
rootElement.appendChild(mapElement);
}
AdaptedMap adaptedMap = new AdaptedMap();
adaptedMap.setValue(document);
return adaptedMap;
}
@Override
public Map<String, String> unmarshal(AdaptedMap adaptedMap) throws Exception {
Map<String, String> map = new HashMap<String, String>();
Element rootElement = (Element) adaptedMap.getValue();
NodeList childNodes = rootElement.getChildNodes();
for(int x=0,size=childNodes.getLength(); x<size; x++) {
Node childNode = childNodes.item(x);
if(childNode.getNodeType() == Node.ELEMENT_NODE) {
map.put(childNode.getLocalName(), childNode.getTextContent());
}
}
return map;
}
}
AdaptedMap class :
package com.persistent.entity;
import javax.xml.bind.annotation.XmlAnyElement;
//import org.w3c.dom.Document;
public class AdaptedMap {
private Object value;
@XmlAnyElement
public Object getValue() {
return value;
}
public void setValue(Object value) {
this.value = value;
}
}
and finaly the resource class :
package com.persistent.rest;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import javax.ws.rs.DefaultValue;
import javax.ws.rs.GET;
import javax.ws.rs.Path;
import javax.ws.rs.Produces;
import javax.ws.rs.QueryParam;
import javax.ws.rs.core.MediaType;
import javax.ws.rs.core.Response;
import javax.xml.bind.JAXBContext;
import javax.xml.bind.Marshaller;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.context.annotation.Scope;
import org.springframework.stereotype.Component;
import com.persistent.entity.Bar;
import com.persistent.entity.BarList;
import com.persistent.entity.Pie;
import com.persistent.entity.Vente;
import com.persistent.entity.VentesList;
import com.persistent.entity.PieList;
import com.persistent.service.VenteService;
import com.sun.jersey.api.json.JSONWithPadding;
// The Java class will be hosted at the URI path "/myresource"
@Path("/myresource")
@Component
@Scope("request")
public class MyResource {
@Autowired
VenteService venteService;
@GET
@Produces("application/x-javascript")
public JSONWithPadding getBarService(@QueryParam("callback") String callback){
int i;
VentesList ventes = venteService.getAll();
Map<String,String> hmBar = new HashMap<String,String>();
for (i=0;i<ventes.getsimpleVentes().size();i++){
hmBar.put(ventes.getsimpleVentes().get(i).getProjet(),String.valueOf(ventes.getsimpleVentes().get(i).getNbrRsrv()));
}
Bar ba = new Bar(hmBar);
return new JSONWithPadding(ba,callback);
}
}
After running this on Tomcat i get this Exception :
GRAVE: "Servlet.service()" pour la servlet Jersey Spring Web Application a généré une exception
java.io.IOException: Error marshalling JAXB object of type "class com.persistent.entity.Bar".
at com.sun.jersey.core.provider.jaxb.AbstractRootElementProvider.writeTo(AbstractRootElementProvider.java:145)
at com.sun.jersey.spi.container.ContainerResponse.write(ContainerResponse.java:254)
at com.sun.jersey.server.impl.application.WebApplicationImpl._handleRequest(WebApplicationImpl.java:578)
at com.sun.jersey.server.impl.application.WebApplicationImpl.handleRequest(WebApplicationImpl.java:502)
at com.sun.jersey.server.impl.application.WebApplicationImpl.handleRequest(WebApplicationImpl.java:493)
at com.sun.jersey.spi.container.servlet.WebComponent.service(WebComponent.java:308)
at com.sun.jersey.spi.container.servlet.ServletContainer.service(ServletContainer.java:314)
at com.sun.jersey.spi.container.servlet.ServletContainer.service(ServletContainer.java:239)
at org.apache.catalina.core.ApplicationFilterChain.internalDoFilter(ApplicationFilterChain.java:290)
at org.apache.catalina.core.ApplicationFilterChain.doFilter(ApplicationFilterChain.java:206)
at org.apache.catalina.core.StandardWrapperValve.invoke(StandardWrapperValve.java:233)
at org.apache.catalina.core.StandardContextValve.invoke(StandardContextValve.java:191)
at org.apache.catalina.core.StandardHostValve.invoke(StandardHostValve.java:127)
at org.apache.catalina.valves.ErrorReportValve.invoke(ErrorReportValve.java:102)
at org.apache.catalina.core.StandardEngineValve.invoke(StandardEngineValve.java:109)
at org.apache.catalina.connector.CoyoteAdapter.service(CoyoteAdapter.java:298)
at org.apache.coyote.http11.Http11Processor.process(Http11Processor.java:859)
at org.apache.coyote.http11.Http11Protocol$Http11ConnectionHandler.process(Http11Protocol.java:588)
at org.apache.tomcat.util.net.JIoEndpoint$Worker.run(JIoEndpoint.java:489)
at java.lang.Thread.run(Thread.java:619)
Caused by: javax.xml.bind.MarshalException
- with linked exception:
[Exception [EclipseLink-25003] (Eclipse Persistence Services - 2.3.1.v20111018-r10243): org.eclipse.persistence.exceptions.XMLMarshalException
Exception Description: An error occurred marshalling the object
Internal Exception: Exception [EclipseLink-3001] (Eclipse Persistence Services - 2.3.1.v20111018-r10243): org.eclipse.persistence.exceptions.ConversionException
Exception Description: The object [{Dyar Al Baydae=6, TEST=8, test=5, Dyar Al Bahja=20, Dyar Al Mansour=87}], of class [class java.util.HashMap], could not be converted to [class com.persistent.entity.AdaptedMap].]
at org.eclipse.persistence.jaxb.JAXBMarshaller.marshal(JAXBMarshaller.java:326)
at com.sun.jersey.core.provider.jaxb.AbstractRootElementProvider.writeTo(AbstractRootElementProvider.java:167)
at com.sun.jersey.core.provider.jaxb.AbstractRootElementProvider.writeTo(AbstractRootElementProvider.java:143)
... 19 more
[1]: http://stackoverflow.com/questions/3941479/jaxb-how-to-marshall-map-into-keyvalue-key | 0 |
11,244,464 | 06/28/2012 12:17:31 | 1,252,776 | 03/06/2012 16:52:07 | 377 | 23 | From the given array of numbers find all the of numbers in group of 3 with sum value N | Given is a array of numbers:
1, 2, 8, 6, 9, 0, 4
We need to find all the numbers in group of three which sums to a value N ( say 11 in this example). Here, the possible numbers in group of three are:
{1,2,8}, {1,4,6}, {0,2,9}
The first solution I could think was of O(n^3). Later I could improve a little(n^2 log n) with the approach:
1. Sort the array.
2. Select any two number and perform binary search for the third element.
Can it be improved further with some other approaches?
| algorithm | null | null | null | null | null | open | From the given array of numbers find all the of numbers in group of 3 with sum value N
===
Given is a array of numbers:
1, 2, 8, 6, 9, 0, 4
We need to find all the numbers in group of three which sums to a value N ( say 11 in this example). Here, the possible numbers in group of three are:
{1,2,8}, {1,4,6}, {0,2,9}
The first solution I could think was of O(n^3). Later I could improve a little(n^2 log n) with the approach:
1. Sort the array.
2. Select any two number and perform binary search for the third element.
Can it be improved further with some other approaches?
| 0 |
9,067,967 | 01/30/2012 17:22:37 | 83,905 | 03/28/2009 03:01:11 | 6,481 | 419 | open source implementation for contacts UI of ios sdk? | I am looking for open source UI implementation like the native contacts app have in iPhone. Like adding and editing contacts for our own app instead of using AddressbookUI. If someone knows let me know.
Thanks | ios | open-source | contacts | addressbook | null | null | open | open source implementation for contacts UI of ios sdk?
===
I am looking for open source UI implementation like the native contacts app have in iPhone. Like adding and editing contacts for our own app instead of using AddressbookUI. If someone knows let me know.
Thanks | 0 |
1,523,691 | 10/06/2009 05:06:57 | 164,299 | 08/27/2009 15:30:18 | 348 | 14 | What are good video tutorials for Hibernate ? | I am new to Hibernate and what are some good video tutorials/online tutorials to guide me ?
Thanks. | hibernate | tutorials | null | null | null | 02/13/2012 23:23:48 | not constructive | What are good video tutorials for Hibernate ?
===
I am new to Hibernate and what are some good video tutorials/online tutorials to guide me ?
Thanks. | 4 |
8,939,983 | 01/20/2012 10:29:43 | 1,141,168 | 01/10/2012 15:14:27 | 1 | 0 | Request : Brute Force Protection Windows 2008 | My Database information (i mean all accounts / password ) was bypassed with brute force attack.
How can i protect my Database system from attack again , my customers lose his accounts now
Working programs on dedicated machine : Mysql Server 5.0 , Navicat premium
| mysql | null | null | null | null | 01/22/2012 01:02:12 | off topic | Request : Brute Force Protection Windows 2008
===
My Database information (i mean all accounts / password ) was bypassed with brute force attack.
How can i protect my Database system from attack again , my customers lose his accounts now
Working programs on dedicated machine : Mysql Server 5.0 , Navicat premium
| 2 |
8,282,193 | 11/26/2011 22:43:02 | 1,007,632 | 10/21/2011 18:05:03 | 4 | 0 | Having problems with importing a module | I use os.chdir() to change the current directory where my recommendations.py file is.
Then I type "import recommendations" and I get error: ImportError: No module named recommendations.
What could be the problem?
Thanks | python | null | null | null | null | null | open | Having problems with importing a module
===
I use os.chdir() to change the current directory where my recommendations.py file is.
Then I type "import recommendations" and I get error: ImportError: No module named recommendations.
What could be the problem?
Thanks | 0 |
9,306,953 | 02/16/2012 07:07:46 | 15,127 | 09/17/2008 06:20:18 | 1,586 | 90 | Trying to optimize a query that picks an 'approximate closest record' | I have a table that contains a lot of data, where we particularly care about the `date` field. The reason for this is that the data volume just went up ~30x, and the old ways will fall apart soon. The query I hope you can help me optimize needs to:
* take a list of dates (generated by a cte based table-valued function)
* retrieve a single record for each of those dates
* based on some definition of 'nearest'
For instance, the current table contains data in 5 second (+/- a little) intervals. I need to sample that table and get the record that falls closest to a 30 second interval.
What I have right now works just fine. I'm simply curious if there is a way to optimize it more. If I can do it in Linq To SQL, that would be neat too. I am even interested in suggestions on indexes, given the amount of date values (~2 million rows min).
declare @st datetime ; set @st = '2012-01-31 05:05:00';
declare @end datetime ; set @end = '2012-01-31 05:10:00';
select distinct
log.* -- id,
from
dbo.fn_GenerateDateSteps(@st, @end, 30) as d
inner join lotsOfLogData log on l.Id = (
select top 1 e.[Id]
from
lotsOfLogData as log -- contains data in 5 second intervals
where
-- search for dates in a certain range
utcTime between DateAdd(s, -10, dt) AND DateAdd(s, 5, dt)
order by
-- get the 'closest'. this can change a little, but will always
-- be based on a difference between the date
abs(datediff(s, dt, UtcTime))
)
where
log.stationId = 1000
The table structure of lotsOfLogData is below. There are relatively few station IDs (maybe 50), but lots of records for each. We know the station id when we query.
create table ##lotsOfLogData (
Id bigint identity(1,1) not null
, StationId int not null
, UtcTime datetime not null
-- 20 other fields, used for other calculations
)
**fn_GenerateDateSteps** returns a dataset like this, for the parameters given:
[DT]
2012-01-31 05:05:00.000
2012-01-31 05:05:30.000
2012-01-31 05:06:00.000
2012-01-31 05:06:30.000 (and so on, every 30 seconds)
I have done this with a temporary table as well, in this manner, but that came out just a little bit more expensive.
declare @dates table ( dt datetime, ClosestId bigint);
insert into @dates (dt) select dt from dbo.fn_GenerateDateSteps(@st, @end, 30)
update @dates set closestId = ( -- same subquery as above )
select * from lotsOfLogData inner join @dates on Id = ClosestId | sql-server | query | sql-server-2005 | null | null | null | open | Trying to optimize a query that picks an 'approximate closest record'
===
I have a table that contains a lot of data, where we particularly care about the `date` field. The reason for this is that the data volume just went up ~30x, and the old ways will fall apart soon. The query I hope you can help me optimize needs to:
* take a list of dates (generated by a cte based table-valued function)
* retrieve a single record for each of those dates
* based on some definition of 'nearest'
For instance, the current table contains data in 5 second (+/- a little) intervals. I need to sample that table and get the record that falls closest to a 30 second interval.
What I have right now works just fine. I'm simply curious if there is a way to optimize it more. If I can do it in Linq To SQL, that would be neat too. I am even interested in suggestions on indexes, given the amount of date values (~2 million rows min).
declare @st datetime ; set @st = '2012-01-31 05:05:00';
declare @end datetime ; set @end = '2012-01-31 05:10:00';
select distinct
log.* -- id,
from
dbo.fn_GenerateDateSteps(@st, @end, 30) as d
inner join lotsOfLogData log on l.Id = (
select top 1 e.[Id]
from
lotsOfLogData as log -- contains data in 5 second intervals
where
-- search for dates in a certain range
utcTime between DateAdd(s, -10, dt) AND DateAdd(s, 5, dt)
order by
-- get the 'closest'. this can change a little, but will always
-- be based on a difference between the date
abs(datediff(s, dt, UtcTime))
)
where
log.stationId = 1000
The table structure of lotsOfLogData is below. There are relatively few station IDs (maybe 50), but lots of records for each. We know the station id when we query.
create table ##lotsOfLogData (
Id bigint identity(1,1) not null
, StationId int not null
, UtcTime datetime not null
-- 20 other fields, used for other calculations
)
**fn_GenerateDateSteps** returns a dataset like this, for the parameters given:
[DT]
2012-01-31 05:05:00.000
2012-01-31 05:05:30.000
2012-01-31 05:06:00.000
2012-01-31 05:06:30.000 (and so on, every 30 seconds)
I have done this with a temporary table as well, in this manner, but that came out just a little bit more expensive.
declare @dates table ( dt datetime, ClosestId bigint);
insert into @dates (dt) select dt from dbo.fn_GenerateDateSteps(@st, @end, 30)
update @dates set closestId = ( -- same subquery as above )
select * from lotsOfLogData inner join @dates on Id = ClosestId | 0 |
8,928,381 | 01/19/2012 15:09:49 | 1,155,533 | 01/18/2012 05:58:08 | 1 | 0 | image database in matlab | I have images of 30 different leaves in white background numbered 1-30. I'm working on a project in image processing where the user can load a new leaf image with white background and the program will compare it with the images on the database and show the most similar.
I'm new to matlab. How can i extract the features and store it to a database (mat file)?
Any help would be appreciated. | matlab | null | null | null | null | 01/19/2012 21:57:09 | not a real question | image database in matlab
===
I have images of 30 different leaves in white background numbered 1-30. I'm working on a project in image processing where the user can load a new leaf image with white background and the program will compare it with the images on the database and show the most similar.
I'm new to matlab. How can i extract the features and store it to a database (mat file)?
Any help would be appreciated. | 1 |
6,803,150 | 07/23/2011 20:36:02 | 313,528 | 04/10/2010 15:44:28 | 177 | 3 | Component not visible in JPanel | I have JPanel in a container of a JFrame called Box
public Box(){
add(new Ball());
}
public void paint(Graphics g){
g.setColor(Color.WHITE);
g.fillRect(OFFSET, OFFSET, WIDTH, HEIGHT);
g.setColor(Color.BLACK);
g.drawRect(OFFSET, OFFSET, WIDTH, HEIGHT);
}
Ball extends Component and draws a ball
public class Ball extends Component{
...
public void paint(Graphics g){
g.setColor(Color.BLACK);
g.fillOval(xCoord, yCoord, radius, radius);
}
...
}
When I add a Box with a Ball to the container I can only ever see the Box. If I just add a Ball I can see the Ball.
Does anyone know why the Ball is not visible when added to a Box? | java | swing | graphics | awt | paint | null | open | Component not visible in JPanel
===
I have JPanel in a container of a JFrame called Box
public Box(){
add(new Ball());
}
public void paint(Graphics g){
g.setColor(Color.WHITE);
g.fillRect(OFFSET, OFFSET, WIDTH, HEIGHT);
g.setColor(Color.BLACK);
g.drawRect(OFFSET, OFFSET, WIDTH, HEIGHT);
}
Ball extends Component and draws a ball
public class Ball extends Component{
...
public void paint(Graphics g){
g.setColor(Color.BLACK);
g.fillOval(xCoord, yCoord, radius, radius);
}
...
}
When I add a Box with a Ball to the container I can only ever see the Box. If I just add a Ball I can see the Ball.
Does anyone know why the Ball is not visible when added to a Box? | 0 |
10,669,922 | 05/20/2012 00:41:08 | 1,405,727 | 05/20/2012 00:34:11 | 1 | 0 | Editing .plist file objective C | I'm learning how to program in xcode for iphoneos. I didn't like the restrictions of the default iphoneos so I decided to start to develop for jailbroken iphoneos. The question I'm going to ask relates to that.
Like I said, I'm new to Obj-c. I want to:
1. Read a plist file in /var/mobile/Library/Preferences [specifically com.apple.assistant.plist] (Jailbroken, remember?)
2. Change the string for the key, "Hostname".
3. Save the plist file.
Then I plan to throw the code in a IBAction and link it to a button in IB.
Does anyone know how to achieve this? Can you post the code for it?
Thanks in advanced! I will love whoever can help me with this. It's the only thing holding me back from an awesome app! | objective-c | read | plist | write | jailbreak | 05/20/2012 21:32:08 | not a real question | Editing .plist file objective C
===
I'm learning how to program in xcode for iphoneos. I didn't like the restrictions of the default iphoneos so I decided to start to develop for jailbroken iphoneos. The question I'm going to ask relates to that.
Like I said, I'm new to Obj-c. I want to:
1. Read a plist file in /var/mobile/Library/Preferences [specifically com.apple.assistant.plist] (Jailbroken, remember?)
2. Change the string for the key, "Hostname".
3. Save the plist file.
Then I plan to throw the code in a IBAction and link it to a button in IB.
Does anyone know how to achieve this? Can you post the code for it?
Thanks in advanced! I will love whoever can help me with this. It's the only thing holding me back from an awesome app! | 1 |
9,295,958 | 02/15/2012 15:15:48 | 237,681 | 12/23/2009 15:31:25 | 2,553 | 26 | Crop image, save it | $filename = '/home/hey/Desktop/images/oldImage.jpg';
$percent = 0.5;
// Get new dimensions
list($width, $height) = getimagesize($filename);
$new_width = $width * $percent;
$new_height = $height * $percent;
// Resample
$image_p = imagecreatetruecolor($new_width, $new_height);
$image = imagecreatefromjpeg($filename);
imagecopyresampled($image_p, $image, 0, 0, 0, 0, $new_width, $new_height, $width, $height);
file_put_contents("/home/hey/Desktop/images/oldImage.jpg", imagejpeg($image_p));
I just want to crop oldImage a little bit and save it again. What's wrong? Thanks.
**edit: Image is just not created. It creates empty image.** | php | gd | null | null | null | 02/16/2012 03:59:55 | not a real question | Crop image, save it
===
$filename = '/home/hey/Desktop/images/oldImage.jpg';
$percent = 0.5;
// Get new dimensions
list($width, $height) = getimagesize($filename);
$new_width = $width * $percent;
$new_height = $height * $percent;
// Resample
$image_p = imagecreatetruecolor($new_width, $new_height);
$image = imagecreatefromjpeg($filename);
imagecopyresampled($image_p, $image, 0, 0, 0, 0, $new_width, $new_height, $width, $height);
file_put_contents("/home/hey/Desktop/images/oldImage.jpg", imagejpeg($image_p));
I just want to crop oldImage a little bit and save it again. What's wrong? Thanks.
**edit: Image is just not created. It creates empty image.** | 1 |
8,671,621 | 12/29/2011 18:15:05 | 335,427 | 05/07/2010 12:27:14 | 321 | 11 | UITableView reloadData does not reload | I am quite puzzled why reloadData does not reload the tableview. It does not call numberOfRowsInSection...
The fetschedResultController does get the new row after having saved the new data into core-data
Before adding new data to the tableview
2011-12-29 19:09:08:213 CaveConditions[56423:71939] FRC 170
After viewWillAppear and adding data
2011-12-29 19:09:35:908 CaveConditions[56423:71939] FRC NEW 171
As soon as I restart the app it shows the new content... I am using Storyboard and have done all the connection between the tableview and the delegate / data source and checked it multiple times. The Class is a UIViewController.
- (void)viewWillAppear:(BOOL)animated
{
[super viewWillAppear:animated];
self.fetchedResultsController = nil;
NSError *error;
if (![[self fetchedResultsController] performFetch:&error]) {
// Update to handle the error appropriately.
NSLog(@"Unresolved error %@, %@", error, [error userInfo]);
}
id <NSFetchedResultsSectionInfo> sectionInfo = [[fetchedResultsController sections] objectAtIndex:0];
NSLog(@"FRC NEW %d",[sectionInfo numberOfObjects]);
[self.aTableView reloadData];
}
Not sure what the problem is here... any ideas? | uitableview | reloaddata | null | null | null | null | open | UITableView reloadData does not reload
===
I am quite puzzled why reloadData does not reload the tableview. It does not call numberOfRowsInSection...
The fetschedResultController does get the new row after having saved the new data into core-data
Before adding new data to the tableview
2011-12-29 19:09:08:213 CaveConditions[56423:71939] FRC 170
After viewWillAppear and adding data
2011-12-29 19:09:35:908 CaveConditions[56423:71939] FRC NEW 171
As soon as I restart the app it shows the new content... I am using Storyboard and have done all the connection between the tableview and the delegate / data source and checked it multiple times. The Class is a UIViewController.
- (void)viewWillAppear:(BOOL)animated
{
[super viewWillAppear:animated];
self.fetchedResultsController = nil;
NSError *error;
if (![[self fetchedResultsController] performFetch:&error]) {
// Update to handle the error appropriately.
NSLog(@"Unresolved error %@, %@", error, [error userInfo]);
}
id <NSFetchedResultsSectionInfo> sectionInfo = [[fetchedResultsController sections] objectAtIndex:0];
NSLog(@"FRC NEW %d",[sectionInfo numberOfObjects]);
[self.aTableView reloadData];
}
Not sure what the problem is here... any ideas? | 0 |
9,776,451 | 03/19/2012 19:18:34 | 416,029 | 08/10/2010 10:23:41 | 331 | 3 | Java Hashtable#hashCode() implementation broken? | I'm wondering if the default implementation of Java's Hashtable#hashCode() is broken when the Hashtable contains only entries with identical keys and values per pair.
See for example the following application:
<!-- language: java -->
public class HashtableHash {
public static void main(final String[] args) {
final Hashtable<String, String> ht = new Hashtable<String, String>();
final int h1 = ht.hashCode();
System.out.println(h1); // output is 0
ht.put("Test", "Test");
final int h2 = ht.hashCode();
System.out.println(h2); // output is 0 ?!?
// Hashtable#hashCode() uses this algorithm to calculate hash code
// of every element:
//
// h += e.key.hashCode() ^ e.value.hashCode()
//
// The result of XOR on identical hash codes is always 0
// (because all bits are equal)
ht.put("Test2", "Hello world");
final int h3 = ht.hashCode();
System.out.println(h3); // output is some hash code
}
}
The hash code for an empty Hashtable is 0. After an entry with the key `"Test"` and value `"Test"` has been added to the Hastable the hash code **still** is 0.
The problem is that in Hashtable's `hashCode()` method the hash code of every entry is calculated and added to the hash code as follows
h += e.key.hashCode() ^ e.value.hashCode()
However XOR on identical hash codes (which is the case for identical Strings) is always 0. So entries with identical keys and values are not part of the Hashtable's hash code.
This implementation is *imho* broken because the Hashtable actually has changed. It shouldn't matter if key and value are identical. | java | hashtable | hashcode | null | null | 03/20/2012 02:42:11 | not constructive | Java Hashtable#hashCode() implementation broken?
===
I'm wondering if the default implementation of Java's Hashtable#hashCode() is broken when the Hashtable contains only entries with identical keys and values per pair.
See for example the following application:
<!-- language: java -->
public class HashtableHash {
public static void main(final String[] args) {
final Hashtable<String, String> ht = new Hashtable<String, String>();
final int h1 = ht.hashCode();
System.out.println(h1); // output is 0
ht.put("Test", "Test");
final int h2 = ht.hashCode();
System.out.println(h2); // output is 0 ?!?
// Hashtable#hashCode() uses this algorithm to calculate hash code
// of every element:
//
// h += e.key.hashCode() ^ e.value.hashCode()
//
// The result of XOR on identical hash codes is always 0
// (because all bits are equal)
ht.put("Test2", "Hello world");
final int h3 = ht.hashCode();
System.out.println(h3); // output is some hash code
}
}
The hash code for an empty Hashtable is 0. After an entry with the key `"Test"` and value `"Test"` has been added to the Hastable the hash code **still** is 0.
The problem is that in Hashtable's `hashCode()` method the hash code of every entry is calculated and added to the hash code as follows
h += e.key.hashCode() ^ e.value.hashCode()
However XOR on identical hash codes (which is the case for identical Strings) is always 0. So entries with identical keys and values are not part of the Hashtable's hash code.
This implementation is *imho* broken because the Hashtable actually has changed. It shouldn't matter if key and value are identical. | 4 |
7,092,796 | 08/17/2011 12:30:18 | 231,197 | 12/14/2009 11:34:18 | 56 | 6 | Unit test with IEnumerable return type | I've been living under a rock for some years, but finaly I had to take a look at unit testing.
I'm trying to unit test a Repository that return IEnumerable<Contact>
[TestMethod()]
public void GetContactsTest()
{
string sqlStr = Settings1.Default["TestSqlString"].ToString();
ContactRepository target = new ContactRepository(sqlStr);
IEnumerable<Contact> expected = new IEnumerable<Contact>();
IEnumerable<Contact> actual;
actual = target.GetContacts();
Assert.AreEqual(expected, actual);
}
But, It's not possible to create an instance off the IEnumerable<Contact> for the expected object.
Could anyone guide this noob a little :) | asp.net | unit-testing | null | null | null | null | open | Unit test with IEnumerable return type
===
I've been living under a rock for some years, but finaly I had to take a look at unit testing.
I'm trying to unit test a Repository that return IEnumerable<Contact>
[TestMethod()]
public void GetContactsTest()
{
string sqlStr = Settings1.Default["TestSqlString"].ToString();
ContactRepository target = new ContactRepository(sqlStr);
IEnumerable<Contact> expected = new IEnumerable<Contact>();
IEnumerable<Contact> actual;
actual = target.GetContacts();
Assert.AreEqual(expected, actual);
}
But, It's not possible to create an instance off the IEnumerable<Contact> for the expected object.
Could anyone guide this noob a little :) | 0 |
5,462,485 | 03/28/2011 17:04:53 | 394,868 | 07/17/2010 21:23:14 | 819 | 2 | Writing TextMate bundle | I want to write a bundle for TextMate, where to start? | osx | textmate | textmatebundles | null | null | 03/29/2011 01:48:02 | not a real question | Writing TextMate bundle
===
I want to write a bundle for TextMate, where to start? | 1 |
3,076,517 | 06/19/2010 17:26:47 | 146,780 | 07/29/2009 01:23:43 | 1,477 | 7 | Good tutorial to create Win32 toolbar? | I want to add a toolbar and know which tool was clicked. I'd also like to be able to change the toolbar's buttons' bitmap after theyve been created MSDN is fairly breif on all of this. Thanks | c++ | c | winapi | null | null | null | open | Good tutorial to create Win32 toolbar?
===
I want to add a toolbar and know which tool was clicked. I'd also like to be able to change the toolbar's buttons' bitmap after theyve been created MSDN is fairly breif on all of this. Thanks | 0 |
8,768,357 | 01/07/2012 08:25:15 | 447,622 | 09/14/2010 17:36:34 | 221 | 3 | Is there a mozilla service to create thumbnails(thumbshots) of a website? | Is there a mozilla service to create thumbnails(thumbshots) of a website. I am working on a search engine directory. And I do not want to use third party API due to the immense load of query | search-engine | thumbnail | mozilla | null | null | 01/08/2012 11:23:34 | off topic | Is there a mozilla service to create thumbnails(thumbshots) of a website?
===
Is there a mozilla service to create thumbnails(thumbshots) of a website. I am working on a search engine directory. And I do not want to use third party API due to the immense load of query | 2 |
10,854,056 | 06/01/2012 16:26:31 | 257,001 | 01/22/2010 18:45:32 | 18 | 0 | WPF and clickonce : Reference in the manifest does not match the identity of the downloaded assembly WpfApplication1.exe | i'm testing deployment of a dummy wpf browser application in VS2010.
if i click on the localhost xbap it runs ok.
then i publish it on a file server \\Bebrus1002\Intranet\it\ABS\WpfBrowserApplication1.xbap
but when i click on the deployed xbap i get this error :
Following errors were detected during this operation.
* [1/06/2012 18:14:34] System.Deployment.Application.InvalidDeploymentException (RefDefValidation)
- Reference in the manifest does not match the identity of the downloaded assembly WpfApplication1.exe.
- Source: System.Deployment
- Stack trace:
at System.Deployment.Application.DownloadManager.ProcessDownloadedFile(Object sender, DownloadEventArgs e)
at System.Deployment.Application.FileDownloader.DownloadModifiedEventHandler.Invoke(Object sender, DownloadEventArgs e)
at System.Deployment.Application.FileDownloader.OnModified()
at System.Deployment.Application.SystemNetDownloader.DownloadSingleFile(DownloadQueueItem next)
at System.Deployment.Application.SystemNetDownloader.DownloadAllFiles()
at System.Deployment.Application.FileDownloader.Download(SubscriptionState subState)
at System.Deployment.Application.DownloadManager.DownloadDependencies(SubscriptionState subState, AssemblyManifest deployManifest, AssemblyManifest appManifest, Uri sourceUriBase, String targetDirectory, String group, IDownloadNotification notification, DownloadOptions options)
at System.Deployment.Application.DeploymentManager.SynchronizeCore(Boolean blocking)
at System.Deployment.Application.DeploymentManager.SynchronizeAsyncWorker()
any ideas ? | wpf | deployment | clickonce | manifest | null | 06/14/2012 14:13:20 | too localized | WPF and clickonce : Reference in the manifest does not match the identity of the downloaded assembly WpfApplication1.exe
===
i'm testing deployment of a dummy wpf browser application in VS2010.
if i click on the localhost xbap it runs ok.
then i publish it on a file server \\Bebrus1002\Intranet\it\ABS\WpfBrowserApplication1.xbap
but when i click on the deployed xbap i get this error :
Following errors were detected during this operation.
* [1/06/2012 18:14:34] System.Deployment.Application.InvalidDeploymentException (RefDefValidation)
- Reference in the manifest does not match the identity of the downloaded assembly WpfApplication1.exe.
- Source: System.Deployment
- Stack trace:
at System.Deployment.Application.DownloadManager.ProcessDownloadedFile(Object sender, DownloadEventArgs e)
at System.Deployment.Application.FileDownloader.DownloadModifiedEventHandler.Invoke(Object sender, DownloadEventArgs e)
at System.Deployment.Application.FileDownloader.OnModified()
at System.Deployment.Application.SystemNetDownloader.DownloadSingleFile(DownloadQueueItem next)
at System.Deployment.Application.SystemNetDownloader.DownloadAllFiles()
at System.Deployment.Application.FileDownloader.Download(SubscriptionState subState)
at System.Deployment.Application.DownloadManager.DownloadDependencies(SubscriptionState subState, AssemblyManifest deployManifest, AssemblyManifest appManifest, Uri sourceUriBase, String targetDirectory, String group, IDownloadNotification notification, DownloadOptions options)
at System.Deployment.Application.DeploymentManager.SynchronizeCore(Boolean blocking)
at System.Deployment.Application.DeploymentManager.SynchronizeAsyncWorker()
any ideas ? | 3 |
9,582,116 | 03/06/2012 10:47:49 | 1,244,802 | 03/02/2012 10:02:31 | 1 | 0 | Confirmation about android eclipse | which type of eclipse version is suitable to work with android?
Thanks in advance
| android | eclipse | null | null | null | 03/07/2012 20:27:19 | not constructive | Confirmation about android eclipse
===
which type of eclipse version is suitable to work with android?
Thanks in advance
| 4 |
10,164,590 | 04/15/2012 17:59:35 | 242,904 | 01/04/2010 00:51:24 | 976 | 3 | Best way to write text on an image? | I am wanting to take a little calendar image and write the date and month on it. This will be displayed many times in a list view, so I am looking for the optimum way to do it.
Below works great, is there a better way:
ImageView image = (ImageView) findViewById(R.id.imageView2);
try {
// Load the png image into a bitmap
Bitmap mBitmap = BitmapFactory.decodeResource(getResources(), R.drawable.calendar_empty);
// Have to copy the bitmap so it is mutable
mBitmap = mBitmap.copy(Bitmap.Config.ARGB_8888, true);
// Create a canvas from the bitmap to draw on
Canvas canvas = new Canvas(mBitmap);
Paint paint = new Paint();
paint.setColor(Color.BLACK);
paint.setTextSize(12);
paint.setAntiAlias(true);
canvas.drawText("Sept", 11, 26, paint);
paint.setTextSize(18);
canvas.drawText("29", 14, 42, paint);
// Display the results on the screen
image.setImageDrawable(new BitmapDrawable(this.getResources(), mBitmap));
} catch (Exception e) {
e.printStackTrace ();
} | android | imageview | android-canvas | null | null | null | open | Best way to write text on an image?
===
I am wanting to take a little calendar image and write the date and month on it. This will be displayed many times in a list view, so I am looking for the optimum way to do it.
Below works great, is there a better way:
ImageView image = (ImageView) findViewById(R.id.imageView2);
try {
// Load the png image into a bitmap
Bitmap mBitmap = BitmapFactory.decodeResource(getResources(), R.drawable.calendar_empty);
// Have to copy the bitmap so it is mutable
mBitmap = mBitmap.copy(Bitmap.Config.ARGB_8888, true);
// Create a canvas from the bitmap to draw on
Canvas canvas = new Canvas(mBitmap);
Paint paint = new Paint();
paint.setColor(Color.BLACK);
paint.setTextSize(12);
paint.setAntiAlias(true);
canvas.drawText("Sept", 11, 26, paint);
paint.setTextSize(18);
canvas.drawText("29", 14, 42, paint);
// Display the results on the screen
image.setImageDrawable(new BitmapDrawable(this.getResources(), mBitmap));
} catch (Exception e) {
e.printStackTrace ();
} | 0 |
11,336,761 | 07/05/2012 00:58:47 | 1,502,640 | 07/04/2012 23:42:34 | 1 | 0 | Utility IPhone App | I want to make a IPhone an utility app and was not sure exactly which template to use. I looked at the utility template and it was very intimidating (I am somewhat new to programing apps). Which template should I use and how do I make many different views based off of buttons. One last thing I need to know how to do is how to put in a feature where the user can setup a passcode for it. Thank you so much, I know this is probably a tall order. | iphone | ios | xcode | application | null | 07/05/2012 04:49:35 | not a real question | Utility IPhone App
===
I want to make a IPhone an utility app and was not sure exactly which template to use. I looked at the utility template and it was very intimidating (I am somewhat new to programing apps). Which template should I use and how do I make many different views based off of buttons. One last thing I need to know how to do is how to put in a feature where the user can setup a passcode for it. Thank you so much, I know this is probably a tall order. | 1 |
11,550,100 | 07/18/2012 20:49:09 | 1,535,963 | 07/18/2012 19:51:34 | 3 | 0 | How can i Improve this program C++ |
int n;
int *array[9];
bool isUsed[10] = {0};
for(int i = 0; i < 9; i++)
{
cout << "Enter Number " << (i + 1) << endl;
cin >> n;
if((n >= 0) && (n <= 9))
{
if (isUsed[n] == false)
{
array[i] = new int;
*array[i] = n;
isUsed[n] = true;
}
else
{
cout << "Number has already been used." << endl;
i--;
}
}
else
{
cout << "Numbers from 0-9 only." << endl;
i--;
}
}
cout << *array[2]<<endl;
is there any way i can improve this program making simple but at the same time more efficient i mean what i did was prompt the user for 9 numbers store those numbers in 9 pointers and display the element 2.. and it seem to work just fine but i my forgetting something?? or can i improve it but keep it simply.. i'm just a beginner testing what i have learn so far...
| c++ | null | null | null | null | 07/18/2012 20:54:16 | off topic | How can i Improve this program C++
===
int n;
int *array[9];
bool isUsed[10] = {0};
for(int i = 0; i < 9; i++)
{
cout << "Enter Number " << (i + 1) << endl;
cin >> n;
if((n >= 0) && (n <= 9))
{
if (isUsed[n] == false)
{
array[i] = new int;
*array[i] = n;
isUsed[n] = true;
}
else
{
cout << "Number has already been used." << endl;
i--;
}
}
else
{
cout << "Numbers from 0-9 only." << endl;
i--;
}
}
cout << *array[2]<<endl;
is there any way i can improve this program making simple but at the same time more efficient i mean what i did was prompt the user for 9 numbers store those numbers in 9 pointers and display the element 2.. and it seem to work just fine but i my forgetting something?? or can i improve it but keep it simply.. i'm just a beginner testing what i have learn so far...
| 2 |
6,376,355 | 06/16/2011 17:53:37 | 798,565 | 06/14/2011 21:45:27 | 1 | 0 | applying css to specific li class | having a problem with my list.
I want to specify certain colors for each li element but can't seem to do it. It keeps doing it for all of them.
Here's my css:
[code]
#sub-nav-container ul
{
position:absolute;
top: 96px;
left: 594px;
margin:0;
padding: 0;
list-style-type:none;
}
#sub-nav-container li
{
margin: 0;
}
#sub-nav-container a
{
display: block;
text-decoration:none;
border-bottom: none;
color: #C1C1C1;
display:inline;
}
li.sub-navigation-home-news
{
color: #C1C1C1;
font-family: arial;
font-size: 13.5px;
text-align: center;
text-transform:uppercase;
padding: 0px 90px 0px 0px;
}
[/code]
Here's the html
[code]
<div id="sub-nav-container">
<ul id="sub-navigation-home">
<li class="sub-navigation-home-news"><a href="#">News</a></li>
<li class="sub-navigation-home-careers"><a href="#">Careers</a></li>
<li class="sub-navigation-home-client"><a href="#">Client Login</a></li>
<li class="sub-navigation-home-canada"><a href="#">CANADA</a></li>
<li class="sub-navigation-home-usa"><a href="#">USA</a></li>
</ul>
</div>
[/code] | css | list | html-lists | null | null | 06/19/2012 11:42:37 | not a real question | applying css to specific li class
===
having a problem with my list.
I want to specify certain colors for each li element but can't seem to do it. It keeps doing it for all of them.
Here's my css:
[code]
#sub-nav-container ul
{
position:absolute;
top: 96px;
left: 594px;
margin:0;
padding: 0;
list-style-type:none;
}
#sub-nav-container li
{
margin: 0;
}
#sub-nav-container a
{
display: block;
text-decoration:none;
border-bottom: none;
color: #C1C1C1;
display:inline;
}
li.sub-navigation-home-news
{
color: #C1C1C1;
font-family: arial;
font-size: 13.5px;
text-align: center;
text-transform:uppercase;
padding: 0px 90px 0px 0px;
}
[/code]
Here's the html
[code]
<div id="sub-nav-container">
<ul id="sub-navigation-home">
<li class="sub-navigation-home-news"><a href="#">News</a></li>
<li class="sub-navigation-home-careers"><a href="#">Careers</a></li>
<li class="sub-navigation-home-client"><a href="#">Client Login</a></li>
<li class="sub-navigation-home-canada"><a href="#">CANADA</a></li>
<li class="sub-navigation-home-usa"><a href="#">USA</a></li>
</ul>
</div>
[/code] | 1 |
11,504,607 | 07/16/2012 12:45:50 | 233,421 | 12/17/2009 00:41:31 | 1,580 | 0 | How can i display Title only in posts and no excerpts at all in wordpress? | How can i display Title only in posts and no excerpts at all in wordpress? I want to remove excerpts completely for all posts? Is there a plugin for this?
Thank you in advance ;-) | wordpress | wordpress-plugin | null | null | null | 07/23/2012 20:09:34 | not a real question | How can i display Title only in posts and no excerpts at all in wordpress?
===
How can i display Title only in posts and no excerpts at all in wordpress? I want to remove excerpts completely for all posts? Is there a plugin for this?
Thank you in advance ;-) | 1 |
654,318 | 03/17/2009 13:45:28 | 76,220 | 03/10/2009 16:08:11 | 50 | 6 | What knowledge should a software architect have about SharePoint? | At our company we are currenty trying to define the basic things our software architects have to know about SharePoint for them to architect and/or lead a SharePoint implementation project. Many architects in our company have a .NET developer background and know a lot about .NET development and the various framework components and tooling. However, they currently lack SharePoint knowledge. In fact they don't even want to know the nitty gritty details. They want to know just enough about it to make the right architectural decisions and apply proven patterns. If more specific knowledge is required they'll ask a SharePoint expert.
So What would is the basic set of SharePoint knowledge / skills that an architect would need to have? | sharepoint | architecture | knowledge | null | null | null | open | What knowledge should a software architect have about SharePoint?
===
At our company we are currenty trying to define the basic things our software architects have to know about SharePoint for them to architect and/or lead a SharePoint implementation project. Many architects in our company have a .NET developer background and know a lot about .NET development and the various framework components and tooling. However, they currently lack SharePoint knowledge. In fact they don't even want to know the nitty gritty details. They want to know just enough about it to make the right architectural decisions and apply proven patterns. If more specific knowledge is required they'll ask a SharePoint expert.
So What would is the basic set of SharePoint knowledge / skills that an architect would need to have? | 0 |
7,325,819 | 09/06/2011 20:35:26 | 1,301,769 | 05/30/2011 23:53:25 | 72 | 1 | Would you recommend Amazon Web Services for a WordPress site or MediaTemple? | Would you recommend Amazon Web Services for a WordPress site or should I stick with using MediaTemple?
| amazon-s3 | hosting | amazon-web-services | mediatemple | null | 09/07/2011 00:41:28 | off topic | Would you recommend Amazon Web Services for a WordPress site or MediaTemple?
===
Would you recommend Amazon Web Services for a WordPress site or should I stick with using MediaTemple?
| 2 |
4,287,129 | 11/26/2010 16:48:49 | 223,130 | 12/02/2009 18:23:07 | 1,039 | 40 | can't access my folder because of wordpress !! | i have installed my wordpress on my website and i'm using permalinks, but i have a folder called x in the main root of my website i can't access it now when i type http://mywebsite/x it redirect me to error 404 not found ... that's because wordpress is trying to fitch the story that called x in the database ..... how can i exclude that folder and its childern "folders" from wrodpress calculations ?
Thanks alot | php | wordpress | .htaccess | null | null | null | open | can't access my folder because of wordpress !!
===
i have installed my wordpress on my website and i'm using permalinks, but i have a folder called x in the main root of my website i can't access it now when i type http://mywebsite/x it redirect me to error 404 not found ... that's because wordpress is trying to fitch the story that called x in the database ..... how can i exclude that folder and its childern "folders" from wrodpress calculations ?
Thanks alot | 0 |
4,441,793 | 12/14/2010 16:52:57 | 517,335 | 11/23/2010 11:13:28 | 3 | 1 | Searching using NSOperation | I am trying to make a searchbar to search for things I receive using NSURLConnection.
right now, if I search for something, that string is send away as an URL with an asynchronous request, which gives me data.
NSURLRequest *theRequest=[NSURLRequest requestWithURL:[NSURL URLWithString:urlString] cachePolicy:NSURLRequestUseProtocolCachePolicy timeoutInterval:20.0];
[theConnection cancel];
[theConnection release];
theConnection=[[NSURLConnection alloc] initWithRequest:theRequest delegate:self];
That data is parsed and when it is successful I post a notification
-(void)connectionDidFinishLoading:(NSURLConnection *)connection
{
xmlParser = [[NSXMLParser alloc] data];
[xmlParser setDelegate:xmlGeocoder];
BOOL success = [xmlParser parse];
if(success == YES){
NSLog(@"No Errors");
[[NSNotificationCenter defaultCenter] postNotificationName:@"getArray" object:self];
}else{
NSLog(@"Error Error Error!!!");
[[NSNotificationCenter defaultCenter] postNotificationName:@"failToGetArray" object:self];
}
}
and my searchresultsTableView is reloaded.
self.array1 = [array2 copy];
[self.searchDisplayController.searchResultsTableView reloadData];
All these methods are depending on eachother, so B can't be executed, when A is still busy.
I am using NSNotificationCenter to tell them to execute those code.
But I want to try NSOperation and I have no idea HOW to implement that.
Do I have to put my search requests in an operation or every method I'm using?
Can someone give me a sample code to give me the idea how this should be done?
Thanks in advance...
| iphone | nsoperation | null | null | null | null | open | Searching using NSOperation
===
I am trying to make a searchbar to search for things I receive using NSURLConnection.
right now, if I search for something, that string is send away as an URL with an asynchronous request, which gives me data.
NSURLRequest *theRequest=[NSURLRequest requestWithURL:[NSURL URLWithString:urlString] cachePolicy:NSURLRequestUseProtocolCachePolicy timeoutInterval:20.0];
[theConnection cancel];
[theConnection release];
theConnection=[[NSURLConnection alloc] initWithRequest:theRequest delegate:self];
That data is parsed and when it is successful I post a notification
-(void)connectionDidFinishLoading:(NSURLConnection *)connection
{
xmlParser = [[NSXMLParser alloc] data];
[xmlParser setDelegate:xmlGeocoder];
BOOL success = [xmlParser parse];
if(success == YES){
NSLog(@"No Errors");
[[NSNotificationCenter defaultCenter] postNotificationName:@"getArray" object:self];
}else{
NSLog(@"Error Error Error!!!");
[[NSNotificationCenter defaultCenter] postNotificationName:@"failToGetArray" object:self];
}
}
and my searchresultsTableView is reloaded.
self.array1 = [array2 copy];
[self.searchDisplayController.searchResultsTableView reloadData];
All these methods are depending on eachother, so B can't be executed, when A is still busy.
I am using NSNotificationCenter to tell them to execute those code.
But I want to try NSOperation and I have no idea HOW to implement that.
Do I have to put my search requests in an operation or every method I'm using?
Can someone give me a sample code to give me the idea how this should be done?
Thanks in advance...
| 0 |
10,751,028 | 05/25/2012 08:26:38 | 662,017 | 03/16/2011 07:16:59 | 58 | 0 | Component based design in Java | I want to create a software for college in Java. This software will have independent components like Library Management System and Student Management System etc. Though these are different components able to sustain on their own, they should have capability to communicate with each other | java | design | components | null | null | 05/25/2012 10:40:34 | not a real question | Component based design in Java
===
I want to create a software for college in Java. This software will have independent components like Library Management System and Student Management System etc. Though these are different components able to sustain on their own, they should have capability to communicate with each other | 1 |
9,801,579 | 03/21/2012 09:15:52 | 701,502 | 04/11/2011 03:30:50 | 233 | 11 | Life Cycle / Flow control in content Provider? | Can somebody explain me the flow of control in this tutorial : http://www.vogella.de/articles/AndroidSQLite/article.html#tutorialusecp
I am not able to get the right flow. I am completely a novice to this content provider etc.
I wanted to know when does actually the DB gets created what are the lifecycle methods and what is the sequesnce of method execution in this project?
Thanks
Sneha | android | sqlite | android-contentprovider | null | null | null | open | Life Cycle / Flow control in content Provider?
===
Can somebody explain me the flow of control in this tutorial : http://www.vogella.de/articles/AndroidSQLite/article.html#tutorialusecp
I am not able to get the right flow. I am completely a novice to this content provider etc.
I wanted to know when does actually the DB gets created what are the lifecycle methods and what is the sequesnce of method execution in this project?
Thanks
Sneha | 0 |
8,520,387 | 12/15/2011 12:49:50 | 438,299 | 09/02/2010 19:00:48 | 232 | 1 | Mini BASIC IDE from C# | How could I approach this and are there any libraries out there to simplify it?
Users need to be able to write “Macros” in a VB like language which is stored in a plain text file.
These Macros are then attached to a given button in a C# App and executed when the button is clicked.
This is to be a windows forms app (could be WPF) using .net 4
I need to support popping up forms with controls on them such as text boxes, dropdown lists, labels, buttons & possibly a picture boxes too.
Basic functions like IF THEN ELSE, *, -, %, +, /, =, contains, yes no cancel message boxes…
Passing data from one script to another and getting any data returned.
I know what you are thinking tell them to install VB.net free edition! But I can’t as I need to add some bespoke functionality to extend the language also that allows communication with an in house system providing read and write to and from the system via existing COM objects.
Also the hosting c# app needs to contain many buttons each with the own script attached.
If this wasn’t bad enough the uses need to be able to write their own scripts so ideally some form of basic IDE is needed also.
Any suggestion?
| c# | winforms | vbscript | null | null | 12/15/2011 13:21:04 | not a real question | Mini BASIC IDE from C#
===
How could I approach this and are there any libraries out there to simplify it?
Users need to be able to write “Macros” in a VB like language which is stored in a plain text file.
These Macros are then attached to a given button in a C# App and executed when the button is clicked.
This is to be a windows forms app (could be WPF) using .net 4
I need to support popping up forms with controls on them such as text boxes, dropdown lists, labels, buttons & possibly a picture boxes too.
Basic functions like IF THEN ELSE, *, -, %, +, /, =, contains, yes no cancel message boxes…
Passing data from one script to another and getting any data returned.
I know what you are thinking tell them to install VB.net free edition! But I can’t as I need to add some bespoke functionality to extend the language also that allows communication with an in house system providing read and write to and from the system via existing COM objects.
Also the hosting c# app needs to contain many buttons each with the own script attached.
If this wasn’t bad enough the uses need to be able to write their own scripts so ideally some form of basic IDE is needed also.
Any suggestion?
| 1 |
4,926,693 | 02/07/2011 21:16:29 | 595,421 | 01/30/2011 00:59:01 | 21 | 0 | Fix Memory Leak Crash Log | [Link to Orignal Post][1]
[1]: http://stackoverflow.com/questions/4914853/help-fix-memory-leak-release
T h r e a d 3 C r a s h e d :
0 l i b o b j c . A . d y l i b 0 x 3 3 a 0 6 4 6 6 0 x 3 3 a 0 3 0 0 0 + 1 3 4 1 4
1 A V F o u n d a t i o n 0 x 3 1 a e 7 4 1 e 0 x 3 1 a b 8 0 0 0 + 1 9 3 5 6 6
2 l i b S y s t e m . B . d y l i b 0 x 3 1 1 6 8 6 7 8 0 x 3 1 0 9 2 0 0 0 + 8 7 8 2 0 0
3 l i b S y s t e m . B . d y l i b 0 x 3 1 1 6 8 f 6 c 0 x 3 1 0 9 2 0 0 0 + 8 8 0 4 9 2
4 l i b S y s t e m . B . d y l i b 0 x 3 1 1 6 9 1 5 c 0 x 3 1 0 9 2 0 0 0 + 8 8 0 9 8 8
5 l i b S y s t e m . B . d y l i b 0 x 3 1 1 6 8 b 9 8 0 x 3 1 0 9 2 0 0 0 + 8 7 9 5 1 2
6 l i b S y s t e m . B . d y l i b 0 x 3 1 1 0 d 2 4 a 0 x 3 1 0 9 2 0 0 0 + 5 0 4 3 9 4
7 l i b S y s t e m . B . d y l i b 0 x 3 1 1 0 5 9 7 0 0 x 3 1 0 9 2 0 0 0 + 4 7 3 4 5 6
T h r e a d 3 c r a s h e d w i t h A R M T h r e a d S t a t e :
r 0 : 0 x 0 0 1 8 2 d 5 0 r 1 : 0 x 3 1 b 2 b 2 8 c r 2 : 0 x 0 0 1 8 2 d 5 0 r 3 : 0 x 3 1 b 2 b 2 8 c
r 4 : 0 x 0 0 1 8 4 3 4 0 r 5 : 0 x 0 0 0 0 0 0 0 0 r 6 : 0 x 0 0 1 8 6 c d 0 r 7 : 0 x 2 f f e 7 f 3 c
r 8 : 0 x 3 1 b 2 b d d 8 r 9 : 0 x 0 0 1 f c 0 9 8 r 1 0 : 0 x 0 0 1 4 4 b 9 0 r 1 1 : 0 x 0 7 8 4 b 1 7 0
i p : 0 x 3 e 3 e 7 c 4 4 s p : 0 x 2 f f e 7 e e c l r : 0 x 0 0 0 0 5 8 8 1 p c : 0 x 3 3 a 0 6 4 6 6
c p s r : 0 x 2 0 0 0 0 0 3 0
B i n a r y I m a g e s :
0 x 1 0 0 0 - 0 x 7 f f f + I G o l d e n E a r s a r m v 7 < 3 6 e 8 9 3 7 9 d e f c 6 d b f 3 9 0 7 f a a a 0 6 f 0 6 b b b > / v a r / m o b i l e / A p p l i c a t i o n s / 3 D 5 5 F D A 8 - 1 6 A A - 4 3 1 7 - B 9 8 D - 4 B D 4 F B 0 0 F 2 4 B / I G o l d e n E a r s . a p p / I G o l d e n E a r s
0 x 8 7 0 0 0 - 0 x 8 8 f f f d n s . s o a r m v 7 < f c e f e c b 2 d 5 e 0 9 5 b a 8 8 1 2 7 e e c 3 a f 5 7 e c 0 > / u s r / l i b / i n f o / d n s . s o
0 x 2 f e 0 0 0 0 0 - 0 x 2 f e 2 7 f f f d y l d a r m v 7 < 0 6 e 6 9 5 9 c e b b 4 a 7 2 e 6 6 c 8 3 3 e 2 6 a e 6 4 d 2 6 > / u s r / l i b / d y l d
0 x 3 0 0 4 4 0 0 0 - 0 x 3 0 0 4 7 f f f A p p l e P u s h S e r v i c e a r m v 7 < 9 d 1 e b 7 b 1 1 f 0 f 1 4 6 c 9 4 1 e f b a b 2 c 0 5 5 6 0 6 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A p p l e P u s h S e r v i c e . f r a m e w o r k / A p p l e P u s h S e r v i c e
0 x 3 0 0 4 8 0 0 0 - 0 x 3 0 0 8 8 f f f C o r e A u d i o a r m v 7 < f 3 2 e 0 3 e e 4 c 6 8 f 0 d b 2 3 f 0 5 a f c 9 a 3 c c 9 4 c > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e A u d i o . f r a m e w o r k / C o r e A u d i o
0 x 3 0 0 8 9 0 0 0 - 0 x 3 0 0 9 2 f f f I T S y n c a r m v 7 < 8 7 d 4 0 9 5 5 3 f 9 0 e 4 1 a 0 1 a f c e 0 4 7 d c 2 e 8 f e > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / I T S y n c . f r a m e w o r k / I T S y n c
0 x 3 0 0 9 3 0 0 0 - 0 x 3 0 0 9 3 f f f v e c L i b a r m v 7 < e 5 3 d 2 3 4 e 8 0 8 c 7 7 d 2 8 6 1 6 1 0 9 5 f 9 2 c 5 8 c f > / S y s t e m / L i b r a r y / F r a m e w o r k s / A c c e l e r a t e . f r a m e w o r k / F r a m e w o r k s / v e c L i b . f r a m e w o r k / v e c L i b
0 x 3 0 0 9 4 0 0 0 - 0 x 3 0 0 9 5 f f f D a t a M i g r a t i o n a r m v 7 < b a b b c 7 2 d 4 d 4 8 3 2 5 d e 1 4 7 d 5 1 0 3 d 7 b c 0 0 d > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / D a t a M i g r a t i o n . f r a m e w o r k / D a t a M i g r a t i o n
0 x 3 0 0 9 6 0 0 0 - 0 x 3 0 0 a 9 f f f M e d i a C o n t r o l a r m v 7 < 8 7 4 e 8 3 8 9 6 4 2 4 e b b 3 a f e 5 9 a 3 a 5 9 b a 4 d f e > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M e d i a C o n t r o l . f r a m e w o r k / M e d i a C o n t r o l
0 x 3 0 0 a a 0 0 0 - 0 x 3 0 1 c a f f f C o r e G r a p h i c s a r m v 7 < 2 d 7 b 4 0 a 7 b a c a 9 1 5 c e 7 8 b 1 d d 9 a 0 d 6 4 3 3 b > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e G r a p h i c s . f r a m e w o r k / C o r e G r a p h i c s
0 x 3 0 2 0 c 0 0 0 - 0 x 3 0 2 1 2 f f f I A P a r m v 7 < 1 3 4 f 5 9 a d 5 b b 9 1 b a b 6 a 5 f e 2 1 b 6 f 3 6 d c 8 b > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / I A P . f r a m e w o r k / I A P
0 x 3 0 2 a 2 0 0 0 - 0 x 3 0 2 c b f f f M o b i l e C o r e S e r v i c e s a r m v 7 < 5 4 4 8 4 a 5 1 3 7 6 1 8 6 8 1 4 9 4 0 5 d f 7 f c 2 9 b 5 c 0 > / S y s t e m / L i b r a r y / F r a m e w o r k s / M o b i l e C o r e S e r v i c e s . f r a m e w o r k / M o b i l e C o r e S e r v i c e s
0 x 3 0 2 c e 0 0 0 - 0 x 3 0 3 e d f f f F o u n d a t i o n a r m v 7 < 8 1 d 3 6 0 4 1 f 0 4 3 1 8 c b 5 1 d b 5 a a f e d 9 c e 5 0 4 > / S y s t e m / L i b r a r y / F r a m e w o r k s / F o u n d a t i o n . f r a m e w o r k / F o u n d a t i o n
0 x 3 0 3 e e 0 0 0 - 0 x 3 0 4 d 4 f f f C o r e F o u n d a t i o n a r m v 7 < 0 1 4 4 1 e 0 1 f 5 1 4 1 a 5 0 e e 7 2 3 3 6 2 e 5 9 c a 4 0 0 > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e F o u n d a t i o n . f r a m e w o r k / C o r e F o u n d a t i o n
0 x 3 0 7 8 e 0 0 0 - 0 x 3 0 7 c d f f f l i b G L I m a g e . d y l i b a r m v 7 < a 7 c 1 1 7 c 9 2 6 0 7 a 5 1 2 8 2 3 d 3 0 7 b 8 f d d 0 1 5 1 > / S y s t e m / L i b r a r y / F r a m e w o r k s / O p e n G L E S . f r a m e w o r k / l i b G L I m a g e . d y l i b
0 x 3 0 9 e 2 0 0 0 - 0 x 3 0 9 e 5 f f f A r t w o r k C a c h e a r m v 7 < 1 e 6 5 b 5 0 0 0 a 2 2 3 4 b 6 9 1 6 4 e 7 9 0 4 f c f 8 2 6 b > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A r t w o r k C a c h e . f r a m e w o r k / A r t w o r k C a c h e
0 x 3 0 9 e 6 0 0 0 - 0 x 3 0 9 e e f f f M o b i l e B l u e t o o t h a r m v 7 < 6 d 6 c 6 2 f 5 2 2 1 9 d 2 7 b e 5 0 f 1 d 7 c 3 9 a 6 8 d c 6 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M o b i l e B l u e t o o t h . f r a m e w o r k / M o b i l e B l u e t o o t h
0 x 3 0 9 e f 0 0 0 - 0 x 3 0 a 2 2 f f f A d d r e s s B o o k a r m v 7 < 7 c 8 7 e 0 1 7 5 c 8 6 4 9 d 6 8 3 2 4 1 9 d a 8 a 1 c f a c 1 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A d d r e s s B o o k . f r a m e w o r k / A d d r e s s B o o k
0 x 3 0 a 2 3 0 0 0 - 0 x 3 0 a 4 3 f f f P r i n t K i t a r m v 7 < 0 2 a 9 c 6 f 4 1 7 3 a 0 6 7 3 c 4 6 3 7 a 3 b 5 7 0 3 4 5 c d > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / P r i n t K i t . f r a m e w o r k / P r i n t K i t
0 x 3 0 f d 5 0 0 0 - 0 x 3 1 0 8 2 f f f J a v a S c r i p t C o r e a r m v 7 < 3 f 2 d f 6 0 0 9 4 2 d c 7 2 a a d 3 1 2 b 3 c c 9 8 e c 4 7 9 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / J a v a S c r i p t C o r e . f r a m e w o r k / J a v a S c r i p t C o r e
0 x 3 1 0 9 2 0 0 0 - 0 x 3 1 1 a 3 f f f l i b S y s t e m . B . d y l i b a r m v 7 < 1 3 8 a 4 3 a b 5 2 8 b b 4 2 8 6 5 1 e 6 a a 7 a 2 a 7 2 9 3 c > / u s r / l i b / l i b S y s t e m . B . d y l i b
0 x 3 1 2 d 0 0 0 0 - 0 x 3 1 3 1 2 f f f C o r e T e l e p h o n y a r m v 7 < 9 6 d 3 a f 5 0 5 b 9 f 2 8 8 7 e 6 2 c 7 e 9 9 c 1 5 7 7 3 3 e > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e T e l e p h o n y . f r a m e w o r k / C o r e T e l e p h o n y
0 x 3 1 3 9 8 0 0 0 - 0 x 3 1 7 1 9 f f f U I K i t a r m v 7 < d e 1 c b d 3 2 1 9 a 7 4 e 4 d 4 1 b 3 0 4 2 8 f 4 2 8 e 2 2 3 > / S y s t e m / L i b r a r y / F r a m e w o r k s / U I K i t . f r a m e w o r k / U I K i t
0 x 3 1 7 2 2 0 0 0 - 0 x 3 1 7 4 a f f f S t o r e S e r v i c e s a r m v 7 < f 4 0 9 a a f 4 8 7 b d 7 e 7 a 0 8 c 7 7 b a 5 a 2 a 8 3 a 1 a > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / S t o r e S e r v i c e s . f r a m e w o r k / S t o r e S e r v i c e s
0 x 3 1 7 4 b 0 0 0 - 0 x 3 1 7 6 4 f f f l i b R I P . A . d y l i b a r m v 7 < e e 1 6 b 5 c e e 1 2 a 8 9 4 7 c 8 e 5 1 1 e d 5 1 a e 7 f e f > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e G r a p h i c s . f r a m e w o r k / R e s o u r c e s / l i b R I P . A . d y l i b
0 x 3 1 7 7 f 0 0 0 - 0 x 3 1 7 b 5 f f f C o r e T e x t a r m v 7 < b 9 b 5 c 2 1 b 2 d 2 a 2 8 a b c 4 7 8 4 2 c 7 8 c 0 2 6 d d f > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e T e x t . f r a m e w o r k / C o r e T e x t
0 x 3 1 8 0 a 0 0 0 - 0 x 3 1 8 b 3 f f f l i b x m l 2 . 2 . d y l i b a r m v 7 < b 3 d 8 2 f 8 0 a 7 7 7 c b 1 4 3 4 0 5 2 e a 2 d 2 3 2 e 3 d f > / u s r / l i b / l i b x m l 2 . 2 . d y l i b
0 x 3 1 9 2 3 0 0 0 - 0 x 3 1 9 3 8 f f f l i b r e s o l v . 9 . d y l i b a r m v 7 < e a 1 5 6 8 2 0 9 9 7 a e 9 a 2 b a f 6 6 4 d 0 f 7 9 f 1 8 d 7 > / u s r / l i b / l i b r e s o l v . 9 . d y l i b
0 x 3 1 a 0 b 0 0 0 - 0 x 3 1 a 9 e f f f I m a g e I O a r m v 7 < 5 b 5 a 2 9 4 d 4 2 5 0 e f f 8 6 6 f d b f 8 9 1 b 1 e 8 b 3 4 > / S y s t e m / L i b r a r y / F r a m e w o r k s / I m a g e I O . f r a m e w o r k / I m a g e I O
0 x 3 1 a b 8 0 0 0 - 0 x 3 1 b 3 4 f f f A V F o u n d a t i o n a r m v 7 < 4 c 7 3 5 6 c 7 9 5 e 0 1 b d 5 c 2 1 b 0 0 a 4 0 9 a 0 7 4 7 6 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A V F o u n d a t i o n . f r a m e w o r k / A V F o u n d a t i o n
0 x 3 1 b 3 5 0 0 0 - 0 x 3 1 b 3 a f f f M o b i l e K e y B a g a r m v 7 < c e c 3 f 3 2 7 1 f c 2 6 7 c 3 2 c 1 6 9 e d 0 3 e 3 1 2 d 6 3 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M o b i l e K e y B a g . f r a m e w o r k / M o b i l e K e y B a g
0 x 3 1 b b 1 0 0 0 - 0 x 3 1 c 9 a f f f A u d i o C o d e c s a r m v 7 < b e 3 1 5 c 1 e 4 9 8 2 7 1 8 4 6 0 8 1 9 f b 2 4 0 0 4 2 9 5 2 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A u d i o T o o l b o x . f r a m e w o r k / A u d i o C o d e c s
0 x 3 1 c b 5 0 0 0 - 0 x 3 1 d 5 6 f f f C e l e s t i a l a r m v 7 < b 4 1 1 f 4 6 6 2 3 8 3 e c 2 4 d b f b c d e 8 f 4 c 2 3 d 6 7 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / C e l e s t i a l . f r a m e w o r k / C e l e s t i a l
0 x 3 1 d 5 9 0 0 0 - 0 x 3 1 d 6 1 f f f l i b k x l d . d y l i b a r m v 7 < 8 5 4 e 8 2 f e 6 6 f e e f 0 1 e 5 4 c 7 c 8 a 2 0 9 8 5 1 a c > / u s r / l i b / s y s t e m / l i b k x l d . d y l i b
0 x 3 1 d 6 2 0 0 0 - 0 x 3 1 d d 1 f f f P r o o f R e a d e r a r m v 7 < d 2 e 6 2 a 8 a b 7 e 1 4 6 0 c 7 f 6 d e 8 9 1 3 c 7 0 3 e 6 d > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / P r o o f R e a d e r . f r a m e w o r k / P r o o f R e a d e r
0 x 3 1 e e 8 0 0 0 - 0 x 3 1 e f 4 f f f G r a p h i c s S e r v i c e s a r m v 7 < 0 0 9 9 6 7 0 d c c d 9 9 4 6 6 6 5 3 9 5 6 b f 9 1 8 d 6 6 7 a > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / G r a p h i c s S e r v i c e s . f r a m e w o r k / G r a p h i c s S e r v i c e s
0 x 3 1 f f 5 0 0 0 - 0 x 3 2 0 0 2 f f f l i b b s m . 0 . d y l i b a r m v 7 < 0 f 4 e 5 9 5 e 6 e b 2 1 7 0 a c e b 7 2 9 f 3 2 b 5 d e 8 c 2 > / u s r / l i b / l i b b s m . 0 . d y l i b
0 x 3 2 0 0 3 0 0 0 - 0 x 3 2 2 9 d f f f l i b L A P A C K . d y l i b a r m v 7 < 2 e 7 7 d 8 7 e 9 6 a f 9 3 8 a a c f 0 a 6 0 0 8 e 6 f b 8 9 d > / S y s t e m / L i b r a r y / F r a m e w o r k s / A c c e l e r a t e . f r a m e w o r k / F r a m e w o r k s / v e c L i b . f r a m e w o r k / l i b L A P A C K . d y l i b
0 x 3 2 2 e 7 0 0 0 - 0 x 3 2 3 1 6 f f f S y s t e m C o n f i g u r a t i o n a r m v 7 < 3 f 9 8 2 c 1 1 b 5 5 2 6 f c 3 9 a 9 2 d 5 8 5 c 6 0 d 8 a 9 0 > / S y s t e m / L i b r a r y / F r a m e w o r k s / S y s t e m C o n f i g u r a t i o n . f r a m e w o r k / S y s t e m C o n f i g u r a t i o n
0 x 3 2 3 f 9 0 0 0 - 0 x 3 2 4 2 a f f f V i d e o T o o l b o x a r m v 7 < b b 7 f f 9 0 1 4 b 1 d a b e c 2 a c c e 9 5 d 4 1 f 0 5 b 5 9 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / V i d e o T o o l b o x . f r a m e w o r k / V i d e o T o o l b o x
0 x 3 2 4 e d 0 0 0 - 0 x 3 2 5 9 c f f f W e b K i t a r m v 7 < 6 4 4 a 1 c 6 1 2 0 5 7 8 f 8 9 6 b e d 7 1 2 1 3 0 7 a a 2 a f > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / W e b K i t . f r a m e w o r k / W e b K i t
0 x 3 2 6 4 4 0 0 0 - 0 x 3 2 6 8 7 f f f M a n a g e d C o n f i g u r a t i o n a r m v 7 < 2 7 a c 7 f 0 5 4 8 2 a 8 a a 9 9 7 7 1 5 0 f 3 4 f 9 b e 6 e b > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M a n a g e d C o n f i g u r a t i o n . f r a m e w o r k / M a n a g e d C o n f i g u r a t i o n
0 x 3 2 7 8 a 0 0 0 - 0 x 3 2 7 9 d f f f l i b m i s . d y l i b a r m v 7 < 8 5 5 a e f c 2 6 3 c 6 c 2 0 e 6 c f 8 7 2 3 e a 3 6 1 2 5 a 2 > / u s r / l i b / l i b m i s . d y l i b
0 x 3 2 7 9 e 0 0 0 - 0 x 3 2 7 a 6 f f f M o b i l e W i F i a r m v 7 < b 2 9 d 4 c 5 e 3 0 0 e f 8 1 0 6 0 e 3 8 f 7 2 b b 5 8 3 c 0 2 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M o b i l e W i F i . f r a m e w o r k / M o b i l e W i F i
0 x 3 2 7 a 7 0 0 0 - 0 x 3 2 8 e 0 f f f A u d i o T o o l b o x a r m v 7 < 6 5 7 b 3 2 7 f 2 c e e e 9 f 2 2 f 9 4 7 4 f 2 f 9 b d d b e 6 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A u d i o T o o l b o x . f r a m e w o r k / A u d i o T o o l b o x
0 x 3 2 9 0 a 0 0 0 - 0 x 3 2 9 4 7 f f f C o r e M e d i a a r m v 7 < 4 e a 4 d 3 4 9 e 8 8 6 2 0 6 d 1 e c f 5 b a e 8 7 0 f 3 f 0 4 > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e M e d i a . f r a m e w o r k / C o r e M e d i a
0 x 3 2 a 1 0 0 0 0 - 0 x 3 2 a 1 2 f f f I O M o b i l e F r a m e b u f f e r a r m v 7 < 1 0 4 0 6 2 9 f 3 7 7 9 5 1 4 6 c 9 d c a c 8 a b 1 a 8 6 8 f c > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / I O M o b i l e F r a m e b u f f e r . f r a m e w o r k / I O M o b i l e F r a m e b u f f e r
0 x 3 2 a 6 8 0 0 0 - 0 x 3 2 a 7 4 f f f S p r i n g B o a r d S e r v i c e s a r m v 7 < 1 3 7 b 7 5 e 1 9 b 2 4 5 0 c 2 3 4 d e c 8 8 d 5 3 8 7 9 8 f f > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / S p r i n g B o a r d S e r v i c e s . f r a m e w o r k / S p r i n g B o a r d S e r v i c e s
0 x 3 2 a 8 8 0 0 0 - 0 x 3 2 b c 5 f f f M e d i a T o o l b o x a r m v 7 < a 1 8 b b c c 4 1 a 3 8 9 1 7 f e 0 a e 5 e 1 8 3 d 3 f 6 b 0 7 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M e d i a T o o l b o x . f r a m e w o r k / M e d i a T o o l b o x
0 x 3 2 c 8 f 0 0 0 - 0 x 3 2 c 9 3 f f f A s s e t s L i b r a r y S e r v i c e s a r m v 7 < e 8 6 1 a 3 3 0 d 1 4 7 0 2 f 1 4 8 c a 5 1 3 3 d c b e 9 5 4 c > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A s s e t s L i b r a r y S e r v i c e s . f r a m e w o r k / A s s e t s L i b r a r y S e r v i c e s
0 x 3 2 c a 7 0 0 0 - 0 x 3 2 c a 9 f f f M o b i l e I n s t a l l a t i o n a r m v 7 < 8 e 6 b 0 d 9 f 6 4 2 b e 0 6 7 2 9 f f d a a e e 9 7 0 5 3 b 0 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M o b i l e I n s t a l l a t i o n . f r a m e w o r k / M o b i l e I n s t a l l a t i o n
0 x 3 2 c a a 0 0 0 - 0 x 3 2 c b 5 f f f l i b z . 1 . d y l i b a r m v 7 < f a b a d d b c b c 8 c 0 2 b a b 0 2 6 1 d f 9 d 7 8 e 0 e 2 5 > / u s r / l i b / l i b z . 1 . d y l i b
0 x 3 2 c c b 0 0 0 - 0 x 3 2 c d 8 f f f O p e n G L E S a r m v 7 < a 1 2 5 6 5 f f b 5 b b 4 2 e 3 0 1 9 f 1 9 5 7 c d 4 9 5 1 d 0 > / S y s t e m / L i b r a r y / F r a m e w o r k s / O p e n G L E S . f r a m e w o r k / O p e n G L E S
0 x 3 2 c d a 0 0 0 - 0 x 3 2 c d f f f f l i b M o b i l e G e s t a l t . d y l i b a r m v 7 < 5 f 7 3 c 7 1 3 8 e e 1 c b 7 1 0 3 a 9 8 a e c 9 9 f 9 e d 8 8 > / u s r / l i b / l i b M o b i l e G e s t a l t . d y l i b
0 x 3 2 d 1 7 0 0 0 - 0 x 3 2 d 1 d f f f l i b l o c k d o w n . d y l i b a r m v 7 < 5 b b d 9 b 3 f 5 c f e c e 3 2 8 f 8 0 c 4 0 3 a 8 8 0 5 c e 9 > / u s r / l i b / l i b l o c k d o w n . d y l i b
0 x 3 2 d 1 e 0 0 0 - 0 x 3 2 d 6 9 f f f l i b B L A S . d y l i b a r m v 7 < 2 5 1 c 5 a c 7 3 8 0 8 0 2 a 1 6 e 3 0 d 8 2 7 c 0 2 7 c 6 3 7 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A c c e l e r a t e . f r a m e w o r k / F r a m e w o r k s / v e c L i b . f r a m e w o r k / l i b B L A S . d y l i b
0 x 3 2 d 6 a 0 0 0 - 0 x 3 2 e 1 8 f f f Q u a r t z C o r e a r m v 7 < 8 3 a 8 e 5 f 0 0 3 3 3 6 9 e 4 3 7 0 6 9 c 1 e 7 5 8 f e d 8 3 > / S y s t e m / L i b r a r y / F r a m e w o r k s / Q u a r t z C o r e . f r a m e w o r k / Q u a r t z C o r e
0 x 3 2 e 1 9 0 0 0 - 0 x 3 2 f 2 f f f f l i b i c u c o r e . A . d y l i b a r m v 7 < e 7 f b b 2 a c 5 8 6 5 6 7 e 5 7 4 d c 3 3 d 7 b b 5 c 4 d c 9 > / u s r / l i b / l i b i c u c o r e . A . d y l i b
0 x 3 2 f 5 b 0 0 0 - 0 x 3 2 f 5 e f f f C a p t i v e N e t w o r k a r m v 7 < a 2 a f 7 1 4 7 f 5 5 3 8 d 7 6 6 9 b 1 4 f a 7 b 1 9 b 5 a 7 c > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / C a p t i v e N e t w o r k . f r a m e w o r k / C a p t i v e N e t w o r k
0 x 3 2 f 5 f 0 0 0 - 0 x 3 3 0 1 e f f f C F N e t w o r k a r m v 7 < 0 2 f e 0 e 3 0 e 5 4 f f f d c b b b d 0 2 e 8 c b 8 1 2 c 3 a > / S y s t e m / L i b r a r y / F r a m e w o r k s / C F N e t w o r k . f r a m e w o r k / C F N e t w o r k
0 x 3 3 0 c 3 0 0 0 - 0 x 3 3 0 f b f f f l i b C G F r e e t y p e . A . d y l i b a r m v 7 < 3 7 4 b d 5 6 6 2 6 3 e 8 9 2 9 c 1 0 d 5 0 d 6 a 6 a 4 8 a 4 6 > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e G r a p h i c s . f r a m e w o r k / R e s o u r c e s / l i b C G F r e e t y p e . A . d y l i b
0 x 3 3 0 f d 0 0 0 - 0 x 3 3 1 0 6 f f f C o r e V i d e o a r m v 7 < 2 0 9 2 d 5 d e b 6 b 2 3 4 e 0 4 6 7 8 b 7 c 1 8 7 8 c c d 8 1 > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e V i d e o . f r a m e w o r k / C o r e V i d e o
0 x 3 3 1 4 b 0 0 0 - 0 x 3 3 1 9 5 f f f l i b s t d c + + . 6 . d y l i b a r m v 7 < 5 3 a 6 e 7 2 3 9 c 3 9 0 8 f a 8 c 2 9 1 5 b 6 5 f f 3 b 0 5 6 > / u s r / l i b / l i b s t d c + + . 6 . d y l i b
0 x 3 3 1 9 e 0 0 0 - 0 x 3 3 1 a 1 f f f I O S u r f a c e a r m v 7 < d e f f 0 2 8 8 2 1 6 6 b f 1 6 d 0 7 6 5 d 6 8 f 0 5 4 2 c c 8 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / I O S u r f a c e . f r a m e w o r k / I O S u r f a c e
0 x 3 3 1 a 2 0 0 0 - 0 x 3 3 1 a 4 f f f l i b A c c e s s i b i l i t y . d y l i b a r m v 7 < 3 f 0 b 5 8 e a 1 3 d 3 0 f 0 c d b 7 3 f 6 f f e 6 d 4 e 7 5 c > / u s r / l i b / l i b A c c e s s i b i l i t y . d y l i b
0 x 3 3 4 d b 0 0 0 - 0 x 3 3 5 2 8 f f f l i b s q l i t e 3 . d y l i b a r m v 7 < 5 5 0 3 8 e 5 c 1 d 4 d 0 d b d d 9 4 2 9 5 e 8 c a d 7 a 9 a 4 > / u s r / l i b / l i b s q l i t e 3 . d y l i b
0 x 3 3 8 9 0 0 0 0 - 0 x 3 3 8 c 2 f f f A p p S u p p o r t a r m v 7 < 4 7 c 8 0 5 5 a c 9 9 f 1 8 7 1 7 4 c a 3 7 3 b 7 0 2 f f a 6 8 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A p p S u p p o r t . f r a m e w o r k / A p p S u p p o r t
0 x 3 3 8 c 3 0 0 0 - 0 x 3 3 8 c a f f f l i b b z 2 . 1 . 0 . d y l i b a r m v 7 < 2 9 8 9 e a 7 a 5 c a d 2 c f e 9 1 b d 6 3 2 b 0 4 1 d 0 f f 4 > / u s r / l i b / l i b b z 2 . 1 . 0 . d y l i b
0 x 3 3 9 b f 0 0 0 - 0 x 3 3 9 f 9 f f f I O K i t a r m v 7 < e b 9 3 2 c c 4 2 d 6 0 e 5 5 d 9 a 4 d 0 6 9 1 b c c 3 d 9 a d > / S y s t e m / L i b r a r y / F r a m e w o r k s / I O K i t . f r a m e w o r k / V e r s i o n s / A / I O K i t
0 x 3 3 a 0 3 0 0 0 - 0 x 3 3 a c 4 f f f l i b o b j c . A . d y l i b a r m v 7 < a a f 5 6 7 1 a 3 5 f 9 a c 2 0 d 5 8 4 6 7 0 3 d a f a f 4 c 6 > / u s r / l i b / l i b o b j c . A . d y l i b
0 x 3 3 a e b 0 0 0 - 0 x 3 3 a e d f f f l i b g c c _ s . 1 . d y l i b a r m v 7 < e 6 6 7 5 8 b c d a 6 d a 5 d 7 f 9 b 5 4 f a 5 c 4 d e 6 d a 2 > / u s r / l i b / l i b g c c _ s . 1 . d y l i b
0 x 3 3 a e e 0 0 0 - 0 x 3 3 b 4 3 f f f l i b v D S P . d y l i b a r m v 7 < 9 3 6 5 f c 6 c a e 1 b f f 7 3 7 2 5 7 e 7 4 f a f 3 b 1 f 2 6 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A c c e l e r a t e . f r a m e w o r k / F r a m e w o r k s / v e c L i b . f r a m e w o r k / l i b v D S P . d y l i b
0 x 3 3 b 4 f 0 0 0 - 0 x 3 3 c 3 c f f f l i b i c o n v . 2 . d y l i b a r m v 7 < c 7 2 b 4 5 f 4 7 1 d f 0 9 2 d b d 8 4 9 0 8 1 f 7 a 3 e f 5 3 > / u s r / l i b / l i b i c o n v . 2 . d y l i b
0 x 3 5 6 2 1 0 0 0 - 0 x 3 5 6 2 1 f f f A c c e l e r a t e a r m v 7 < 2 9 d d 5 f 1 7 4 4 0 b b b 6 e 8 e 4 2 e 1 1 b 6 f c e d a 9 a > / S y s t e m / L i b r a r y / F r a m e w o r k s / A c c e l e r a t e . f r a m e w o r k / A c c e l e r a t e
0 x 3 5 6 2 5 0 0 0 - 0 x 3 5 7 1 7 f f f M u s i c L i b r a r y a r m v 7 < 3 4 e d b e e 4 2 3 a a 7 e 2 e a 3 2 a d 4 e e d 0 6 2 0 b 8 5 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M u s i c L i b r a r y . f r a m e w o r k / M u s i c L i b r a r y
0 x 3 5 7 6 d 0 0 0 - 0 x 3 5 7 7 0 f f f l i b G F X S h a r e d . d y l i b a r m v 7 < 3 a 3 8 5 e d 4 9 5 3 7 9 1 1 6 a b b e 5 0 b c 8 c d 5 a 6 1 2 > / S y s t e m / L i b r a r y / F r a m e w o r k s / O p e n G L E S . f r a m e w o r k / l i b G F X S h a r e d . d y l i b
0 x 3 5 8 3 6 0 0 0 - 0 x 3 5 9 1 e f f f l i b G L P r o g r a m m a b i l i t y . d y l i b a r m v 7 < 1 f 4 7 8 a 7 1 7 8 3 c d 7 e b 4 a e 9 e f 6 f 2 d c e a 8 0 3 > / S y s t e m / L i b r a r y / F r a m e w o r k s / O p e n G L E S . f r a m e w o r k / l i b G L P r o g r a m m a b i l i t y . d y l i b
0 x 3 5 9 3 6 0 0 0 - 0 x 3 5 a 4 5 f f f M e d i a P l a y e r a r m v 7 < 9 3 3 7 a b d 4 f d d 7 4 9 4 7 3 e f a e f e 6 4 e e 6 4 9 a 0 > / S y s t e m / L i b r a r y / F r a m e w o r k s / M e d i a P l a y e r . f r a m e w o r k / M e d i a P l a y e r
0 x 3 5 a 4 6 0 0 0 - 0 x 3 5 a 4 8 f f f C r a s h R e p o r t e r S u p p o r t a r m v 7 < 3 0 a 5 f 1 e d c d b 9 f f e 8 6 8 a 6 2 0 1 9 9 a 4 c b e 1 2 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / C r a s h R e p o r t e r S u p p o r t . f r a m e w o r k / C r a s h R e p o r t e r S u p p o r t
0 x 3 5 a 4 9 0 0 0 - 0 x 3 5 a 5 3 f f f A c c o u n t S e t t i n g s a r m v 7 < 1 9 c 7 9 f 8 1 d 5 d 5 5 f e 2 e 6 b 6 1 8 f c d c 2 8 2 5 8 e > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A c c o u n t S e t t i n g s . f r a m e w o r k / A c c o u n t S e t t i n g s
0 x 3 5 a 5 e 0 0 0 - 0 x 3 5 a 5 f f f f C o r e S u r f a c e a r m v 7 < f 7 c a a f 4 3 6 0 9 c f e 0 e 4 7 5 d f e 8 3 7 9 0 e d b 4 d > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / C o r e S u r f a c e . f r a m e w o r k / C o r e S u r f a c e
0 x 3 5 a 6 4 0 0 0 - 0 x 3 5 a 7 a f f f E A P 8 0 2 1 X a r m v 7 < 3 6 6 5 9 e c 2 b 9 d e f 7 b 5 7 9 8 a 0 5 3 2 7 e 3 6 9 2 4 7 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / E A P 8 0 2 1 X . f r a m e w o r k / E A P 8 0 2 1 X
0 x 3 5 a 7 b 0 0 0 - 0 x 3 6 0 6 3 f f f W e b C o r e a r m v 7 < d 6 b d 9 c f 8 8 e e 8 2 a b 6 b 0 e 3 3 e 0 a e 1 1 9 0 7 7 2 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / W e b C o r e . f r a m e w o r k / W e b C o r e
0 x 3 6 0 6 4 0 0 0 - 0 x 3 6 0 8 3 f f f B o m a r m v 7 < 0 f 5 f d 6 0 5 7 b a d 5 e 1 6 7 7 8 6 9 5 0 0 d 6 3 6 8 2 1 f > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / B o m . f r a m e w o r k / B o m
0 x 3 6 0 8 d 0 0 0 - 0 x 3 6 0 9 4 f f f A g g r e g a t e D i c t i o n a r y a r m v 7 < 7 1 3 7 2 c 9 5 d 4 a f 7 a f 7 8 7 d 0 6 8 2 a 9 3 9 e 4 0 a c > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A g g r e g a t e D i c t i o n a r y . f r a m e w o r k / A g g r e g a t e D i c t i o n a r y
0 x 3 6 1 2 e 0 0 0 - 0 x 3 6 1 4 0 f f f P e r s i s t e n t C o n n e c t i o n a r m v 7 < c d 2 a 6 9 9 a a 5 0 3 6 b d a d 0 5 1 7 6 0 3 b a 4 d b 8 3 9 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / P e r s i s t e n t C o n n e c t i o n . f r a m e w o r k / P e r s i s t e n t C o n n e c t i o n
0 x 3 6 1 4 1 0 0 0 - 0 x 3 6 1 7 8 f f f S e c u r i t y a r m v 7 < c d 2 8 e 1 0 2 9 5 0 6 3 4 a e 7 1 6 7 d d e e 9 c 6 8 6 d 3 6 > / S y s t e m / L i b r a r y / F r a m e w o r k s / S e c u r i t y . f r a m e w o r k / S e c u r i t y
| iphone | xcode | crash-reports | null | null | 02/07/2011 23:23:37 | not a real question | Fix Memory Leak Crash Log
===
[Link to Orignal Post][1]
[1]: http://stackoverflow.com/questions/4914853/help-fix-memory-leak-release
T h r e a d 3 C r a s h e d :
0 l i b o b j c . A . d y l i b 0 x 3 3 a 0 6 4 6 6 0 x 3 3 a 0 3 0 0 0 + 1 3 4 1 4
1 A V F o u n d a t i o n 0 x 3 1 a e 7 4 1 e 0 x 3 1 a b 8 0 0 0 + 1 9 3 5 6 6
2 l i b S y s t e m . B . d y l i b 0 x 3 1 1 6 8 6 7 8 0 x 3 1 0 9 2 0 0 0 + 8 7 8 2 0 0
3 l i b S y s t e m . B . d y l i b 0 x 3 1 1 6 8 f 6 c 0 x 3 1 0 9 2 0 0 0 + 8 8 0 4 9 2
4 l i b S y s t e m . B . d y l i b 0 x 3 1 1 6 9 1 5 c 0 x 3 1 0 9 2 0 0 0 + 8 8 0 9 8 8
5 l i b S y s t e m . B . d y l i b 0 x 3 1 1 6 8 b 9 8 0 x 3 1 0 9 2 0 0 0 + 8 7 9 5 1 2
6 l i b S y s t e m . B . d y l i b 0 x 3 1 1 0 d 2 4 a 0 x 3 1 0 9 2 0 0 0 + 5 0 4 3 9 4
7 l i b S y s t e m . B . d y l i b 0 x 3 1 1 0 5 9 7 0 0 x 3 1 0 9 2 0 0 0 + 4 7 3 4 5 6
T h r e a d 3 c r a s h e d w i t h A R M T h r e a d S t a t e :
r 0 : 0 x 0 0 1 8 2 d 5 0 r 1 : 0 x 3 1 b 2 b 2 8 c r 2 : 0 x 0 0 1 8 2 d 5 0 r 3 : 0 x 3 1 b 2 b 2 8 c
r 4 : 0 x 0 0 1 8 4 3 4 0 r 5 : 0 x 0 0 0 0 0 0 0 0 r 6 : 0 x 0 0 1 8 6 c d 0 r 7 : 0 x 2 f f e 7 f 3 c
r 8 : 0 x 3 1 b 2 b d d 8 r 9 : 0 x 0 0 1 f c 0 9 8 r 1 0 : 0 x 0 0 1 4 4 b 9 0 r 1 1 : 0 x 0 7 8 4 b 1 7 0
i p : 0 x 3 e 3 e 7 c 4 4 s p : 0 x 2 f f e 7 e e c l r : 0 x 0 0 0 0 5 8 8 1 p c : 0 x 3 3 a 0 6 4 6 6
c p s r : 0 x 2 0 0 0 0 0 3 0
B i n a r y I m a g e s :
0 x 1 0 0 0 - 0 x 7 f f f + I G o l d e n E a r s a r m v 7 < 3 6 e 8 9 3 7 9 d e f c 6 d b f 3 9 0 7 f a a a 0 6 f 0 6 b b b > / v a r / m o b i l e / A p p l i c a t i o n s / 3 D 5 5 F D A 8 - 1 6 A A - 4 3 1 7 - B 9 8 D - 4 B D 4 F B 0 0 F 2 4 B / I G o l d e n E a r s . a p p / I G o l d e n E a r s
0 x 8 7 0 0 0 - 0 x 8 8 f f f d n s . s o a r m v 7 < f c e f e c b 2 d 5 e 0 9 5 b a 8 8 1 2 7 e e c 3 a f 5 7 e c 0 > / u s r / l i b / i n f o / d n s . s o
0 x 2 f e 0 0 0 0 0 - 0 x 2 f e 2 7 f f f d y l d a r m v 7 < 0 6 e 6 9 5 9 c e b b 4 a 7 2 e 6 6 c 8 3 3 e 2 6 a e 6 4 d 2 6 > / u s r / l i b / d y l d
0 x 3 0 0 4 4 0 0 0 - 0 x 3 0 0 4 7 f f f A p p l e P u s h S e r v i c e a r m v 7 < 9 d 1 e b 7 b 1 1 f 0 f 1 4 6 c 9 4 1 e f b a b 2 c 0 5 5 6 0 6 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A p p l e P u s h S e r v i c e . f r a m e w o r k / A p p l e P u s h S e r v i c e
0 x 3 0 0 4 8 0 0 0 - 0 x 3 0 0 8 8 f f f C o r e A u d i o a r m v 7 < f 3 2 e 0 3 e e 4 c 6 8 f 0 d b 2 3 f 0 5 a f c 9 a 3 c c 9 4 c > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e A u d i o . f r a m e w o r k / C o r e A u d i o
0 x 3 0 0 8 9 0 0 0 - 0 x 3 0 0 9 2 f f f I T S y n c a r m v 7 < 8 7 d 4 0 9 5 5 3 f 9 0 e 4 1 a 0 1 a f c e 0 4 7 d c 2 e 8 f e > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / I T S y n c . f r a m e w o r k / I T S y n c
0 x 3 0 0 9 3 0 0 0 - 0 x 3 0 0 9 3 f f f v e c L i b a r m v 7 < e 5 3 d 2 3 4 e 8 0 8 c 7 7 d 2 8 6 1 6 1 0 9 5 f 9 2 c 5 8 c f > / S y s t e m / L i b r a r y / F r a m e w o r k s / A c c e l e r a t e . f r a m e w o r k / F r a m e w o r k s / v e c L i b . f r a m e w o r k / v e c L i b
0 x 3 0 0 9 4 0 0 0 - 0 x 3 0 0 9 5 f f f D a t a M i g r a t i o n a r m v 7 < b a b b c 7 2 d 4 d 4 8 3 2 5 d e 1 4 7 d 5 1 0 3 d 7 b c 0 0 d > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / D a t a M i g r a t i o n . f r a m e w o r k / D a t a M i g r a t i o n
0 x 3 0 0 9 6 0 0 0 - 0 x 3 0 0 a 9 f f f M e d i a C o n t r o l a r m v 7 < 8 7 4 e 8 3 8 9 6 4 2 4 e b b 3 a f e 5 9 a 3 a 5 9 b a 4 d f e > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M e d i a C o n t r o l . f r a m e w o r k / M e d i a C o n t r o l
0 x 3 0 0 a a 0 0 0 - 0 x 3 0 1 c a f f f C o r e G r a p h i c s a r m v 7 < 2 d 7 b 4 0 a 7 b a c a 9 1 5 c e 7 8 b 1 d d 9 a 0 d 6 4 3 3 b > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e G r a p h i c s . f r a m e w o r k / C o r e G r a p h i c s
0 x 3 0 2 0 c 0 0 0 - 0 x 3 0 2 1 2 f f f I A P a r m v 7 < 1 3 4 f 5 9 a d 5 b b 9 1 b a b 6 a 5 f e 2 1 b 6 f 3 6 d c 8 b > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / I A P . f r a m e w o r k / I A P
0 x 3 0 2 a 2 0 0 0 - 0 x 3 0 2 c b f f f M o b i l e C o r e S e r v i c e s a r m v 7 < 5 4 4 8 4 a 5 1 3 7 6 1 8 6 8 1 4 9 4 0 5 d f 7 f c 2 9 b 5 c 0 > / S y s t e m / L i b r a r y / F r a m e w o r k s / M o b i l e C o r e S e r v i c e s . f r a m e w o r k / M o b i l e C o r e S e r v i c e s
0 x 3 0 2 c e 0 0 0 - 0 x 3 0 3 e d f f f F o u n d a t i o n a r m v 7 < 8 1 d 3 6 0 4 1 f 0 4 3 1 8 c b 5 1 d b 5 a a f e d 9 c e 5 0 4 > / S y s t e m / L i b r a r y / F r a m e w o r k s / F o u n d a t i o n . f r a m e w o r k / F o u n d a t i o n
0 x 3 0 3 e e 0 0 0 - 0 x 3 0 4 d 4 f f f C o r e F o u n d a t i o n a r m v 7 < 0 1 4 4 1 e 0 1 f 5 1 4 1 a 5 0 e e 7 2 3 3 6 2 e 5 9 c a 4 0 0 > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e F o u n d a t i o n . f r a m e w o r k / C o r e F o u n d a t i o n
0 x 3 0 7 8 e 0 0 0 - 0 x 3 0 7 c d f f f l i b G L I m a g e . d y l i b a r m v 7 < a 7 c 1 1 7 c 9 2 6 0 7 a 5 1 2 8 2 3 d 3 0 7 b 8 f d d 0 1 5 1 > / S y s t e m / L i b r a r y / F r a m e w o r k s / O p e n G L E S . f r a m e w o r k / l i b G L I m a g e . d y l i b
0 x 3 0 9 e 2 0 0 0 - 0 x 3 0 9 e 5 f f f A r t w o r k C a c h e a r m v 7 < 1 e 6 5 b 5 0 0 0 a 2 2 3 4 b 6 9 1 6 4 e 7 9 0 4 f c f 8 2 6 b > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A r t w o r k C a c h e . f r a m e w o r k / A r t w o r k C a c h e
0 x 3 0 9 e 6 0 0 0 - 0 x 3 0 9 e e f f f M o b i l e B l u e t o o t h a r m v 7 < 6 d 6 c 6 2 f 5 2 2 1 9 d 2 7 b e 5 0 f 1 d 7 c 3 9 a 6 8 d c 6 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M o b i l e B l u e t o o t h . f r a m e w o r k / M o b i l e B l u e t o o t h
0 x 3 0 9 e f 0 0 0 - 0 x 3 0 a 2 2 f f f A d d r e s s B o o k a r m v 7 < 7 c 8 7 e 0 1 7 5 c 8 6 4 9 d 6 8 3 2 4 1 9 d a 8 a 1 c f a c 1 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A d d r e s s B o o k . f r a m e w o r k / A d d r e s s B o o k
0 x 3 0 a 2 3 0 0 0 - 0 x 3 0 a 4 3 f f f P r i n t K i t a r m v 7 < 0 2 a 9 c 6 f 4 1 7 3 a 0 6 7 3 c 4 6 3 7 a 3 b 5 7 0 3 4 5 c d > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / P r i n t K i t . f r a m e w o r k / P r i n t K i t
0 x 3 0 f d 5 0 0 0 - 0 x 3 1 0 8 2 f f f J a v a S c r i p t C o r e a r m v 7 < 3 f 2 d f 6 0 0 9 4 2 d c 7 2 a a d 3 1 2 b 3 c c 9 8 e c 4 7 9 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / J a v a S c r i p t C o r e . f r a m e w o r k / J a v a S c r i p t C o r e
0 x 3 1 0 9 2 0 0 0 - 0 x 3 1 1 a 3 f f f l i b S y s t e m . B . d y l i b a r m v 7 < 1 3 8 a 4 3 a b 5 2 8 b b 4 2 8 6 5 1 e 6 a a 7 a 2 a 7 2 9 3 c > / u s r / l i b / l i b S y s t e m . B . d y l i b
0 x 3 1 2 d 0 0 0 0 - 0 x 3 1 3 1 2 f f f C o r e T e l e p h o n y a r m v 7 < 9 6 d 3 a f 5 0 5 b 9 f 2 8 8 7 e 6 2 c 7 e 9 9 c 1 5 7 7 3 3 e > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e T e l e p h o n y . f r a m e w o r k / C o r e T e l e p h o n y
0 x 3 1 3 9 8 0 0 0 - 0 x 3 1 7 1 9 f f f U I K i t a r m v 7 < d e 1 c b d 3 2 1 9 a 7 4 e 4 d 4 1 b 3 0 4 2 8 f 4 2 8 e 2 2 3 > / S y s t e m / L i b r a r y / F r a m e w o r k s / U I K i t . f r a m e w o r k / U I K i t
0 x 3 1 7 2 2 0 0 0 - 0 x 3 1 7 4 a f f f S t o r e S e r v i c e s a r m v 7 < f 4 0 9 a a f 4 8 7 b d 7 e 7 a 0 8 c 7 7 b a 5 a 2 a 8 3 a 1 a > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / S t o r e S e r v i c e s . f r a m e w o r k / S t o r e S e r v i c e s
0 x 3 1 7 4 b 0 0 0 - 0 x 3 1 7 6 4 f f f l i b R I P . A . d y l i b a r m v 7 < e e 1 6 b 5 c e e 1 2 a 8 9 4 7 c 8 e 5 1 1 e d 5 1 a e 7 f e f > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e G r a p h i c s . f r a m e w o r k / R e s o u r c e s / l i b R I P . A . d y l i b
0 x 3 1 7 7 f 0 0 0 - 0 x 3 1 7 b 5 f f f C o r e T e x t a r m v 7 < b 9 b 5 c 2 1 b 2 d 2 a 2 8 a b c 4 7 8 4 2 c 7 8 c 0 2 6 d d f > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e T e x t . f r a m e w o r k / C o r e T e x t
0 x 3 1 8 0 a 0 0 0 - 0 x 3 1 8 b 3 f f f l i b x m l 2 . 2 . d y l i b a r m v 7 < b 3 d 8 2 f 8 0 a 7 7 7 c b 1 4 3 4 0 5 2 e a 2 d 2 3 2 e 3 d f > / u s r / l i b / l i b x m l 2 . 2 . d y l i b
0 x 3 1 9 2 3 0 0 0 - 0 x 3 1 9 3 8 f f f l i b r e s o l v . 9 . d y l i b a r m v 7 < e a 1 5 6 8 2 0 9 9 7 a e 9 a 2 b a f 6 6 4 d 0 f 7 9 f 1 8 d 7 > / u s r / l i b / l i b r e s o l v . 9 . d y l i b
0 x 3 1 a 0 b 0 0 0 - 0 x 3 1 a 9 e f f f I m a g e I O a r m v 7 < 5 b 5 a 2 9 4 d 4 2 5 0 e f f 8 6 6 f d b f 8 9 1 b 1 e 8 b 3 4 > / S y s t e m / L i b r a r y / F r a m e w o r k s / I m a g e I O . f r a m e w o r k / I m a g e I O
0 x 3 1 a b 8 0 0 0 - 0 x 3 1 b 3 4 f f f A V F o u n d a t i o n a r m v 7 < 4 c 7 3 5 6 c 7 9 5 e 0 1 b d 5 c 2 1 b 0 0 a 4 0 9 a 0 7 4 7 6 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A V F o u n d a t i o n . f r a m e w o r k / A V F o u n d a t i o n
0 x 3 1 b 3 5 0 0 0 - 0 x 3 1 b 3 a f f f M o b i l e K e y B a g a r m v 7 < c e c 3 f 3 2 7 1 f c 2 6 7 c 3 2 c 1 6 9 e d 0 3 e 3 1 2 d 6 3 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M o b i l e K e y B a g . f r a m e w o r k / M o b i l e K e y B a g
0 x 3 1 b b 1 0 0 0 - 0 x 3 1 c 9 a f f f A u d i o C o d e c s a r m v 7 < b e 3 1 5 c 1 e 4 9 8 2 7 1 8 4 6 0 8 1 9 f b 2 4 0 0 4 2 9 5 2 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A u d i o T o o l b o x . f r a m e w o r k / A u d i o C o d e c s
0 x 3 1 c b 5 0 0 0 - 0 x 3 1 d 5 6 f f f C e l e s t i a l a r m v 7 < b 4 1 1 f 4 6 6 2 3 8 3 e c 2 4 d b f b c d e 8 f 4 c 2 3 d 6 7 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / C e l e s t i a l . f r a m e w o r k / C e l e s t i a l
0 x 3 1 d 5 9 0 0 0 - 0 x 3 1 d 6 1 f f f l i b k x l d . d y l i b a r m v 7 < 8 5 4 e 8 2 f e 6 6 f e e f 0 1 e 5 4 c 7 c 8 a 2 0 9 8 5 1 a c > / u s r / l i b / s y s t e m / l i b k x l d . d y l i b
0 x 3 1 d 6 2 0 0 0 - 0 x 3 1 d d 1 f f f P r o o f R e a d e r a r m v 7 < d 2 e 6 2 a 8 a b 7 e 1 4 6 0 c 7 f 6 d e 8 9 1 3 c 7 0 3 e 6 d > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / P r o o f R e a d e r . f r a m e w o r k / P r o o f R e a d e r
0 x 3 1 e e 8 0 0 0 - 0 x 3 1 e f 4 f f f G r a p h i c s S e r v i c e s a r m v 7 < 0 0 9 9 6 7 0 d c c d 9 9 4 6 6 6 5 3 9 5 6 b f 9 1 8 d 6 6 7 a > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / G r a p h i c s S e r v i c e s . f r a m e w o r k / G r a p h i c s S e r v i c e s
0 x 3 1 f f 5 0 0 0 - 0 x 3 2 0 0 2 f f f l i b b s m . 0 . d y l i b a r m v 7 < 0 f 4 e 5 9 5 e 6 e b 2 1 7 0 a c e b 7 2 9 f 3 2 b 5 d e 8 c 2 > / u s r / l i b / l i b b s m . 0 . d y l i b
0 x 3 2 0 0 3 0 0 0 - 0 x 3 2 2 9 d f f f l i b L A P A C K . d y l i b a r m v 7 < 2 e 7 7 d 8 7 e 9 6 a f 9 3 8 a a c f 0 a 6 0 0 8 e 6 f b 8 9 d > / S y s t e m / L i b r a r y / F r a m e w o r k s / A c c e l e r a t e . f r a m e w o r k / F r a m e w o r k s / v e c L i b . f r a m e w o r k / l i b L A P A C K . d y l i b
0 x 3 2 2 e 7 0 0 0 - 0 x 3 2 3 1 6 f f f S y s t e m C o n f i g u r a t i o n a r m v 7 < 3 f 9 8 2 c 1 1 b 5 5 2 6 f c 3 9 a 9 2 d 5 8 5 c 6 0 d 8 a 9 0 > / S y s t e m / L i b r a r y / F r a m e w o r k s / S y s t e m C o n f i g u r a t i o n . f r a m e w o r k / S y s t e m C o n f i g u r a t i o n
0 x 3 2 3 f 9 0 0 0 - 0 x 3 2 4 2 a f f f V i d e o T o o l b o x a r m v 7 < b b 7 f f 9 0 1 4 b 1 d a b e c 2 a c c e 9 5 d 4 1 f 0 5 b 5 9 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / V i d e o T o o l b o x . f r a m e w o r k / V i d e o T o o l b o x
0 x 3 2 4 e d 0 0 0 - 0 x 3 2 5 9 c f f f W e b K i t a r m v 7 < 6 4 4 a 1 c 6 1 2 0 5 7 8 f 8 9 6 b e d 7 1 2 1 3 0 7 a a 2 a f > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / W e b K i t . f r a m e w o r k / W e b K i t
0 x 3 2 6 4 4 0 0 0 - 0 x 3 2 6 8 7 f f f M a n a g e d C o n f i g u r a t i o n a r m v 7 < 2 7 a c 7 f 0 5 4 8 2 a 8 a a 9 9 7 7 1 5 0 f 3 4 f 9 b e 6 e b > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M a n a g e d C o n f i g u r a t i o n . f r a m e w o r k / M a n a g e d C o n f i g u r a t i o n
0 x 3 2 7 8 a 0 0 0 - 0 x 3 2 7 9 d f f f l i b m i s . d y l i b a r m v 7 < 8 5 5 a e f c 2 6 3 c 6 c 2 0 e 6 c f 8 7 2 3 e a 3 6 1 2 5 a 2 > / u s r / l i b / l i b m i s . d y l i b
0 x 3 2 7 9 e 0 0 0 - 0 x 3 2 7 a 6 f f f M o b i l e W i F i a r m v 7 < b 2 9 d 4 c 5 e 3 0 0 e f 8 1 0 6 0 e 3 8 f 7 2 b b 5 8 3 c 0 2 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M o b i l e W i F i . f r a m e w o r k / M o b i l e W i F i
0 x 3 2 7 a 7 0 0 0 - 0 x 3 2 8 e 0 f f f A u d i o T o o l b o x a r m v 7 < 6 5 7 b 3 2 7 f 2 c e e e 9 f 2 2 f 9 4 7 4 f 2 f 9 b d d b e 6 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A u d i o T o o l b o x . f r a m e w o r k / A u d i o T o o l b o x
0 x 3 2 9 0 a 0 0 0 - 0 x 3 2 9 4 7 f f f C o r e M e d i a a r m v 7 < 4 e a 4 d 3 4 9 e 8 8 6 2 0 6 d 1 e c f 5 b a e 8 7 0 f 3 f 0 4 > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e M e d i a . f r a m e w o r k / C o r e M e d i a
0 x 3 2 a 1 0 0 0 0 - 0 x 3 2 a 1 2 f f f I O M o b i l e F r a m e b u f f e r a r m v 7 < 1 0 4 0 6 2 9 f 3 7 7 9 5 1 4 6 c 9 d c a c 8 a b 1 a 8 6 8 f c > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / I O M o b i l e F r a m e b u f f e r . f r a m e w o r k / I O M o b i l e F r a m e b u f f e r
0 x 3 2 a 6 8 0 0 0 - 0 x 3 2 a 7 4 f f f S p r i n g B o a r d S e r v i c e s a r m v 7 < 1 3 7 b 7 5 e 1 9 b 2 4 5 0 c 2 3 4 d e c 8 8 d 5 3 8 7 9 8 f f > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / S p r i n g B o a r d S e r v i c e s . f r a m e w o r k / S p r i n g B o a r d S e r v i c e s
0 x 3 2 a 8 8 0 0 0 - 0 x 3 2 b c 5 f f f M e d i a T o o l b o x a r m v 7 < a 1 8 b b c c 4 1 a 3 8 9 1 7 f e 0 a e 5 e 1 8 3 d 3 f 6 b 0 7 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M e d i a T o o l b o x . f r a m e w o r k / M e d i a T o o l b o x
0 x 3 2 c 8 f 0 0 0 - 0 x 3 2 c 9 3 f f f A s s e t s L i b r a r y S e r v i c e s a r m v 7 < e 8 6 1 a 3 3 0 d 1 4 7 0 2 f 1 4 8 c a 5 1 3 3 d c b e 9 5 4 c > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A s s e t s L i b r a r y S e r v i c e s . f r a m e w o r k / A s s e t s L i b r a r y S e r v i c e s
0 x 3 2 c a 7 0 0 0 - 0 x 3 2 c a 9 f f f M o b i l e I n s t a l l a t i o n a r m v 7 < 8 e 6 b 0 d 9 f 6 4 2 b e 0 6 7 2 9 f f d a a e e 9 7 0 5 3 b 0 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M o b i l e I n s t a l l a t i o n . f r a m e w o r k / M o b i l e I n s t a l l a t i o n
0 x 3 2 c a a 0 0 0 - 0 x 3 2 c b 5 f f f l i b z . 1 . d y l i b a r m v 7 < f a b a d d b c b c 8 c 0 2 b a b 0 2 6 1 d f 9 d 7 8 e 0 e 2 5 > / u s r / l i b / l i b z . 1 . d y l i b
0 x 3 2 c c b 0 0 0 - 0 x 3 2 c d 8 f f f O p e n G L E S a r m v 7 < a 1 2 5 6 5 f f b 5 b b 4 2 e 3 0 1 9 f 1 9 5 7 c d 4 9 5 1 d 0 > / S y s t e m / L i b r a r y / F r a m e w o r k s / O p e n G L E S . f r a m e w o r k / O p e n G L E S
0 x 3 2 c d a 0 0 0 - 0 x 3 2 c d f f f f l i b M o b i l e G e s t a l t . d y l i b a r m v 7 < 5 f 7 3 c 7 1 3 8 e e 1 c b 7 1 0 3 a 9 8 a e c 9 9 f 9 e d 8 8 > / u s r / l i b / l i b M o b i l e G e s t a l t . d y l i b
0 x 3 2 d 1 7 0 0 0 - 0 x 3 2 d 1 d f f f l i b l o c k d o w n . d y l i b a r m v 7 < 5 b b d 9 b 3 f 5 c f e c e 3 2 8 f 8 0 c 4 0 3 a 8 8 0 5 c e 9 > / u s r / l i b / l i b l o c k d o w n . d y l i b
0 x 3 2 d 1 e 0 0 0 - 0 x 3 2 d 6 9 f f f l i b B L A S . d y l i b a r m v 7 < 2 5 1 c 5 a c 7 3 8 0 8 0 2 a 1 6 e 3 0 d 8 2 7 c 0 2 7 c 6 3 7 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A c c e l e r a t e . f r a m e w o r k / F r a m e w o r k s / v e c L i b . f r a m e w o r k / l i b B L A S . d y l i b
0 x 3 2 d 6 a 0 0 0 - 0 x 3 2 e 1 8 f f f Q u a r t z C o r e a r m v 7 < 8 3 a 8 e 5 f 0 0 3 3 3 6 9 e 4 3 7 0 6 9 c 1 e 7 5 8 f e d 8 3 > / S y s t e m / L i b r a r y / F r a m e w o r k s / Q u a r t z C o r e . f r a m e w o r k / Q u a r t z C o r e
0 x 3 2 e 1 9 0 0 0 - 0 x 3 2 f 2 f f f f l i b i c u c o r e . A . d y l i b a r m v 7 < e 7 f b b 2 a c 5 8 6 5 6 7 e 5 7 4 d c 3 3 d 7 b b 5 c 4 d c 9 > / u s r / l i b / l i b i c u c o r e . A . d y l i b
0 x 3 2 f 5 b 0 0 0 - 0 x 3 2 f 5 e f f f C a p t i v e N e t w o r k a r m v 7 < a 2 a f 7 1 4 7 f 5 5 3 8 d 7 6 6 9 b 1 4 f a 7 b 1 9 b 5 a 7 c > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / C a p t i v e N e t w o r k . f r a m e w o r k / C a p t i v e N e t w o r k
0 x 3 2 f 5 f 0 0 0 - 0 x 3 3 0 1 e f f f C F N e t w o r k a r m v 7 < 0 2 f e 0 e 3 0 e 5 4 f f f d c b b b d 0 2 e 8 c b 8 1 2 c 3 a > / S y s t e m / L i b r a r y / F r a m e w o r k s / C F N e t w o r k . f r a m e w o r k / C F N e t w o r k
0 x 3 3 0 c 3 0 0 0 - 0 x 3 3 0 f b f f f l i b C G F r e e t y p e . A . d y l i b a r m v 7 < 3 7 4 b d 5 6 6 2 6 3 e 8 9 2 9 c 1 0 d 5 0 d 6 a 6 a 4 8 a 4 6 > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e G r a p h i c s . f r a m e w o r k / R e s o u r c e s / l i b C G F r e e t y p e . A . d y l i b
0 x 3 3 0 f d 0 0 0 - 0 x 3 3 1 0 6 f f f C o r e V i d e o a r m v 7 < 2 0 9 2 d 5 d e b 6 b 2 3 4 e 0 4 6 7 8 b 7 c 1 8 7 8 c c d 8 1 > / S y s t e m / L i b r a r y / F r a m e w o r k s / C o r e V i d e o . f r a m e w o r k / C o r e V i d e o
0 x 3 3 1 4 b 0 0 0 - 0 x 3 3 1 9 5 f f f l i b s t d c + + . 6 . d y l i b a r m v 7 < 5 3 a 6 e 7 2 3 9 c 3 9 0 8 f a 8 c 2 9 1 5 b 6 5 f f 3 b 0 5 6 > / u s r / l i b / l i b s t d c + + . 6 . d y l i b
0 x 3 3 1 9 e 0 0 0 - 0 x 3 3 1 a 1 f f f I O S u r f a c e a r m v 7 < d e f f 0 2 8 8 2 1 6 6 b f 1 6 d 0 7 6 5 d 6 8 f 0 5 4 2 c c 8 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / I O S u r f a c e . f r a m e w o r k / I O S u r f a c e
0 x 3 3 1 a 2 0 0 0 - 0 x 3 3 1 a 4 f f f l i b A c c e s s i b i l i t y . d y l i b a r m v 7 < 3 f 0 b 5 8 e a 1 3 d 3 0 f 0 c d b 7 3 f 6 f f e 6 d 4 e 7 5 c > / u s r / l i b / l i b A c c e s s i b i l i t y . d y l i b
0 x 3 3 4 d b 0 0 0 - 0 x 3 3 5 2 8 f f f l i b s q l i t e 3 . d y l i b a r m v 7 < 5 5 0 3 8 e 5 c 1 d 4 d 0 d b d d 9 4 2 9 5 e 8 c a d 7 a 9 a 4 > / u s r / l i b / l i b s q l i t e 3 . d y l i b
0 x 3 3 8 9 0 0 0 0 - 0 x 3 3 8 c 2 f f f A p p S u p p o r t a r m v 7 < 4 7 c 8 0 5 5 a c 9 9 f 1 8 7 1 7 4 c a 3 7 3 b 7 0 2 f f a 6 8 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A p p S u p p o r t . f r a m e w o r k / A p p S u p p o r t
0 x 3 3 8 c 3 0 0 0 - 0 x 3 3 8 c a f f f l i b b z 2 . 1 . 0 . d y l i b a r m v 7 < 2 9 8 9 e a 7 a 5 c a d 2 c f e 9 1 b d 6 3 2 b 0 4 1 d 0 f f 4 > / u s r / l i b / l i b b z 2 . 1 . 0 . d y l i b
0 x 3 3 9 b f 0 0 0 - 0 x 3 3 9 f 9 f f f I O K i t a r m v 7 < e b 9 3 2 c c 4 2 d 6 0 e 5 5 d 9 a 4 d 0 6 9 1 b c c 3 d 9 a d > / S y s t e m / L i b r a r y / F r a m e w o r k s / I O K i t . f r a m e w o r k / V e r s i o n s / A / I O K i t
0 x 3 3 a 0 3 0 0 0 - 0 x 3 3 a c 4 f f f l i b o b j c . A . d y l i b a r m v 7 < a a f 5 6 7 1 a 3 5 f 9 a c 2 0 d 5 8 4 6 7 0 3 d a f a f 4 c 6 > / u s r / l i b / l i b o b j c . A . d y l i b
0 x 3 3 a e b 0 0 0 - 0 x 3 3 a e d f f f l i b g c c _ s . 1 . d y l i b a r m v 7 < e 6 6 7 5 8 b c d a 6 d a 5 d 7 f 9 b 5 4 f a 5 c 4 d e 6 d a 2 > / u s r / l i b / l i b g c c _ s . 1 . d y l i b
0 x 3 3 a e e 0 0 0 - 0 x 3 3 b 4 3 f f f l i b v D S P . d y l i b a r m v 7 < 9 3 6 5 f c 6 c a e 1 b f f 7 3 7 2 5 7 e 7 4 f a f 3 b 1 f 2 6 > / S y s t e m / L i b r a r y / F r a m e w o r k s / A c c e l e r a t e . f r a m e w o r k / F r a m e w o r k s / v e c L i b . f r a m e w o r k / l i b v D S P . d y l i b
0 x 3 3 b 4 f 0 0 0 - 0 x 3 3 c 3 c f f f l i b i c o n v . 2 . d y l i b a r m v 7 < c 7 2 b 4 5 f 4 7 1 d f 0 9 2 d b d 8 4 9 0 8 1 f 7 a 3 e f 5 3 > / u s r / l i b / l i b i c o n v . 2 . d y l i b
0 x 3 5 6 2 1 0 0 0 - 0 x 3 5 6 2 1 f f f A c c e l e r a t e a r m v 7 < 2 9 d d 5 f 1 7 4 4 0 b b b 6 e 8 e 4 2 e 1 1 b 6 f c e d a 9 a > / S y s t e m / L i b r a r y / F r a m e w o r k s / A c c e l e r a t e . f r a m e w o r k / A c c e l e r a t e
0 x 3 5 6 2 5 0 0 0 - 0 x 3 5 7 1 7 f f f M u s i c L i b r a r y a r m v 7 < 3 4 e d b e e 4 2 3 a a 7 e 2 e a 3 2 a d 4 e e d 0 6 2 0 b 8 5 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / M u s i c L i b r a r y . f r a m e w o r k / M u s i c L i b r a r y
0 x 3 5 7 6 d 0 0 0 - 0 x 3 5 7 7 0 f f f l i b G F X S h a r e d . d y l i b a r m v 7 < 3 a 3 8 5 e d 4 9 5 3 7 9 1 1 6 a b b e 5 0 b c 8 c d 5 a 6 1 2 > / S y s t e m / L i b r a r y / F r a m e w o r k s / O p e n G L E S . f r a m e w o r k / l i b G F X S h a r e d . d y l i b
0 x 3 5 8 3 6 0 0 0 - 0 x 3 5 9 1 e f f f l i b G L P r o g r a m m a b i l i t y . d y l i b a r m v 7 < 1 f 4 7 8 a 7 1 7 8 3 c d 7 e b 4 a e 9 e f 6 f 2 d c e a 8 0 3 > / S y s t e m / L i b r a r y / F r a m e w o r k s / O p e n G L E S . f r a m e w o r k / l i b G L P r o g r a m m a b i l i t y . d y l i b
0 x 3 5 9 3 6 0 0 0 - 0 x 3 5 a 4 5 f f f M e d i a P l a y e r a r m v 7 < 9 3 3 7 a b d 4 f d d 7 4 9 4 7 3 e f a e f e 6 4 e e 6 4 9 a 0 > / S y s t e m / L i b r a r y / F r a m e w o r k s / M e d i a P l a y e r . f r a m e w o r k / M e d i a P l a y e r
0 x 3 5 a 4 6 0 0 0 - 0 x 3 5 a 4 8 f f f C r a s h R e p o r t e r S u p p o r t a r m v 7 < 3 0 a 5 f 1 e d c d b 9 f f e 8 6 8 a 6 2 0 1 9 9 a 4 c b e 1 2 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / C r a s h R e p o r t e r S u p p o r t . f r a m e w o r k / C r a s h R e p o r t e r S u p p o r t
0 x 3 5 a 4 9 0 0 0 - 0 x 3 5 a 5 3 f f f A c c o u n t S e t t i n g s a r m v 7 < 1 9 c 7 9 f 8 1 d 5 d 5 5 f e 2 e 6 b 6 1 8 f c d c 2 8 2 5 8 e > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A c c o u n t S e t t i n g s . f r a m e w o r k / A c c o u n t S e t t i n g s
0 x 3 5 a 5 e 0 0 0 - 0 x 3 5 a 5 f f f f C o r e S u r f a c e a r m v 7 < f 7 c a a f 4 3 6 0 9 c f e 0 e 4 7 5 d f e 8 3 7 9 0 e d b 4 d > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / C o r e S u r f a c e . f r a m e w o r k / C o r e S u r f a c e
0 x 3 5 a 6 4 0 0 0 - 0 x 3 5 a 7 a f f f E A P 8 0 2 1 X a r m v 7 < 3 6 6 5 9 e c 2 b 9 d e f 7 b 5 7 9 8 a 0 5 3 2 7 e 3 6 9 2 4 7 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / E A P 8 0 2 1 X . f r a m e w o r k / E A P 8 0 2 1 X
0 x 3 5 a 7 b 0 0 0 - 0 x 3 6 0 6 3 f f f W e b C o r e a r m v 7 < d 6 b d 9 c f 8 8 e e 8 2 a b 6 b 0 e 3 3 e 0 a e 1 1 9 0 7 7 2 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / W e b C o r e . f r a m e w o r k / W e b C o r e
0 x 3 6 0 6 4 0 0 0 - 0 x 3 6 0 8 3 f f f B o m a r m v 7 < 0 f 5 f d 6 0 5 7 b a d 5 e 1 6 7 7 8 6 9 5 0 0 d 6 3 6 8 2 1 f > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / B o m . f r a m e w o r k / B o m
0 x 3 6 0 8 d 0 0 0 - 0 x 3 6 0 9 4 f f f A g g r e g a t e D i c t i o n a r y a r m v 7 < 7 1 3 7 2 c 9 5 d 4 a f 7 a f 7 8 7 d 0 6 8 2 a 9 3 9 e 4 0 a c > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / A g g r e g a t e D i c t i o n a r y . f r a m e w o r k / A g g r e g a t e D i c t i o n a r y
0 x 3 6 1 2 e 0 0 0 - 0 x 3 6 1 4 0 f f f P e r s i s t e n t C o n n e c t i o n a r m v 7 < c d 2 a 6 9 9 a a 5 0 3 6 b d a d 0 5 1 7 6 0 3 b a 4 d b 8 3 9 > / S y s t e m / L i b r a r y / P r i v a t e F r a m e w o r k s / P e r s i s t e n t C o n n e c t i o n . f r a m e w o r k / P e r s i s t e n t C o n n e c t i o n
0 x 3 6 1 4 1 0 0 0 - 0 x 3 6 1 7 8 f f f S e c u r i t y a r m v 7 < c d 2 8 e 1 0 2 9 5 0 6 3 4 a e 7 1 6 7 d d e e 9 c 6 8 6 d 3 6 > / S y s t e m / L i b r a r y / F r a m e w o r k s / S e c u r i t y . f r a m e w o r k / S e c u r i t y
| 1 |
5,786,321 | 04/26/2011 05:29:06 | 209,784 | 11/12/2009 17:00:11 | 136 | 0 | db2 sql pl tutorial | does anyone know a good sql pl tutorial for db2? | sql | tutorials | pl | null | null | 04/26/2011 13:11:25 | not a real question | db2 sql pl tutorial
===
does anyone know a good sql pl tutorial for db2? | 1 |
6,582,154 | 07/05/2011 11:48:30 | 316,841 | 04/14/2010 18:47:13 | 127 | 8 | MySQL, get data between start and end date columns ? | I've read a few similar questions then mine, where I could find querys that were pretty much the same I'm using. But I had to ask, because I would like to understand why this is not working:
I have the following data:
id category_id start_date end_date image campaign_id published
1 1 2011-07-05 2011-07-5 a.gif 3 1
2 1 2011-07-01 2011-07-15 c.gif 3 1
3 37 2011-07-01 2011-07-04 d.gif 3 1
I expect to get rows 1 and 2, from this query:
SELECT id, category_id, start_date, end_date FROM categories_campaigns WHERE start_date <= NOW() AND end_date >= NOW();
From what I've experienced, the only row returned is the second. Also this one, gives me the second,
SELECT category_id, start_date, end_date FROM categories_campaigns WHERE end_date >= NOW();
The next one returns me all 3,
SELECT category_id, start_date, end_date FROM categories_campaigns WHERE start_date <= NOW();
The datatype for both columns are DATE. So, my question is, how to solve this ? Why is this happening ? Or I've got an obvious error that i'm not finding on what to look for.
Thanks a lot for looking any kind of help is appreciated!
-------------- EDIT: SOLVED!
Great! I found a solution,
SELECT category_id, start_date, end_date FROM categories_campaigns WHERE start_date <= DATE(NOW()) and end_date >= DATE(NOW());
Returns me the first 2 rows as expected! Yeah!! ;D
| mysql | sql | null | null | null | null | open | MySQL, get data between start and end date columns ?
===
I've read a few similar questions then mine, where I could find querys that were pretty much the same I'm using. But I had to ask, because I would like to understand why this is not working:
I have the following data:
id category_id start_date end_date image campaign_id published
1 1 2011-07-05 2011-07-5 a.gif 3 1
2 1 2011-07-01 2011-07-15 c.gif 3 1
3 37 2011-07-01 2011-07-04 d.gif 3 1
I expect to get rows 1 and 2, from this query:
SELECT id, category_id, start_date, end_date FROM categories_campaigns WHERE start_date <= NOW() AND end_date >= NOW();
From what I've experienced, the only row returned is the second. Also this one, gives me the second,
SELECT category_id, start_date, end_date FROM categories_campaigns WHERE end_date >= NOW();
The next one returns me all 3,
SELECT category_id, start_date, end_date FROM categories_campaigns WHERE start_date <= NOW();
The datatype for both columns are DATE. So, my question is, how to solve this ? Why is this happening ? Or I've got an obvious error that i'm not finding on what to look for.
Thanks a lot for looking any kind of help is appreciated!
-------------- EDIT: SOLVED!
Great! I found a solution,
SELECT category_id, start_date, end_date FROM categories_campaigns WHERE start_date <= DATE(NOW()) and end_date >= DATE(NOW());
Returns me the first 2 rows as expected! Yeah!! ;D
| 0 |
3,612,593 | 08/31/2010 19:42:43 | 57,776 | 01/22/2009 04:26:40 | 1,849 | 72 | GWT TabLayoutPanel is always collapsed | I have a trivial TabLayoutPanel made with a UIBinder. The tabs render but none of the contents do. It's in the HTML, but it's always collapsed (inline styles set on the elements make it collapse). As far as I can tell this is identical to every TabLayoutPanel example I've seen. Other widgets render fine. The project is just the basic example with the default HTML and code stripped out.
The XML is:
<!DOCTYPE ui:UiBinder SYSTEM "http://dl.google.com/gwt/DTD/xhtml.ent">
<ui:UiBinder xmlns:ui="urn:ui:com.google.gwt.uibinder"
xmlns:g="urn:import:com.google.gwt.user.client.ui">
<g:TabLayoutPanel barHeight='22' barUnit='PX'>
<g:tab>
<g:header>Tab A</g:header>
<g:HTML>
asdf
<p>asdfasdf</p>
</g:HTML>
</g:tab>
<g:tab>
<g:header>Tab B</g:header>
<g:Label>blah</g:Label>
</g:tab>
<g:tab>
<g:header>Tab C</g:header>
<g:Label>blah</g:Label>
</g:tab>
</g:TabLayoutPanel>
</ui:UiBinder>
And the Java is:
public class Main extends Composite {
private static MainUiBinder uiBinder = GWT.create(MainUiBinder.class);
interface MainUiBinder extends UiBinder<Widget, Main> {
}
public Main() {
initWidget(uiBinder.createAndBindUi(this));
}
}
And I'm adding it to my app like this:
public void onModuleLoad() {
RootPanel.get().add(new Main());
}
I'm stunned. This should be trivially easy. I must be missing something stupid. Any ideas? | gwt | uibinder | gwt-tablayoutpanel | null | null | null | open | GWT TabLayoutPanel is always collapsed
===
I have a trivial TabLayoutPanel made with a UIBinder. The tabs render but none of the contents do. It's in the HTML, but it's always collapsed (inline styles set on the elements make it collapse). As far as I can tell this is identical to every TabLayoutPanel example I've seen. Other widgets render fine. The project is just the basic example with the default HTML and code stripped out.
The XML is:
<!DOCTYPE ui:UiBinder SYSTEM "http://dl.google.com/gwt/DTD/xhtml.ent">
<ui:UiBinder xmlns:ui="urn:ui:com.google.gwt.uibinder"
xmlns:g="urn:import:com.google.gwt.user.client.ui">
<g:TabLayoutPanel barHeight='22' barUnit='PX'>
<g:tab>
<g:header>Tab A</g:header>
<g:HTML>
asdf
<p>asdfasdf</p>
</g:HTML>
</g:tab>
<g:tab>
<g:header>Tab B</g:header>
<g:Label>blah</g:Label>
</g:tab>
<g:tab>
<g:header>Tab C</g:header>
<g:Label>blah</g:Label>
</g:tab>
</g:TabLayoutPanel>
</ui:UiBinder>
And the Java is:
public class Main extends Composite {
private static MainUiBinder uiBinder = GWT.create(MainUiBinder.class);
interface MainUiBinder extends UiBinder<Widget, Main> {
}
public Main() {
initWidget(uiBinder.createAndBindUi(this));
}
}
And I'm adding it to my app like this:
public void onModuleLoad() {
RootPanel.get().add(new Main());
}
I'm stunned. This should be trivially easy. I must be missing something stupid. Any ideas? | 0 |
11,338,383 | 07/05/2012 05:43:33 | 1,497,909 | 07/03/2012 06:36:54 | 15 | 0 | Writing to an Existing Excel File | package jexcel.jxl.nimit;
import java.awt.Label;
import java.io.File;
import java.io.IOException;
import jxl.Cell;
import jxl.CellType;
import jxl.LabelCell;
import jxl.NumberCell;
import jxl.Sheet;
import jxl.Workbook;
import jxl.read.biff.BiffException;
import jxl.write.WritableCell;
import jxl.write.WritableSheet;
import jxl.write.WritableWorkbook;
import jxl.write.WriteException;
import jxl.write.biff.RowsExceededException;
public class ExcelJxl {
/**
* @param args
* @throws IOException
* @throws BiffException
* @throws WriteException
* @throws RowsExceededException
*/
public static void main(String[] args) throws BiffException, IOException, RowsExceededException, WriteException {
// TODO Auto-generated method stub
ExcelJxl.WriteFile("D:\nimit.xls");
}
public static void WriteFile(String path) throws BiffException, IOException, RowsExceededException, WriteException{
Workbook wb=Workbook.getWorkbook(new File(path));
WritableSheet sheet=(WritableSheet) wb.getSheet(0);
Label label=new Label("Nimit");
sheet.addCell((WritableCell) label);
wb.write();
wb.close();
}
}
The write() is showing an error __The method write() is undefined for the type Workbook__ I understood how to read from an excel file, Its simple. How do I write to it? and the why is the write() showing an error? Do I need to use inputstream always?
| java | jxl | jxls | null | null | null | open | Writing to an Existing Excel File
===
package jexcel.jxl.nimit;
import java.awt.Label;
import java.io.File;
import java.io.IOException;
import jxl.Cell;
import jxl.CellType;
import jxl.LabelCell;
import jxl.NumberCell;
import jxl.Sheet;
import jxl.Workbook;
import jxl.read.biff.BiffException;
import jxl.write.WritableCell;
import jxl.write.WritableSheet;
import jxl.write.WritableWorkbook;
import jxl.write.WriteException;
import jxl.write.biff.RowsExceededException;
public class ExcelJxl {
/**
* @param args
* @throws IOException
* @throws BiffException
* @throws WriteException
* @throws RowsExceededException
*/
public static void main(String[] args) throws BiffException, IOException, RowsExceededException, WriteException {
// TODO Auto-generated method stub
ExcelJxl.WriteFile("D:\nimit.xls");
}
public static void WriteFile(String path) throws BiffException, IOException, RowsExceededException, WriteException{
Workbook wb=Workbook.getWorkbook(new File(path));
WritableSheet sheet=(WritableSheet) wb.getSheet(0);
Label label=new Label("Nimit");
sheet.addCell((WritableCell) label);
wb.write();
wb.close();
}
}
The write() is showing an error __The method write() is undefined for the type Workbook__ I understood how to read from an excel file, Its simple. How do I write to it? and the why is the write() showing an error? Do I need to use inputstream always?
| 0 |
7,456,025 | 09/17/2011 15:56:20 | 463,785 | 10/01/2010 10:58:31 | 1,700 | 118 | ASP.NET MVC 3 and Google Maps v3 : Any known ways to follow | I am going to implement `Google Maps API v3` to my `ASP.NET MVC 3` web site. I am using `Razor` as my view engine.
I had a look at Google Maps API v3 and it is pretty straight forward. What I wonder is if you have an idea of how we can start.
I will get Latitude and Longitude data for hotels from my database and I have my repositories to handle data access between my app and SQL Server.
1. What kind of model would you create?
2. Would you create `HtmlHelper` extensions to handle some of the UI work?
3. Would you go ahead and work mostly with `Partial Views` instead?
I know that these questions are partially related to what kind of app you have and how it has been built so far but that would be nice to have others opinion on this topic in general.
Any thoughts? | asp.net | asp.net-mvc | asp.net-mvc-3 | google-maps | google-maps-api-3 | 09/18/2011 14:35:06 | not constructive | ASP.NET MVC 3 and Google Maps v3 : Any known ways to follow
===
I am going to implement `Google Maps API v3` to my `ASP.NET MVC 3` web site. I am using `Razor` as my view engine.
I had a look at Google Maps API v3 and it is pretty straight forward. What I wonder is if you have an idea of how we can start.
I will get Latitude and Longitude data for hotels from my database and I have my repositories to handle data access between my app and SQL Server.
1. What kind of model would you create?
2. Would you create `HtmlHelper` extensions to handle some of the UI work?
3. Would you go ahead and work mostly with `Partial Views` instead?
I know that these questions are partially related to what kind of app you have and how it has been built so far but that would be nice to have others opinion on this topic in general.
Any thoughts? | 4 |
8,413,474 | 12/07/2011 10:02:53 | 731,262 | 04/29/2011 14:39:09 | 1,091 | 65 | Build using G++ on Ubuntu for RedHat | Is there any way to link against RedHat static libraries while building on Ubuntu and using GCC? | linux | g++ | null | null | null | null | open | Build using G++ on Ubuntu for RedHat
===
Is there any way to link against RedHat static libraries while building on Ubuntu and using GCC? | 0 |
10,192,062 | 04/17/2012 13:19:04 | 1,338,830 | 04/17/2012 13:02:52 | 1 | 0 | File browser for Novell server | We have Novell server. My task is: make access to Novell server and get from it file system of specified user trough web browser.
what to use? java + jsp? server - java, jsp page for client? | java | jsp | novell | null | null | 04/17/2012 14:17:56 | not a real question | File browser for Novell server
===
We have Novell server. My task is: make access to Novell server and get from it file system of specified user trough web browser.
what to use? java + jsp? server - java, jsp page for client? | 1 |
1,273,026 | 08/13/2009 16:16:32 | 90,765 | 04/14/2009 17:42:48 | 144 | 2 | limit size of Queue<T> in C++ | I notice the thread of similar question: http://stackoverflow.com/questions/1292/limit-size-of-queuet-in-net
That's exactly what I want to do, but I am not using .net but GNU C++.
What I want to do:
specify the size of the queue, automatic dequeue when the queue is full.How to implement such a queue?
Thanks. | queue | c++ | containers | limit | null | null | open | limit size of Queue<T> in C++
===
I notice the thread of similar question: http://stackoverflow.com/questions/1292/limit-size-of-queuet-in-net
That's exactly what I want to do, but I am not using .net but GNU C++.
What I want to do:
specify the size of the queue, automatic dequeue when the queue is full.How to implement such a queue?
Thanks. | 0 |
8,804,728 | 01/10/2012 14:20:32 | 917,672 | 08/29/2011 10:57:37 | 466 | 18 | Open Application Console from Java Application | I want to open from my Java Application the Console, where the outputs are written (example at the End). Is this possible? If Yes, how?
thanks :)
![This kind of Console][1]
[1]: http://i.stack.imgur.com/4ZEeA.png | java | console | cmd | null | null | 01/10/2012 20:39:27 | not a real question | Open Application Console from Java Application
===
I want to open from my Java Application the Console, where the outputs are written (example at the End). Is this possible? If Yes, how?
thanks :)
![This kind of Console][1]
[1]: http://i.stack.imgur.com/4ZEeA.png | 1 |
3,746,079 | 09/19/2010 14:28:46 | 472,382 | 09/19/2010 12:54:16 | 1 | 0 | execute command within command ? | i want to ask if i can execute command within command ...or use the output of the previous command as the input of the followed command : command x then command y in command y i want use output of command x | linux | svn | command-line | ubuntu | solaris | null | open | execute command within command ?
===
i want to ask if i can execute command within command ...or use the output of the previous command as the input of the followed command : command x then command y in command y i want use output of command x | 0 |
8,388,050 | 12/05/2011 15:57:16 | 987,654 | 10/10/2011 12:15:43 | 1 | 0 | The Windows SharePoint Services Administration service on Local Computer started and then stopped | The Windows SharePoint Services Administration service on Local Computer started and then stopped , The error message :
"The Windows SharePoint Services Administration service on Local Computer started and then stopped. Some services stop automatically if they are not in use by other services or programs. "
Any idea ?
Thanks in advance ,
Poli .
| sharepoint | null | null | null | null | 12/06/2011 16:38:08 | off topic | The Windows SharePoint Services Administration service on Local Computer started and then stopped
===
The Windows SharePoint Services Administration service on Local Computer started and then stopped , The error message :
"The Windows SharePoint Services Administration service on Local Computer started and then stopped. Some services stop automatically if they are not in use by other services or programs. "
Any idea ?
Thanks in advance ,
Poli .
| 2 |
10,466,598 | 05/05/2012 22:46:35 | 1,099,830 | 12/15/2011 12:22:42 | 1 | 0 | c# error on windows server 2008 | I have a website which is hosted on a windows 2008 server. The pages are written in ASP.NET - c#.
I have recently migrated this website from a windows 2005 to the windows 2008 server.
However, when I try to run the website, on one of the pages I get a "the path is not a legal form" error.
Below is an abstract of the code:
Line 23: get
Line 24: {
Line 25: return CConfigUtils.GetConfig("OlsDataConnection");
Line 26: }
Line 27: }
Does anyone know what could be creating the error?
Thank you. | c# | null | null | null | null | 05/14/2012 10:05:15 | not a real question | c# error on windows server 2008
===
I have a website which is hosted on a windows 2008 server. The pages are written in ASP.NET - c#.
I have recently migrated this website from a windows 2005 to the windows 2008 server.
However, when I try to run the website, on one of the pages I get a "the path is not a legal form" error.
Below is an abstract of the code:
Line 23: get
Line 24: {
Line 25: return CConfigUtils.GetConfig("OlsDataConnection");
Line 26: }
Line 27: }
Does anyone know what could be creating the error?
Thank you. | 1 |
284,797 | 11/12/2008 18:10:14 | 35,520 | 11/07/2008 15:50:14 | 35 | 2 | "Hello World" in less then 20 bytes | We have had an interesting competition once, where everyone would write their implementation of hello world programm. one requirement was that is should be less then 20 bytes in compiled form. the winner would be the one whose version is the smallest...
What would be your solution? :)
PS. we used asm for x86 platform | asm | hello | hello-world | x86 | null | 10/05/2011 06:10:47 | not constructive | "Hello World" in less then 20 bytes
===
We have had an interesting competition once, where everyone would write their implementation of hello world programm. one requirement was that is should be less then 20 bytes in compiled form. the winner would be the one whose version is the smallest...
What would be your solution? :)
PS. we used asm for x86 platform | 4 |
6,454,225 | 06/23/2011 12:46:45 | 811,223 | 06/22/2011 21:44:47 | 1 | 0 | JQuery Ajax loading external html with loader | Is it possible to have <a href="http://colorpowered.com/colorbox/core/example2/index.html">colorbox</a> and its animations in an expanding div rather than a new modal window? Not sure colorbox is the correct way to do this.
I want to ajax load external html into a div but keep the close, animation and loading functions colorbox has.
Any thoughts would be much appreciated. | jquery | jquery-ajax | colorbox | uploading | null | null | open | JQuery Ajax loading external html with loader
===
Is it possible to have <a href="http://colorpowered.com/colorbox/core/example2/index.html">colorbox</a> and its animations in an expanding div rather than a new modal window? Not sure colorbox is the correct way to do this.
I want to ajax load external html into a div but keep the close, animation and loading functions colorbox has.
Any thoughts would be much appreciated. | 0 |
6,009,251 | 05/15/2011 15:15:46 | 184,283 | 10/05/2009 10:08:48 | 45 | 0 | how to start using openID in an asp.net mvc3 project? | I want to have authentication mechanism for my site (in asp.net mvc3), first option openID another option via my site. I don't know how to start with dotnetopenid, because it does not have a good document or some guidance to start with it. Is there any visual document or any useful step by step resource for it. The other question: I want to have google and yahoo openID authentication, is there any difference for using both of them?!
tanks a lot for your suggestions | asp.net-mvc | asp.net-mvc-3 | dotnetopenauth | null | null | null | open | how to start using openID in an asp.net mvc3 project?
===
I want to have authentication mechanism for my site (in asp.net mvc3), first option openID another option via my site. I don't know how to start with dotnetopenid, because it does not have a good document or some guidance to start with it. Is there any visual document or any useful step by step resource for it. The other question: I want to have google and yahoo openID authentication, is there any difference for using both of them?!
tanks a lot for your suggestions | 0 |
10,999,158 | 06/12/2012 14:51:23 | 791,713 | 06/09/2011 20:57:13 | 655 | 76 | can't fix undefined reference to vtable | I've been searching for a while and have found a *lot* of threads/pages that involve the problem I have, but I am not able to find
1. An explanation of *why* this error occurs
2. A working solution for my specific case
The following is `Scanner.h`:
class BaseReader {
public:
virtual ~BaseReader();
virtual const char* read() = 0;
virtual long position() = 0;
virtual long size() = 0;
virtual void seek(long position) = 0;
};
class CharReader : public BaseReader {
public:
CharReader(const char* source);
CharReader(const char* source, long size);
~CharReader();
const char* read();
long position();
long size();
void seek(long position);
private:
char* _source;
long _position;
long _size;
};
In `Scanner.cpp` I simply implement one of the constructors of `CharReader`.
I use Code::Blocks, but compiling it by myself results in the exact same problem.
niklas@emerald:~/git/hiterator (CPP)$ g++ main.cpp hiterator/Scanner.cpp -o main
/tmp/cclNNwgl.o: In function `hiterator::CharReader::CharReader(char const*)':
Scanner.cpp:(.text+0x16): undefined reference to `vtable for hiterator::CharReader'
collect2: ld gab 1 als Ende-Status zurück
------
@qdii:
#include "Scanner.h"
using namespace hiterator;
#include <stdlib.h>
#include <string.h>
CharReader::CharReader(const char* source) {
_size = strlen(source);
_source = (char*) malloc(_size + 1);
memcpy(_source, source, _size + 1);
}
| c++ | c | virtual | vtable | undefined-reference | null | open | can't fix undefined reference to vtable
===
I've been searching for a while and have found a *lot* of threads/pages that involve the problem I have, but I am not able to find
1. An explanation of *why* this error occurs
2. A working solution for my specific case
The following is `Scanner.h`:
class BaseReader {
public:
virtual ~BaseReader();
virtual const char* read() = 0;
virtual long position() = 0;
virtual long size() = 0;
virtual void seek(long position) = 0;
};
class CharReader : public BaseReader {
public:
CharReader(const char* source);
CharReader(const char* source, long size);
~CharReader();
const char* read();
long position();
long size();
void seek(long position);
private:
char* _source;
long _position;
long _size;
};
In `Scanner.cpp` I simply implement one of the constructors of `CharReader`.
I use Code::Blocks, but compiling it by myself results in the exact same problem.
niklas@emerald:~/git/hiterator (CPP)$ g++ main.cpp hiterator/Scanner.cpp -o main
/tmp/cclNNwgl.o: In function `hiterator::CharReader::CharReader(char const*)':
Scanner.cpp:(.text+0x16): undefined reference to `vtable for hiterator::CharReader'
collect2: ld gab 1 als Ende-Status zurück
------
@qdii:
#include "Scanner.h"
using namespace hiterator;
#include <stdlib.h>
#include <string.h>
CharReader::CharReader(const char* source) {
_size = strlen(source);
_source = (char*) malloc(_size + 1);
memcpy(_source, source, _size + 1);
}
| 0 |
8,149,360 | 11/16/2011 09:28:35 | 988,082 | 10/10/2011 16:52:30 | 7 | 0 | Make the location authorization for an application message appear at the first launch of the application | I want to show the message which asks the user if he accepts that the application will use the location services in his device. How can i implement that, WITHOUT saving his location? I've tried to do `startLocationUpdates` and then `stopLocationUpdates`, but that doesn't work. If i remove the `stopLocationUpdates`, that works, but the location indicator remains in the status bar.
If you ask why i need this, I'm using Core Location methods few screens later. Before using them, i check for `+ (CLAuthorizationStatus)authorizationStatus` , and if it's different from "Authorized", i give an alert message. Is that wrong ?
Thanks ! | iphone | objective-c | xcode | core-location | cllocationmanager | null | open | Make the location authorization for an application message appear at the first launch of the application
===
I want to show the message which asks the user if he accepts that the application will use the location services in his device. How can i implement that, WITHOUT saving his location? I've tried to do `startLocationUpdates` and then `stopLocationUpdates`, but that doesn't work. If i remove the `stopLocationUpdates`, that works, but the location indicator remains in the status bar.
If you ask why i need this, I'm using Core Location methods few screens later. Before using them, i check for `+ (CLAuthorizationStatus)authorizationStatus` , and if it's different from "Authorized", i give an alert message. Is that wrong ?
Thanks ! | 0 |
8,832,441 | 01/12/2012 09:08:17 | 928,715 | 09/05/2011 10:53:22 | 40 | 0 | Attributes in Zen cart | I was working with attributes in Zen cart and looking for the way to insert quantity for each product options, like I have a product called "Levis T-Shirt" and its having attributes like, "Color" & "Size", now i want to insert something like:
Levis T-shirt - Red Color - Large - Quantity 10<br>
Levis T-shirt - Black Color - Medium - Quantity 15<br>
Levis T-shirt - Blue Color - Large - Quantity 05
So how could I insert like this?
*Note: All this functionality is from admin at the time of saving products to DB*
Thanks,
In advance | php | zen-cart | null | null | null | 02/02/2012 14:03:14 | off topic | Attributes in Zen cart
===
I was working with attributes in Zen cart and looking for the way to insert quantity for each product options, like I have a product called "Levis T-Shirt" and its having attributes like, "Color" & "Size", now i want to insert something like:
Levis T-shirt - Red Color - Large - Quantity 10<br>
Levis T-shirt - Black Color - Medium - Quantity 15<br>
Levis T-shirt - Blue Color - Large - Quantity 05
So how could I insert like this?
*Note: All this functionality is from admin at the time of saving products to DB*
Thanks,
In advance | 2 |
11,689,370 | 07/27/2012 14:01:59 | 230,691 | 12/13/2009 14:39:11 | 8 | 1 | Why does calling CreateGraphics() change the look and feel of my form? | In my C# winforms application, I am using the Graphics object to obtain the current DPI value to enable my code to scale certain components. This works fine except that, as soon as I call CreateGraphics(), the look and feel of my winforms application changes. The style goes from the familiar "rounded" buttons to the more archaic looking "sharp edged" buttons.
Why is this happening and what can I do to prevent it?
My code looks like the following:
Graphics g = this.CreateGraphics();
try
{
if (g.DpiX == 120.0f)
{
// scale the components appropriately
}
}
finally
{
g.Dispose();
}
In fact I can reproduce the problem just by calling CreateGraphics and then instantly disposing of it.
Any help or insight much appreciated!
And alternative question is: is there anyway to obtain the DPI setting without creating a Graphics object? | winforms | look-and-feel | null | null | null | null | open | Why does calling CreateGraphics() change the look and feel of my form?
===
In my C# winforms application, I am using the Graphics object to obtain the current DPI value to enable my code to scale certain components. This works fine except that, as soon as I call CreateGraphics(), the look and feel of my winforms application changes. The style goes from the familiar "rounded" buttons to the more archaic looking "sharp edged" buttons.
Why is this happening and what can I do to prevent it?
My code looks like the following:
Graphics g = this.CreateGraphics();
try
{
if (g.DpiX == 120.0f)
{
// scale the components appropriately
}
}
finally
{
g.Dispose();
}
In fact I can reproduce the problem just by calling CreateGraphics and then instantly disposing of it.
Any help or insight much appreciated!
And alternative question is: is there anyway to obtain the DPI setting without creating a Graphics object? | 0 |
8,958,767 | 01/22/2012 03:41:54 | 15,441 | 09/17/2008 09:20:36 | 1,892 | 41 | Leiningen - way to automate removal of *.DSA and *.SF files (Clojure Maven) | I'm using Leiningen to automate the creation of a single 'uberjar' from several dependencies. (For a Web Start Application).
Some of the jar files are signed, and the uberjar process brings across their signature files (which don't match the new jar). I want to add my own self-signed cert and remove the old ones.
Is there an easy way in leiningen to remove these old signing files (or stop them being copied across)? I'm doing it as a manual step at present.
| maven | clojure | signed | leiningen | uberjar | null | open | Leiningen - way to automate removal of *.DSA and *.SF files (Clojure Maven)
===
I'm using Leiningen to automate the creation of a single 'uberjar' from several dependencies. (For a Web Start Application).
Some of the jar files are signed, and the uberjar process brings across their signature files (which don't match the new jar). I want to add my own self-signed cert and remove the old ones.
Is there an easy way in leiningen to remove these old signing files (or stop them being copied across)? I'm doing it as a manual step at present.
| 0 |
9,429,777 | 02/24/2012 11:13:02 | 365,251 | 06/12/2010 13:37:57 | 2,804 | 5 | How to encode HTML text/script into a JSON object? | I need to convert an .aspx page (with html, script, and so on) into a JSON object (due to a JSONP Ajax request).
So I think the whole page (which could be a string) parsed to JSON? How can I do it? | c# | .net | ajax | json | parsing | null | open | How to encode HTML text/script into a JSON object?
===
I need to convert an .aspx page (with html, script, and so on) into a JSON object (due to a JSONP Ajax request).
So I think the whole page (which could be a string) parsed to JSON? How can I do it? | 0 |
6,657,168 | 07/11/2011 21:34:05 | 262,854 | 01/31/2010 10:06:44 | 333 | 0 | Super drop down menu with images and text details | I'm curious how to build a similar menu with all the images and text details as in
http://www.resellerclub.com/
Any ideas on the technologies used ? Are there any commercial solutions like this ?
Thank you, | javascript | css | null | null | null | 07/12/2011 02:37:37 | not a real question | Super drop down menu with images and text details
===
I'm curious how to build a similar menu with all the images and text details as in
http://www.resellerclub.com/
Any ideas on the technologies used ? Are there any commercial solutions like this ?
Thank you, | 1 |
5,777,938 | 04/25/2011 11:36:02 | 723,627 | 04/25/2011 11:05:13 | 3 | 0 | How to count requests to file | Like, I have file on ftp http://site.com/download/file.zip
I download it by directly request from browser's address tab.
How can I count the number of requests of this file?
Or how do I remove the ability of such requests, so they should work only by php? | php | file | redirect | ftp | download | null | open | How to count requests to file
===
Like, I have file on ftp http://site.com/download/file.zip
I download it by directly request from browser's address tab.
How can I count the number of requests of this file?
Or how do I remove the ability of such requests, so they should work only by php? | 0 |
11,738,817 | 07/31/2012 11:12:19 | 1,501,118 | 07/04/2012 09:25:38 | 10 | 0 | Launch default Call Settings in my android app | How can I launch default android call Settings activity from my app. | android | android-layout | android-intent | null | null | 07/31/2012 19:05:51 | not a real question | Launch default Call Settings in my android app
===
How can I launch default android call Settings activity from my app. | 1 |
7,646,880 | 10/04/2011 11:02:16 | 940,461 | 09/12/2011 11:43:01 | 5 | 0 | I have one method which returns two dimensional array. now i want to get the values from that method |
private double[][] getTimeValuePairsArray(List<Double> timeList, List<Double> valueList){
double[][] timeValuePairs = new double[2][timeList.size()];
for (int i = 0; i < timeList.size(); ++i) {
timeValuePairs[0][i] = ((Double)timeList.get(i)).doubleValue();
timeValuePairs[1][i] = ((Double)valueList.get(i)).doubleValue();
}
return timeValuePairs;
}
//timeList and valueList are ArrayList objects and contains some data.
double[][] timeValuePairs1 = getTimeValuePairsArray(timeList, valueList);
//here i want to display values which is returned by the above method.
| java | null | null | null | null | null | open | I have one method which returns two dimensional array. now i want to get the values from that method
===
private double[][] getTimeValuePairsArray(List<Double> timeList, List<Double> valueList){
double[][] timeValuePairs = new double[2][timeList.size()];
for (int i = 0; i < timeList.size(); ++i) {
timeValuePairs[0][i] = ((Double)timeList.get(i)).doubleValue();
timeValuePairs[1][i] = ((Double)valueList.get(i)).doubleValue();
}
return timeValuePairs;
}
//timeList and valueList are ArrayList objects and contains some data.
double[][] timeValuePairs1 = getTimeValuePairsArray(timeList, valueList);
//here i want to display values which is returned by the above method.
| 0 |
3,186,645 | 07/06/2010 13:36:05 | 336,700 | 05/09/2010 16:13:29 | 20 | 0 | mysql function return list of data | I would like to write a mysql function that takes an integer as input and that function execute a select statements "select id from table_name" then i want that function return the result of select statements.
then
in query i want to do smthing like:
select id,name from table_name where id in (`call function here that returns a list of ids`).
Is that valid in mysql ??
Thanks in Advance
| mysql | null | null | null | null | null | open | mysql function return list of data
===
I would like to write a mysql function that takes an integer as input and that function execute a select statements "select id from table_name" then i want that function return the result of select statements.
then
in query i want to do smthing like:
select id,name from table_name where id in (`call function here that returns a list of ids`).
Is that valid in mysql ??
Thanks in Advance
| 0 |
10,303,038 | 04/24/2012 17:34:26 | 1,300,799 | 03/29/2012 12:47:04 | 1 | 0 | login with servlets, NOT validate->redirect way | i m new to servlets and jsp, but i can write simple ones.
currently on all pages of my webapp, there is a login form, added with jsp:include.
i want to create login mechanism, so that after a user is validated, i dont get redirected( simple servlet mechanism ), but login form disappears(like in most normal websites).
all the examples i find, they teach me how to validate+redirect. How can i do what i specified instead? if its complicated, then at least general direction, right now i don't even really know what to google for exactly.
Thanks | java | web-services | mvc | servlets | null | null | open | login with servlets, NOT validate->redirect way
===
i m new to servlets and jsp, but i can write simple ones.
currently on all pages of my webapp, there is a login form, added with jsp:include.
i want to create login mechanism, so that after a user is validated, i dont get redirected( simple servlet mechanism ), but login form disappears(like in most normal websites).
all the examples i find, they teach me how to validate+redirect. How can i do what i specified instead? if its complicated, then at least general direction, right now i don't even really know what to google for exactly.
Thanks | 0 |
1,415,675 | 09/12/2009 17:34:18 | 54,538 | 01/13/2009 10:57:03 | 358 | 14 | Getting underlying type of a proxy object | I'm using Castle DynamicProxy and my ViewModels are a proxy, something like this:
<pre>
namespace MyApplication.ViewModels
{
public class MyViewModel : BaseViewModel, IMyViewModel
{
}
}
</pre>
a proxy of my viewmodel looks like this though:
{Name = "IRootViewModelProxyffecb133f590422098ca7c0ac13b8f98" FullName = "IRootViewModelProxyffecb133f590422098ca7c0ac13b8f98"}
I want to get the actual type or namespace of the actual type that is being proxied. Is there any way to do this? I want something that returns MyApplication.ViewModels.MyViewModel type. If I'm using concreate class as proxies, BaseType returns the actual class that is being proxied, but when using the interface, BaseType would return System.Object. | proxy | castle-dynamicproxy | reflection | null | null | null | open | Getting underlying type of a proxy object
===
I'm using Castle DynamicProxy and my ViewModels are a proxy, something like this:
<pre>
namespace MyApplication.ViewModels
{
public class MyViewModel : BaseViewModel, IMyViewModel
{
}
}
</pre>
a proxy of my viewmodel looks like this though:
{Name = "IRootViewModelProxyffecb133f590422098ca7c0ac13b8f98" FullName = "IRootViewModelProxyffecb133f590422098ca7c0ac13b8f98"}
I want to get the actual type or namespace of the actual type that is being proxied. Is there any way to do this? I want something that returns MyApplication.ViewModels.MyViewModel type. If I'm using concreate class as proxies, BaseType returns the actual class that is being proxied, but when using the interface, BaseType would return System.Object. | 0 |
6,226,882 | 06/03/2011 12:06:59 | 609,736 | 02/09/2011 12:28:36 | 96 | 12 | Automated checking of database connection and query in same database | I am trying to figure out code working for an auto testing as follows:
(in C# code, SQL database used)
1. Check whether database (having credentials) is working fine or down?
2. If working, run a select query in it & check for succesful execution.
3. In any case of failure for above 2 points, automatically send an email to somemone.
Kindly help me out. I think it would be a piece of cake for the experts here.
Thanks a ton | c# | sql | null | null | null | 06/03/2011 12:21:15 | not a real question | Automated checking of database connection and query in same database
===
I am trying to figure out code working for an auto testing as follows:
(in C# code, SQL database used)
1. Check whether database (having credentials) is working fine or down?
2. If working, run a select query in it & check for succesful execution.
3. In any case of failure for above 2 points, automatically send an email to somemone.
Kindly help me out. I think it would be a piece of cake for the experts here.
Thanks a ton | 1 |
9,131,184 | 02/03/2012 15:34:13 | 1,007,638 | 10/21/2011 18:10:14 | 58 | 5 | Which is better practice for templates? Including an HTML file or use a function? | If I have to reuse HTML several times in an application (for instance as a template), is it considered better practice to have a separate HTML file and include that, or group the whole thing into a function? | php | null | null | null | null | 02/08/2012 06:44:10 | not constructive | Which is better practice for templates? Including an HTML file or use a function?
===
If I have to reuse HTML several times in an application (for instance as a template), is it considered better practice to have a separate HTML file and include that, or group the whole thing into a function? | 4 |
7,351,778 | 09/08/2011 16:59:18 | 106,342 | 05/13/2009 14:21:44 | 306 | 17 | Where can I see the default styles.xml in Android? | Where can I find the source code of the definition of the android default styles, such as `?android:attr/progressBarStyle`?
I know that the Android repo is replicated in https://github.com/android but... I just can't find the styles.xml, strings.xml, etc there! | android | android-layout | null | null | null | null | open | Where can I see the default styles.xml in Android?
===
Where can I find the source code of the definition of the android default styles, such as `?android:attr/progressBarStyle`?
I know that the Android repo is replicated in https://github.com/android but... I just can't find the styles.xml, strings.xml, etc there! | 0 |
8,223,082 | 11/22/2011 06:56:06 | 382,906 | 07/04/2010 01:40:57 | 2,158 | 65 | mysql workbench visualization for schema | i have an existing database and have recently downloaded mysql workbench. I was wondering if anyone could walk me through how to navigate the workbench and how to get a visualization of the RDB. I'd like to know how all the tables are related to each other. | mysql | mysql-workbench | null | null | null | 11/22/2011 11:31:46 | not a real question | mysql workbench visualization for schema
===
i have an existing database and have recently downloaded mysql workbench. I was wondering if anyone could walk me through how to navigate the workbench and how to get a visualization of the RDB. I'd like to know how all the tables are related to each other. | 1 |
3,536,314 | 08/21/2010 04:21:05 | 426,928 | 08/21/2010 04:21:05 | 1 | 0 | Using Jquery for country, city and location | if austrialia is selected, it will show only city of austrialia, if city is selected, will only show location of that city
| javascript | jquery | combobox | drop-down-menu | selector | 08/21/2010 05:15:01 | not a real question | Using Jquery for country, city and location
===
if austrialia is selected, it will show only city of austrialia, if city is selected, will only show location of that city
| 1 |
10,955,567 | 06/08/2012 20:19:20 | 133,244 | 07/05/2009 00:19:26 | 369 | 14 | How to extend this LINQ List<>.Contains to work with any Property using Reflection? | I have the following snippet that I currently use to run a .Contains() with a list of Ids passed as a comma separated list from users. This code works perfectly and the data is filtered exactly as I want it to be:
// Handle id in() statements explicitly, dynamic expression can't parse them
var idIn = new Regex("id in ?(.*)", RegexOptions.IgnoreCase);
if (idIn.IsMatch(predicate))
{
Match list = new Regex(@"in ?\((.*)\)", RegexOptions.IgnoreCase).Match(predicate);
string ins = list.Groups[1].ToString();
// Split ins and store as List<>
List<int> splitValues = ins.Split(new[] {','}, StringSplitOptions.RemoveEmptyEntries).Select(i => Convert.ToInt32(i)).ToList();
return source.Where(u => splitValues.Contains(u.Id));
}
I want to be able to use this same idea, except with ANY property of the u object using reflection. I had a version of this working at some point, but cannot for the life of me figure out what has changed or why it stopped working. Here is the version I have that I cannot get working again:
Match splitIn = new Regex(@"([a-zA-Z0-9\.]*) IN ?\((.*)\)", RegexOptions.IgnoreCase).Match(predicate);
string property = splitIn.Groups[1].ToString();
string ins = splitIn.Groups[2].ToString().Trim(new[] {'\'', '"'}); // Trim off separator quotes
List<string> splitValues = ins.Split(new[] {','}, StringSplitOptions.RemoveEmptyEntries).ToList();
for (int i = 0; i < splitValues.Count; i++)
{
splitValues[i] = splitValues[i].Trim(new[] {'\'', '"'});
}
Expression<Func<U, bool>> contains = u => ListContainsProperty(u, splitValues, property);
return source.Where(contains);
----------
private static bool ListContainsProperty<U>(U u, ICollection<string> list, string property)
{
string[] split = property.Split(new[] {"."}, StringSplitOptions.RemoveEmptyEntries);
object value = split.Aggregate<string, object>(u, (current, prop) => current.GetType().GetProperty(prop).GetValue(current, null));
return list.Contains(value.ToString());
}
As I said I once had SOME version of this working, but cannot figure out what has changed. Is there something blatantly obvious that I am missing that would help me get this functional again?
Edit: As far as I can tell the ListContainsProperty method is never actually running. Adding a "throw new Exception()" does nothing. I just get the full unfiltered list back. | linq | nhibernate | reflection | dynamic-linq | null | null | open | How to extend this LINQ List<>.Contains to work with any Property using Reflection?
===
I have the following snippet that I currently use to run a .Contains() with a list of Ids passed as a comma separated list from users. This code works perfectly and the data is filtered exactly as I want it to be:
// Handle id in() statements explicitly, dynamic expression can't parse them
var idIn = new Regex("id in ?(.*)", RegexOptions.IgnoreCase);
if (idIn.IsMatch(predicate))
{
Match list = new Regex(@"in ?\((.*)\)", RegexOptions.IgnoreCase).Match(predicate);
string ins = list.Groups[1].ToString();
// Split ins and store as List<>
List<int> splitValues = ins.Split(new[] {','}, StringSplitOptions.RemoveEmptyEntries).Select(i => Convert.ToInt32(i)).ToList();
return source.Where(u => splitValues.Contains(u.Id));
}
I want to be able to use this same idea, except with ANY property of the u object using reflection. I had a version of this working at some point, but cannot for the life of me figure out what has changed or why it stopped working. Here is the version I have that I cannot get working again:
Match splitIn = new Regex(@"([a-zA-Z0-9\.]*) IN ?\((.*)\)", RegexOptions.IgnoreCase).Match(predicate);
string property = splitIn.Groups[1].ToString();
string ins = splitIn.Groups[2].ToString().Trim(new[] {'\'', '"'}); // Trim off separator quotes
List<string> splitValues = ins.Split(new[] {','}, StringSplitOptions.RemoveEmptyEntries).ToList();
for (int i = 0; i < splitValues.Count; i++)
{
splitValues[i] = splitValues[i].Trim(new[] {'\'', '"'});
}
Expression<Func<U, bool>> contains = u => ListContainsProperty(u, splitValues, property);
return source.Where(contains);
----------
private static bool ListContainsProperty<U>(U u, ICollection<string> list, string property)
{
string[] split = property.Split(new[] {"."}, StringSplitOptions.RemoveEmptyEntries);
object value = split.Aggregate<string, object>(u, (current, prop) => current.GetType().GetProperty(prop).GetValue(current, null));
return list.Contains(value.ToString());
}
As I said I once had SOME version of this working, but cannot figure out what has changed. Is there something blatantly obvious that I am missing that would help me get this functional again?
Edit: As far as I can tell the ListContainsProperty method is never actually running. Adding a "throw new Exception()" does nothing. I just get the full unfiltered list back. | 0 |
2,684,413 | 04/21/2010 15:45:24 | 322,457 | 04/21/2010 15:45:24 | 1 | 0 | Is it possible to have variable find conditions for both the key and value? | I'm trying to pass in both the field and the value in a find call:
@employee = Employee.find(:all, :conditions => [ '? = ?', params[:key], params[:value].to_i)
The output is
SELECT * FROM `employees` WHERE ('is_manager' = 1)
Which returns no results, however when I try this directly in mysqsl using the same call without the '' around is_manager, it works fine. How do I convert my params[:key] value to a symbol so that the resulting SQL call looks like:
SELECT * FROM `employees` WHERE (is_manager = 1)
Thanks,
D | ruby-on-rails | null | null | null | null | null | open | Is it possible to have variable find conditions for both the key and value?
===
I'm trying to pass in both the field and the value in a find call:
@employee = Employee.find(:all, :conditions => [ '? = ?', params[:key], params[:value].to_i)
The output is
SELECT * FROM `employees` WHERE ('is_manager' = 1)
Which returns no results, however when I try this directly in mysqsl using the same call without the '' around is_manager, it works fine. How do I convert my params[:key] value to a symbol so that the resulting SQL call looks like:
SELECT * FROM `employees` WHERE (is_manager = 1)
Thanks,
D | 0 |
11,153,734 | 06/22/2012 09:38:53 | 1,343,071 | 04/19/2012 05:18:56 | 1 | 0 | Bad operator (�): At line 1 in /usr/share/snmp/mibs/ZYXEL-ES2108G-MIB.txt | Bad operator (�): At line 1 in /usr/share/snmp/mibs/ZYXEL-ES2108G-MIB.txt...while executing snmptranslate command m getting this error...What is the meaning of that???? any help | snmp | mibs | null | null | null | null | open | Bad operator (�): At line 1 in /usr/share/snmp/mibs/ZYXEL-ES2108G-MIB.txt
===
Bad operator (�): At line 1 in /usr/share/snmp/mibs/ZYXEL-ES2108G-MIB.txt...while executing snmptranslate command m getting this error...What is the meaning of that???? any help | 0 |
4,930,431 | 02/08/2011 07:02:09 | 547,573 | 12/19/2010 09:03:18 | 53 | 2 | javascript: Which is the powerful Javascript - Framework to fulfill my needs. | I am building an application which uses Following features in it.
1. Popup Window
2. Transition effects.
3. Heavy contents in popup Window(like thousands of tags).
4. Pipelining for client server communication.(like BigPipe in Facebook)
5. Faster to switch between pages.
In this case,
Is Prototype more superior than mootools?
Is there any other more powerfull frameworks i should use to build the application?
| javascript | prototype | mootools | javascript-framework | null | 02/09/2011 18:24:37 | not constructive | javascript: Which is the powerful Javascript - Framework to fulfill my needs.
===
I am building an application which uses Following features in it.
1. Popup Window
2. Transition effects.
3. Heavy contents in popup Window(like thousands of tags).
4. Pipelining for client server communication.(like BigPipe in Facebook)
5. Faster to switch between pages.
In this case,
Is Prototype more superior than mootools?
Is there any other more powerfull frameworks i should use to build the application?
| 4 |
11,339,748 | 07/05/2012 07:35:10 | 1,228,193 | 02/23/2012 11:20:54 | 17 | 0 | Is there a way to work with vaadin and jpa without JpaContainer? | I'm trying to do a simple prove of concept with Vaadin and JPA Persistence layer.
I have a Bean with @OneToMany relationships with fetchType = Lazy and when I trying to add a collection of this beans into a table with my DAO. I have the next exception:
Caused by: org.hibernate.LazyInitializationException: failed to lazily initialize a collection of role: common.domain.Bill.detail, no session or session was closed
Is there a way to work with Vaadin and JPA without a JPAContainer?
Thanks. | hibernate | jpa | vaadin | null | null | null | open | Is there a way to work with vaadin and jpa without JpaContainer?
===
I'm trying to do a simple prove of concept with Vaadin and JPA Persistence layer.
I have a Bean with @OneToMany relationships with fetchType = Lazy and when I trying to add a collection of this beans into a table with my DAO. I have the next exception:
Caused by: org.hibernate.LazyInitializationException: failed to lazily initialize a collection of role: common.domain.Bill.detail, no session or session was closed
Is there a way to work with Vaadin and JPA without a JPAContainer?
Thanks. | 0 |
6,756,554 | 07/20/2011 03:03:54 | 820,161 | 06/28/2011 23:59:51 | 1 | 0 | C# - Convert DateTime format yyyy-MM-dd | I am trying to change the DateTime format from "dd/MM/yyyy" to "yyyy-MM-yyyy"
This is what I have at the moment:
DateTime date = Convert.ToDateTime("31/01/2000");
Console.WriteLine(date);
String format = "yyyy-MM-dd";
String dateStr = date.ToString(format);
Console.WriteLine(dateStr);
DateTime parsedDate = DateTime.ParseExact(dateStr, format, CultureInfo.InvariantCulture);
Console.WriteLine(parsedDate);
I get these results:
31/01/2000 12:00:00 AM
2000-01-31
31/01/2000 12:00:00 AM
Ultimately, I want the last result to be 2000-01-31 | c# | datetime-format | null | null | null | 07/20/2011 11:52:57 | not a real question | C# - Convert DateTime format yyyy-MM-dd
===
I am trying to change the DateTime format from "dd/MM/yyyy" to "yyyy-MM-yyyy"
This is what I have at the moment:
DateTime date = Convert.ToDateTime("31/01/2000");
Console.WriteLine(date);
String format = "yyyy-MM-dd";
String dateStr = date.ToString(format);
Console.WriteLine(dateStr);
DateTime parsedDate = DateTime.ParseExact(dateStr, format, CultureInfo.InvariantCulture);
Console.WriteLine(parsedDate);
I get these results:
31/01/2000 12:00:00 AM
2000-01-31
31/01/2000 12:00:00 AM
Ultimately, I want the last result to be 2000-01-31 | 1 |
11,441,315 | 07/11/2012 20:53:29 | 1,518,921 | 07/11/2012 19:54:37 | 3 | 0 | remove virtualbox additions fail Debian | I'm using Debian Linux with LXDE
I'm removing the VBoxGuestAdditions with the following command:
> su
>
> sh /opt/VBoxGuestAdditions/uninstall.sh
After rebooting the machine
However Debian does not start (does not reach the gdm3)
I tried using the Recovery, but solves nothing. | linux | debian | virtualization | virtualbox | null | 07/11/2012 21:52:48 | off topic | remove virtualbox additions fail Debian
===
I'm using Debian Linux with LXDE
I'm removing the VBoxGuestAdditions with the following command:
> su
>
> sh /opt/VBoxGuestAdditions/uninstall.sh
After rebooting the machine
However Debian does not start (does not reach the gdm3)
I tried using the Recovery, but solves nothing. | 2 |
11,737,163 | 07/31/2012 09:35:28 | 1,285,334 | 03/22/2012 08:03:11 | 23 | 2 | Android dynamic interface tablerow | I am developing an app that creates a dynamic interface according to a string set by the user.
The only thing i've got in my XML file, is a scrollview, the rest is in java.
ScrollView sv = (ScrollView)findViewById(R.id.sv);
LinearLayout ll = new LinearLayout(this);
ll.setOrientation(LinearLayout.VERTICAL);
TableLayout tl = new TableLayout(this);
TableRow[] tr = null;
Then i desipher a string, which will tell me how many buttons i need to add. Next to each button should be a textview.
So in a for-loop, i create the buttons and the textviews, and add them to the tablerow, which i add to the tablelayout, which i add to the linearlayout which i add to the scrollview.
My problem is: i want the buttons to be, say 200dp wide, followed by the textview - but it takes the width from WRAP_CONTENT. Setting the size of the button with RelativeLayout and SetLayoutParams, does not work when i add it to the tablerow.
final float scale = getBaseContext().getResources().getDisplayMetrics().density;
int pixels = (int) (200 * scale + 0.5f);
RelativeLayout.LayoutParams rel_btn = new RelativeLayout.LayoutParams(
LayoutParams.WRAP_CONTENT, LayoutParams.WRAP_CONTENT);
rel_btn.height = pixels;
rel_btn.width = pixels;
btn.setLayoutParams(rel_btn);
tr[i].addView(btn);
tr[i].addView(tv);
tl.addView(tr[i]);
Does anyone have an idea on how to fix my problem with the tablelayout?
I've read that nested linearlayouts might be a different approach, but i cant seem to find any java examples, only XML - and i need it to be dynamic. | android | gui | dynamic | tablelayout | null | null | open | Android dynamic interface tablerow
===
I am developing an app that creates a dynamic interface according to a string set by the user.
The only thing i've got in my XML file, is a scrollview, the rest is in java.
ScrollView sv = (ScrollView)findViewById(R.id.sv);
LinearLayout ll = new LinearLayout(this);
ll.setOrientation(LinearLayout.VERTICAL);
TableLayout tl = new TableLayout(this);
TableRow[] tr = null;
Then i desipher a string, which will tell me how many buttons i need to add. Next to each button should be a textview.
So in a for-loop, i create the buttons and the textviews, and add them to the tablerow, which i add to the tablelayout, which i add to the linearlayout which i add to the scrollview.
My problem is: i want the buttons to be, say 200dp wide, followed by the textview - but it takes the width from WRAP_CONTENT. Setting the size of the button with RelativeLayout and SetLayoutParams, does not work when i add it to the tablerow.
final float scale = getBaseContext().getResources().getDisplayMetrics().density;
int pixels = (int) (200 * scale + 0.5f);
RelativeLayout.LayoutParams rel_btn = new RelativeLayout.LayoutParams(
LayoutParams.WRAP_CONTENT, LayoutParams.WRAP_CONTENT);
rel_btn.height = pixels;
rel_btn.width = pixels;
btn.setLayoutParams(rel_btn);
tr[i].addView(btn);
tr[i].addView(tv);
tl.addView(tr[i]);
Does anyone have an idea on how to fix my problem with the tablelayout?
I've read that nested linearlayouts might be a different approach, but i cant seem to find any java examples, only XML - and i need it to be dynamic. | 0 |
6,630,902 | 07/08/2011 21:51:01 | 496,273 | 11/03/2010 17:35:52 | 1 | 0 | An easy to use 3D graphics engine for a simple game? | There's tons of lists of 3D graphics engines out there, but my needs are a little restrictive and I can't decide on one by myself.
I'm about to start working on a fairly simple (**C++**) game that simulates realistically the motion of a spacecraft in the solar system. As you might guess, **the graphics needed are very basic**:
- The planets are just spheres with textures;
- The spacecraft have few or no moving parts (rotation and translation only);
- I might need a few lighting/animation effects to make it pretty.
[Celestia][1] is aesthetically very close to what I'm thinking about.
Now, the problem is that until now I've only used C++ for scientific simulations, and I have **no experience** whatsoever in graphical interfaces and games in general.
Also, I don't want to spend months learning how to use a complex engine.
My question is: **which engine is easy to learn and use, while still producing nice-looking graphics?** I'm looking for the best balance.
As far as I can tell, the 3 most suggested OSS engines are Ogre3D, Irrlich and Crystal Space 3D. By comparing a few youtube videos, Crystal Space's graphics look the best, but it's apparently a bit messy to use. They say that Irrlich is easier, but to me it also looks inferior in terms of graphical results. Ogre3D looks good but I don't know how much beginner-friendly it is.
I would really appreciate suggestions on this!
[1]: http://www.shatters.net/celestia/gallery.html
| c++ | 3d | null | null | null | 07/11/2011 00:14:35 | not constructive | An easy to use 3D graphics engine for a simple game?
===
There's tons of lists of 3D graphics engines out there, but my needs are a little restrictive and I can't decide on one by myself.
I'm about to start working on a fairly simple (**C++**) game that simulates realistically the motion of a spacecraft in the solar system. As you might guess, **the graphics needed are very basic**:
- The planets are just spheres with textures;
- The spacecraft have few or no moving parts (rotation and translation only);
- I might need a few lighting/animation effects to make it pretty.
[Celestia][1] is aesthetically very close to what I'm thinking about.
Now, the problem is that until now I've only used C++ for scientific simulations, and I have **no experience** whatsoever in graphical interfaces and games in general.
Also, I don't want to spend months learning how to use a complex engine.
My question is: **which engine is easy to learn and use, while still producing nice-looking graphics?** I'm looking for the best balance.
As far as I can tell, the 3 most suggested OSS engines are Ogre3D, Irrlich and Crystal Space 3D. By comparing a few youtube videos, Crystal Space's graphics look the best, but it's apparently a bit messy to use. They say that Irrlich is easier, but to me it also looks inferior in terms of graphical results. Ogre3D looks good but I don't know how much beginner-friendly it is.
I would really appreciate suggestions on this!
[1]: http://www.shatters.net/celestia/gallery.html
| 4 |
6,718,100 | 07/16/2011 14:47:41 | 435,951 | 05/05/2010 03:08:39 | 1,667 | 8 | Ruby on Rails 3 Engine Development | What books do you recommend on Rails 3 internals?
Thanks
| ruby-on-rails-3 | books | null | null | null | 07/16/2011 22:31:36 | not constructive | Ruby on Rails 3 Engine Development
===
What books do you recommend on Rails 3 internals?
Thanks
| 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.