Linked List, Stacks and Other Data Structures in Objective-C 2.0

I've checked a little throughout documentation that Apple provides for the different frameworks in order to determine if there were ready-made classes for data structures such as linked lists, stacks and so forth but there don't appear to be any available? Is this correct?

NSArray and NSDictionary are the multi-purpose built-in aggregate types. If you need something else then you can use STL or roll your own.

Similar Messages

WPC - link list, teaser and etc cannot appear in web page

dear expert,
i have created web page using web page composer. in the web page i added link list, teaser, banner and etc..but when i published the web page,the link list, teaser and etc cannot display. Error "Cannot render container : An error occurred while loading the document from the resource content" was appeared. any idea what error is?
thanx in advance,
faeza

Hi all,
Thank you on all your points. I have fixed this problem. the problem is the /etc repository is not working. To check it i refer to SAP Note 1178294 regarding /etc repository in cluster environment. The /etc repository is used by the XML form. All my content in my web page such link list, teaser and etc is most often built using XML form.
Regards,
Faeza

I have 646 websites that have stored cookies and other data on my computer. How necessary is it to keep these stored files? My thought is to delete them. Input?

Good Morning,
I have 646 websites that have stored "cookies and other data" on my comupter. How necessary is it to keep these?? My thought is to delete them. Any advice?

I have never encountered a site to which I couldn't log in again after trashing its cookie(s). If you use Firefox (Preferences), you can list exceptions of cookies you don't want removed (e.g., for startpage and duckduck searching, I keep startpage and duckduck cookies in order to keep those search settings) and those you never want to accept (I have all Google cookies blocked. Doesn't keep me from using Google search, images or maps, but if you belong to a Google group or run some kind of Google program, that may be a problem.) Safari probably has some cookie manager extension available for that also.
If you use Firefox, NoScript will effectively block all google tracking that occurs on mousedown.
In your browser>Preferences, make sure you don't allow third party sites to store cookies.
What's even more worrisome than ordinary cookies, are Flash cookies ("Local Shared Objects"), which are persistent cookies, including the "evercookie." They aren't stored in the browser.
With Firefox, you can deal with this by using the Better Privacy Add-on, or see this post of mine, as modified by Kurt Lang.
https://discussions.apple.com/message/19349393#19349393

I have installed the latest version of iOS in my ipad but forgot to backup the content, what should i do!!! I don't want my media and other data erased, how can i find back all the data in my ipad? I haven't restore ipad yet, so any others way can be use?

I have installed the latest version of iOS in my ipad but forgot to backup the content, what should i do!!! I don't want my media and other data erased, how can i find back all the data in my ipad? I haven't restore ipad yet, so any others way can be use? Now my ipad is in recovery mode.

Once you are in Recovery Mode, it's too late to do any backup. I am afraid you are going to lose your data.

HT1766 all my contacts photos and other data is not seen in my laptop and iphone after i installed itunes in my laptop

all my photos and contacts and other data is missing after i installed itunes in my laptop and conected my iphone and updated and syncranised it

No. If you made your backup to iCloud, iTunes will not restore from an iCloud backup. See:
iOS: Backing Up and Restoring Data to a New Device

Mac system updates wipe all my saved passwords and other data

Every time my macbook performs a system update (which all you mac users know is weekly or bi-weekly) all of my passwords are wiped, as well as any address, phone number, and other data for filling in fields.
Is this supposed to happen? Is there a way to avoid it?
I only just started using Firefox a month ago when the Flock programmers turned stooges, so if I can't avoid this it's not too late for me to switch to a different browser.

You should get your data back when you leave Private Browsing mode, i.e. remove the checkmark and restart Firefox.
Firefox stores the open tabs in the sessionstore.js file, so make sure that Session Restore is working properly.
You can reset <b>browser.sessionstore.*</b> prefs that are user set (bold) to the default value via the right-click context menu on the <b>about:config</b> page to make sure that Session Restore is enabled and working properly.
*http://kb.mozillazine.org/Session_Restore
*https://support.mozilla.org/kb/restore-previous-session

I have followed "Importing favorites and other data from Internet Explorer" but although I've worked through the dtages and it says it has worked, the expected internet explorer folder does not appear in bookmarks

I have installed Firefox today, and like the look of and the speed. But I have an extensive set of foldersin my IE Favorites and remebered passwords I don't want to have to reimput.
I have now tried twice folowing "Importing favorites and other data from Internet Explorer " which seemed to go smoothly, once with IE open and the other with it closed, and closed down my PC between each attempted installation. Any ideas?

It usually works better if you export the Favorites in IE to an HTML file and import that file in the Firefox Bookmarks Manager.
* Export the favorites in IE to an HTML file (bookmarks.html): File > Import and Export
* Import the HTML file in Firefox: Bookmarks > Organize Bookmarks > Import & Backup > Import HTML: From File
See also http://kb.mozillazine.org/Import_bookmarks ("Import from another browser" and "Import from file")

HT1364 How do I uninstall Itunes for windows7 without losing my playlists and other data? My library is on another drive rather than the My Music folder?

How do I uninstall Itunes for windows7 without losing my playlists and other data? My library is on another drive rather than the My Music folder?

Your iTunes library isn't deleted when you uninstall it, so uninstall iTunes without worrying about this

HT201442 restoring and other data

why can't I restore my iphone? My "other" data is taking up 5GB of my 6.34 capacity storage. Have erased all photos, videos, apps and music. when i try to restore I get a message that: could not restore, the device isn't eligible for the requested build. Anyone have any suggestions to: a) get the other data off my phone, b) restore phone?!!??!
Any advice appreciated.

Like every other operating system, iOS stores temporary files and app caches locally on the iPhone, iPad, and iPod touch, and these files can build up over time. Generally iOS is pretty good at housekeeping, but if you’ve had a device for a long time and haven’t deleted old unused apps, resynced recently, or restored from a backup, you may have more of these temporary files and caches stored on your iOS device than you think.
You can use apps like iLike, Phoneclean to remover these junk files and "other" data:
iLike: http://download.cnet.com/iLike/3000-18512_4-75996452.html

Partion drive with TM and other data already on it

hi folks
I'd like to partion an ext. FW drive with TM and other data (music files) already on it. can this be done w/o erasing the data already on the ext. drive?
Thanks,
Chuck s

rhyhman32 wrote:
thanks V.K. So, this process will not erase my data?
If I already have, as I mentioned, my iTunes music and Time Machine data on this ext. FW drive, can I place the data in each new partition?
that's right, the data should be preserved. it will remain on one partition and a new empty partition will be created below it. you can move your Music library to the new partition. DO NOT move your TM backups. they can not be moved using Finder.

If i reset my ipad will my contacts and other datas in my iphone be deleted also? I am using i cloud on both ipad and iphone

IF i reset my ipad will my contacts and other datas on my ihone be deleted also?. both are on icloud

if you "reset all content and settings" your phone will go back to its out of box factory settings

Relationship between Dynamic Memory Heap and Heap Data Structure

This question is not strictly related to Java, but rather to programming in general, and I tend to get better answers from this community than any where else.
Somehow, my school and industry experience have somehow not given me the opportunity to explore and understand heaps (the data structure), so I'm investigating them now, and in particular, I've been looking at applications. I know they can be used for priority queues, heap sorts, and shortest path searches. However, I would have thought that, obviously, there must be some sort of relationship between the heap data structure, and the dynamic memory heap. Otherwise, I can think of no good reason why the dynamic memory heap would be named "heap". Surprisingly, after searching the web for 90 minutes or so, I've seen vague references, but nothing conclusive (trouble seems to be that it's hard to get Google to understand that I'm using the word "heap" in two different contexts, and similarly, it would not likely understand that web authors would use the word in two different contexts).
The Java Virtual Machine Spec is silent on the subject, as "The Java virtual machine assumes no particular type of automatic storage management system, and the storage management technique may be chosen according to the implementor's system requirements."
I've seen things like:
[of dynamic memory] "All the blocks of a particular size are kept in a sorted linked list or tree (I extrapolate that sorted tree could imply heap)"
[of dynamic memory] "The free and reserved areas of memory are maintained in a data structure similar to binary trees called a heap"
[of dynamic memory] "This is not related to the heap data structure"
[of dynamic memory] "Not to be confused with the data structure known as a "heap"
[of data structure] "Not to be confused with the dynamic memory pool, often known as TheHeap"
At this point, I've come to surmise that some (but not all) memory management algorithms use heaps to track which (pages? blocks? bytes?) of memory are used, and which are not. However, the point of a heap is to store data so that the max (or min) key is at the root of the heap. But we might want to allocate memory of different sizes at different times, so it wouldn't make sense to key on the amount of available memory in a particular region of the free store.
I must assume then that there would be a different heap maintained for each size of memory block that can be allocated, and the key must have something to do with the attractiveness of the particular memory block in the heap (perhaps the lowest address, resulting, hopefully, in growing the free store space less often, leaving more space for the stack to grow, or perhaps keyed based on the fragmentation, to hopefully result in less fragmentation, and therefore more efficient use of the memory space, or perhaps based on page boundaries, keeping as much data in the same page as possible, etc).
So at this point, I have a few questions I've been unable to resolve completely:
1. Am I correct that the heap was so named because (perhaps at one point in time), a heap is/was commonly used to track the available memory in the free store?
2. If so, would it be correct that there would be a heap per standard block size?
3. Also, at what level of granularity would a heap typically be used (memory page, memory blocks, individual words (4-bytes))?
4. What would be the most likely property one would use as a key. That is, what makes the root item on the heap ideal?
5. Would a industrial strength system like the jvm use a (perhaps modified or tuned) heap for this sort of task, or would this typically be too naive for an real world solution today?
Any insight would be awesome!
Thanks,
A.

jschell wrote:
I think you are not only mixing terms but domains.
For starters the OS allocs memory. Applications, regardless of language, request memory from the OS and use it in various ways.
There are many variations of the term "heap" like the following.
[http://en.wikipedia.org/wiki/Heap_(data_structure)]
[http://en.wikipedia.org/wiki/Dynamic_memory_allocation]
A java VM will request memory from the OS (from a 'heap') and use it in its application 'heap' (C/C++) and then create the Java 'heap'. There can be variations of that along the way that can and likely will include variations of how each heap is used, potentially code that creates its own heap, and potentially other allocators which use something which is not a heap.This last part, I find a bit confusing. By "use something which is not a heap", do you mean the heap data structure, or the dynamic memory pool meaning of heap? If the former, then you would be implying that it would be common for a heap data structure to be used to manage the heap dynamic memory pool. If the latter, what would this "something which is not a heap" be? The best definition of "heap" I've found simply states that it is a pool of memory that can be dynamically allocated. If there is some other way of allocating dynamic memory, then it would suggest that the previous definition of "heap" is incomplete.
>
So to terms.
1. Am I correct that the heap was so named because (perhaps at one point in time), a heap is/was commonly used to track the available memory in the free store?Which 'heap'? The VM one? It is probably named that because the implementors of the Sun VM were familar with how C++ and Smalltalk allocated memory.Okay, but that begs the question, was the heap in C++ and/or Smalltalk so named for the above queried reason?
>
2. If so, would it be correct that there would be a heap per standard block size?Not sure what you are referring to but probably a detail of the implementation. And since there are different levels the question doesn't mean much.
However OS allocations are always by block if that helps. After that it requires making the question much, much more specific.
3. Also, at what level of granularity would a heap typically be used (memory page, memory blocks, individual words (4-bytes))?Again not specific enough. A typical standard implementation of heap could not be at the word level. And it is unlikely, but not impossible, that variations would support word size allocations.
The VM heap might use word boundaries (but not size), where the application heap certainly does (word boundary.)My understanding of it is that the application would request blocks from the OS, and then something like malloc would manage the memory within the allocated blocks. malloc (or whatever equivalent Java uses) would have to keep track of the memory it has allocated somehow, and I would think it would have to do this at the word level, since it's most commonly going to allocate memory at the word level to be references to other objects, etc.
So I guess my question here would really be, if the dynamic memory heap is so named because there has been a memory management strategy that relied upon a heap data structure (which I've found no proof, but have found some suggestive literature), then would that probably have applied at the OS Page Fault level, tracking allocated blocks, or would that have applied at the malloc level, allocating individual words as necessary?
>
4. What would be the most likely property one would use as a key. That is, what makes the root item on the heap ideal?"Key" is not a term that will apply in this discussion.
You appear to be referring to strategies for effective allocation of memory such as allocations from different regions by size comparison.
It is possible that all levels might use such an allocator. General purpose applications do not sort allocations though (as per your one reference that mentions 'key'.) Sorry, I got the term "key" from an article I read regarding heaps, that indicates that a "key" is used to sort the elements, which I guess would be a more generalized way to make a heap than assuming a natural ordering on the elements in the heap. I'm not sure if the terminology is standard.
>
5. Would a industrial strength system like the jvm use a (perhaps modified or tuned) heap for this sort of task, or would this typically be too naive for an real world solution today?Again too indefinite. The Sun VM uses a rather complicated allocator, the model for which originated after years of proceeding research certainly in Smalltalk and in Lisp as well, both commercially and academically.
I am sure the default is rules driven either explicitly or implicitly as well. So it is self tuning.
There are command line options that allow you to change how it works as well.I guess perhaps I could attempt to clarify my initial question a bit.
There is a 1:1 correspondence between the runtime stack, and a stack data structure. That is, when you call a function, it pushes a stack frame onto the runtime stack. When you return from a function, it pops a stack frame from the runtime stack. This is almost certainly the reasons the runtime stack is named as it is.
The question is, is there or has there ever been a 1:1 correspondence between some aspect of the dynamic memory heap or how it is managed, and a heap data structure? If so, it would explain the name, but I'm a bit puzzled as to how a heap data structure would be of assistance in creating or managing the dynamic memory heap. If not, on the other hand, then does anybody know where the name "heap" came from, as it applies to the dynamic memory pool?
A.

Tabular Form and Link to document and No Data Found error

I have used this numerous times in an INTERACTIVE REPORT to link records out from the report to a document in a folder on our server and it works beautifully thanks to one of you guys who helped me a couple of years ago. In the column for which I want to use as a link I do the following:
LINK TEST #ISO_NUMBER#
LINK ATTRIBUTES a href=#DOC_LINK#; TARGET="_BLANK"
URL #DOC_LINK#
I've been banging my head against the wall trying to figure out why I keep getting a 'No data found' error in my TABULAR FORM. The good news is I figured out why it's happening. The bad news is I do need to link out to the documents listed in my tabular form that are saved on the server.
Is there any other way to do this?
Application Express 4.0.0.00.46
TIA,
Alexandra

Finally back...
I have a tabular form that lists documents stored on one of our servers. In an interactive report I can set up a link to those docs using the document number column in the IR. I can't get it to work in the same way on the tabular form. Hopefully the steps of the catalog process will shed light on what may be the problem:
Step One
1. User1 catalogs doument using standard form (page 3) on DOC_INFO table.
2. Button on form redirects to Approval Tabular Form (for this example, page 100). This tabular form displays DOCUMENT_NUMBER (display as text saves state), APPROVER (select list), APPROVED(select list), RELEASED (select list) fields among others from DOC_APPRV_DOC table
3. Add Row adds fields in #2 above and other fields
4. User1 selects APPROVER in select list and Adds Row for all additional APPROVERS required
5. User1 hits SUBMIT button
Step Two
1. User2 opens different page but Approval Tabular Form (for this example, page 200) on same DOC_APPRV_DOC table, restricted to :P101_USERNAME
2. User2 uses APPROVED select list to approve or reject
3. User2 hits SUBMIT button
Step Three
1. User1 opens Approval Tabular Form (page 100) with User2 (and all other documents requiring approval) results
2. If rejected User1 uses Reset Approval checkbox and select list on User2's tabular form is reset
3. If approved User1 uses Released submit list and and record is deleted from User2's tabular form
The Problem
User2 ought to be able to review each of these documents on the server. In other parts of my application, an interactive report is used, I've got a case statement in the report creating the link, and have the column itself setup up so that User2 merely clicks on the DOCUMENT_NUMBER on the report and he's redirected to the document itself.
This works fine when set up the same way on the tabular form ONLY THE FIRST TIME a row is added. If I ADD ROW for any additional documents the DOCUMENT_NUMBER field on the tabular form does not populate on User1's form.
The entire process works beautifully if the link is not set up.
Note that from the standard form, the DOCUMENT_NUMBER is sent to a hidden item (default = :P3_DOCUMENT_NUMBER) in a region above the tabular form (page 100). This is then used to populate the DOCUMENT_NUMBER on the tabular form as the default value (:P200_DOCUMENT_NUMBER).
Your thoughts? Thanks in advance!
Alexandra

Linked Lists, Hashing, and sore heads.

I am working with a team on a java program as part of an algorithms assignment. We have completed the program however I'm convinced its not working. The program is supposed to carry out a defined number of searches, additionions and deletions to a linked list and time it. We have been supplied with a number of ext files with random numbers for testing purposes.
The text files are different sizes. We are finding that our results are the same regardless which file we use and which arguments are passed into the program. I would be greatful if someone could cast their eye over the work and let us know what you think.
All files are at
http://students.odl.qmul.ac.uk/~dm07/algorithms/.
IntSet.java is the program we have completed from a skeleton code.
Evaluator.java is the wrapper provided. data.zip is a full file of the
different test text files although there are two on here for quick download.
Any direction or feedback would be really appreciated.
Dermot.

Here is the result for the 50 random numbers text file :
D:\Coursework\Algorithms>java Evaluator size-50-random.txt 10000
Setting up, please wait ...
Finished setting up.
Start searches
It took 0.010 seconds for 10000 searches
It took 0.020 seconds for 10000 additions
It took 0.010 seconds for 10000 deletions
And here is the result for hte 50000 random numbers text file :
D:\Coursework\Algorithms>java Evaluator size-50000-random.txt 10000
Setting up, please wait ...
Finished setting up.
Start searches
It took 0.010 seconds for 10000 searches
It took 0.020 seconds for 10000 additions
It took 0.000 seconds for 10000 deletions
As you can see they are virtually identical. Even after running a number of times and working out averages they are the same. I thought that the results should be exponential but they are not. I understand that results should change from pc setup to pc setup, depending on processor etc but we are not getting this.
Dermot.

How Do I Filter a Report Using a Multi Select List Box and Specifying Date Between Begin Date and End Date

Hope someone can help. I have tried to find the best way to do this and can't seem to make sense of anything. I'm using an Access 2013 Database and I have a report that is based on a query. I've created a Report Criteria Form. I
need the user to be able to select multiple items in a list box and also to enter a Begin Date and End Date. I then need my report to return only the records that meet all selected criteria. It works fine with a ComboBox and 1 selection but can't
get it to work with a List Box so they can select multiple items. Any help is greatly appreciated while I still have hair left.

The query should return all records.
Let's say you have the following controls on your report criteria form:
txtStart: text box, formatted as a date.
txtEnd: text box, formatted as a date.
lbxMulti: multi-select list box.
cmdOpenReport: command button used to open the report.
The text boxes are used to filter the date/time field DateField, and the list box to filter the number field SomeField.
The report to be opened is rptReport.
The On Click event procedure for the command button could look like this:
Private Sub cmdOpenReport_Click()
Dim strWhere As String
Dim strIn As String
Dim varItm As Variant
On Error GoTo ErrHandler
If Not IsNull(Me.txtStart) Then
strWhere = strWhere & " AND [DateField]>=#" & Format(Me.txtStart, "yyyy-mm-dd") & "#"
End If
If Not IsNull(Me.txtEnd) Then
strWhere = strWhere & " AND [DateField]<=#" & Format(Me.txtEnd, "yyyy-mm-dd") & "#"
End If
For Each varItm In Me.lbxMulti.ItemsSelected
strIn = strIn & "," & Me.lbxMulti.ItemData(varItm)
Next varItm
If strIn <> "" Then
' Remove initial comma
strIn = Mid(strIn, 2)
strWhere = strWhere & " AND [SomeField] In (" & strWhere & ")"
End If
If strWhere <> "" Then
' Remove initial " AND "
strWhere = Mid(strWhere, 6)
End If
DoCmd.OpenReport ReportName:="rptMyReport", View:=acViewPreview, WhereCondition:=strWhere
Exit Sub
ErrHandler:
If Err = 2501 Then
' Report cancelled - ignore
Else
MsgBox Err.Description, vbExclamation
End If
End Sub
If SomeField is a text field instead of a number field, change the line
strIn = strIn & "," & Me.lbxMulti.ItemData(varItm)
to
strIn = strIn & "," & Chr(34) & Me.lbxMulti.ItemData(varItm) & Chr(34)
Regards, Hans Vogelaar (http://www.eileenslounge.com)

Linked List, Stacks and Other Data Structures in Objective-C 2.0

Similar Messages

Maybe you are looking for