Understanding TreeSet

Hello, I'm reading about generics, getting prepared for the SCJP exam..., so I made a little example about TreeSet:
TreeSet<Persona> ts = new TreeSet<Persona>();
        ts.add(new Persona("pablo",25,"1"));
        ts.add(new Persona("maria",25,"2"));
        ts.add(new Persona("ana",44,"3"));
        ts.add(new Persona("ana",46,"4"));
        System.out.println(ts.toString());
        The PROBLEM with this example is that the treeset doesnt save "maria" (the 2nd object in the list). Can someone tell me why?? I'm implementing Comparable and overriding equals and hashcode. I found out that when the age is equal for two or more object, the object doesnt get stored. I expected that this happened when the id's where equal, but why the age? please help me.
The Persona class is about saving info of people. A litle spanish class: persona=person,nombre=name, edad=age, and id...you all know what id means! :p
public class Persona implements Comparable<Persona> {
    private String nombre;
    private int edad;
    private String id;
    /*public Persona(String nombre, int edad) {
    this.nombre = nombre;
    this.edad = edad;
    public Persona(String nombre, int edad, String id) {
        this.nombre = nombre;
        this.edad = edad;
        this.id = id;
    //getters and setters over here (intentionally deleted)...
    @Override
    public String toString() {
        return "Nombre: " + this.nombre+ " Edad: " + this.edad;
    @Override
    public boolean equals(Object obj) {
        if ((obj instanceof people.Persona) && (obj != null)) {
            if (((Persona) obj).getId().equals(this.getId())) {
                return true;
        return false;
    @Override
    public int hashCode() {
        int hash = 5;
        hash = 53 * hash + (this.id != null ? this.id.hashCode() : 0);
        return hash;
    public int compareTo(Persona o) {
        if (this.getEdad() > o.getEdad()) {
            return 1;
        } else if (this.getEdad() < o.getEdad()) {
            return -1;
        } else {
            return 0;
}

Some notes not mentioned so far.
>
@Override
public boolean equals(Object obj) {
if ((obj instanceof people.Persona) && (obj != null)) {
if (((Persona) obj).getId().equals(this.getId())) {
return true;
return false;
}You have prepared a possible trap here: Testing with instanceof can violate symmetry of equals if you have a subclass of Persona which has a different meaning of equals.
       if (obj == null || obj.getClass() != this.getClass()) {
         return false;
       }If you are absolutely sure that subclasses' implementation of equals don't violate symmetry you can simplify the test to:
    if (obj instanceof Persona) {This will be false if obj==null.
@Override
public int hashCode() {
int hash = 5;
hash = 53 * hash + (this.id != null ? this.id.hashCode() : 0);
return hash;
}Much to complicated. Appears like a copy-and-paste from a class where the test covered multiple variables. In those cases such a test makes sense.
Here just change to:
    @Override
    public int hashCode() {
        return id == null ? 0 : id.hashCode();
public int compareTo(Persona o) {
if (this.getEdad() > o.getEdad()) {
return 1;
} else if (this.getEdad() < o.getEdad()) {
return -1;
} else {
return 0;
}As already pointed out by others this is what caused your problem. If you want to sort by age, you have to implement your own Comparator and pass it to the constructor of your TreeSet.

Similar Messages

TreeSet, TreeMap or Comparable?

I'm simply tackling this problem concerning a list of employee's and their division # within a company...
Misino, John          8
Nguyen, Viet                          14
Punchenko, Eric          6
Dunn, Michael          6
Deusenbery, Amanda          14
Taoubina, Xenia          6They're suppose to be stored in alphabetical order...My thing is, should this be approached using TreeSet, TreeMap or Comparable...From what I understand each one is, both TreeSet and TreeMap are both red/black tree implemenations of a binary search tree and TreeSet stores data with an element and a TreeMap a seperate key is created and stored in the collection while the data is stored somewhere else...Comparable seems to be used by either method considering that they are sorted and put into order in either case...Inputs anyone? I believe the information above is true, but they seem very similiar in characteristic, to me at least...

If you're going to put it into a TreeSet or TreeMap,
either it needs to implement Comparable, or you need
to provide a Comparator.
Implement Comparable if there's a sensible "natural"
way to sort it--e.g. by last name then first, or by
employee ID. Provide a Comparator if you want to sort
by some arbitrary criteria that aren't necessarily a
"natural" way to sort this class--e.g. years of
service.
Whether you use the Set or the Map depends on how you
will access the elements. Will you just iterate over
them sequentially (Set) or will you need to access
them at random by some key (Map)?This list will be sorted by last name only...And yeah, I suppose a lot of the factor using either Set or Map depends on the accessing of elements - In general though, I think that TreeMap would be sufficient because doesn't it provides guaranteed log(n) time cost for the containsKey, find/get, insert and remove/delete operations...

Trouble removing some elements of a TreeSet/SortedSet

I've been stuck with this for quite a while, having been able to work around it, but now it's really getting annoying.
I'm using a TreeSet (using a SortedSet to have it synchronized) containing a list of nodes. Each node has a priority value, which is used as a key to sort the set.
I can use this successfully but after some time, when I want to remove a certain node, the call to remove doesn't succeed in removing the element from the set, the element is still in the set after the call. I checked my comparator manytimes, and everything seems to work fine there, I tracked the call and although my node is in the set, when the comparator is called, all the elements of the set don't seem to be tested, and the actual position of the node in the set "ignored" as several other elements.
in fact, I use two TreeSets, but they aren't not using the same comparator, so I don't think I have a conflit in there.
here is a very light version of the node class and the comparators (won't run, but give you an idea of what I'm doing)
Node Class
public class Node {
     protected double priority1;
     protected double priority2;
     int nodeID;
Comparators
private class Comparator1 implements Comparator
public int compare(Object o1, Object o2)
    Node t1 = (Node)o1;
    Node t2 = (Node)o2;
    if (t1.nodeID == t2.nodeID)
      return 0;
    int diff = (int) (PRIORITY_SAMPLING * (t1.priority1 - t2.priority1));
    if (diff == 0)
      return t1.nodeID - t2.nodeID;
    else
      return diff;
private class Comparator2 implements Comparator
public int compare(Object o1, Object o2)
    Node t1 = (Node)o1;
    Node t2 = (Node)o2;
    if (t1.nodeID == t2.nodeID)
      return 0;
    int diff = (int) (PRIORITY_SAMPLING * (t1.priority2 - t2.priority2));
    if (diff == 0)
      return t1.nodeID - t2.nodeID;
    else
      return diff;
}at some point, I use the following code to access my sets and exploit their data, having various treatments and stuff
maxPriority1Node = (Node) Queue1.last();
minPriority2Node = (Node) Queue2.first();
while (maxPriority1Node.priority1 > minPriority2Node.priority2)
if (Count > desiredCount)
    minPriority2Node.merge();
else
    maxPriority1Node.split();
    maxPriority1Node = (Node) Queue1.last();
    minPriority2Node = (Node) Queue2.first();
}at some point, I'm in the case : Count > desiredCount so I call the merge part, which adds the current node to the Queue1 while removing it from Queue2, but the removal is never done, so the node is still present in Queue2. When I get back from the call, the minPriority2Node is still the same node because it's still in the list, and I end up stuck in an infinite loop.
Can someone help me with this, or explain me what exactly happen when I try to remove the node from the set, which would explain why the node is still in the list after I tried to remove it ?
if you need some more details to understand my problem, just ask, I'll try to give you more informations then.

thanks for you help but, as you have guessed, merge and split do much more things than just dealing with the queues.
But I've found where the problem was.
I had wrongly assuming that the value returned by the comparator was used by the TreeSet, wether in fact, it's only the sign of it which is useful.
In my code, I was using a constant called PRIORITY_SAMPLING, which was an arbitrary int (0xFFFFFF) to convert my double values (the double values could be any value, not just normalized 0.0 to 1.0 values, so I could not use a bigger int value). This constant was used to convert my double value to an int, trying to have enough precision to differenciate approaching value. In fact, the precision of this constant was not sufficient.
now, I don't use the constant, which, in fact, was useless. Because what is important in the comparator result is not the value but the sign, so I can do a simple test between my double values and return -1 or 1.
I had to had a special case for nodes whose priority are equal, so that they get sorted by ID, which is consistent over time.
here are the new comparators :
private class Comparator1 implements Comparator
     public int compare(Object o1, Object o2)
          Node t1 = (Node)o1;
          Node t2 = (Node)o2;
          if (t1.nodeID == t2.nodeID)
               return 0;
          if (t1.priority1 == t2.priority1)
               return t1.nodeID - t2.nodeID;
          else if (t1.priority1 < t2.priority1)
               return -1;
          else
               return 1;
private class Comparator2 implements Comparator
     public int compare(Object o1, Object o2)
          Node t1 = (Node)o1;
          Node t2 = (Node)o2;
          if (t1.nodeID == t2.nodeID)
               return 0;
          if (t1.priority2 == t2.priority2)
               return t1.nodeID - t2.nodeID;
          else if (t1.priority2 < t2.priority2)
               return -1;
          else
               return 1;
}

TreeSet/TreeMap problem

Hi everyone!
I'm trying to implement a Scheduler which insert some Deadline in a TreeSet (sorted by expiration timestamp): another Thread "read" TreeSet in order to remove Deadline expired. For this purpose my Deadline class implements Comparable interface and the its method compareTo in this way:
        public int compareTo (Object obj) {
            Deadline d = (Deadline) obj;
            if (this.deadline > d.deadline)
                return 1;
            else if (d.deadline > this.deadline)
                return -1;
            else {
                if (this.equals(obj))
                    return 0;
                else
                    return 1;
        }My class Deadline doesn't extends any other class and doesn't re-implements method equals.
Belove part of my "killer" thread which "read" TreeSet:
               while (v.size() > 0) {
                    dl = (Deadline) v.first();
                    if (dl.deadline <= last) {
                         v.remove(dl);
          ans = dl.deadline;
                                else {
                                    ans = dl.deadline;
                                    break;
.........In some cases (probably when timestamp deadline of Deadline class is equal to that of another Deadlne) removal of Deadline is not performed: TreeSet method first() give me a Deadline, but then I can't remove it from TreeSet. So TreeSet size is never decremented and I hava an infinite while cicle. Probably the problem is my implementation of method compareTo but I can't understand what is wrong!
Can somenone help me?
Thank you all in advance!
Diego

I want to insert in my TreeSet Deadline with the same timestamp deadline, because this can happen. When timestamp is equal, get/remove method of TreeMap should navigate in its internal tree and search, between all Deadline with the same timestamp, that which satisfy equals check.

Question about TreeSet

Hi,
I'm currently implementing an algorithm where I need an ordered data structure with O(log n) for searching, adding and removing. Therefore, TreeSet sounds perfect. However, I also need sometimes to get, given an element on the TreeSet, the previous and next elements, assuming that they exist.
I obviously want those operations to be logarithmic too. I've tried using mySet.headSet().first() and mySet.tailSet().last(), because I've read somewhere that the tailSet and headSet operations are logarithmic, since they represent a view of the part, not a copy of it.
However, I'm not sure of this and therefore I would like to know if there's a better way of implementing previousTo and nextTo (as I call them).
Thanks in advance.

I've tried using mySet.headSet().first() and
mySet.tailSet().last(), because I've read somewhere
that the tailSet and headSet operations are
logarithmic, since they represent a view of thepart,
not a copy of it.I don't understand how you get that to work. To get
the previous element I had to call headSet and then
last. To get the next element I had to call tailSet,
take out an iterator and then step forward two
elements,
TreeSet ts = new TreeSet();
ts.add(new String("1"));
ts.add(new String("5"));
ts.add(new String("3"));
ts.add(new String("4"));
ts.add(new String("2"));
System.out.println(ts.headSet(new
String("3")).last());
Iterator it = ts.tailSet(new String("3")).iterator();
it.next();
System.out.println(it.next());The above TreeSet holds 1,2,3,4,5. The code snippet
prints 2 and 4. Those are the elements before and
after 3.Sorry, sorry, I screwed up when writing. I meant headSet.last and tailSet.first, exactly like you did. It works, but the problem is that the TreeSet javadoc doesn't say anything about headSet and tailSet 's complexity. I have the impression that it could be O(n) on a worst case.

Problem with TreeSet and tailset

I have a TreeSet with a large number of objects (7000+). I am using tailset to get the specific objects I want from the TreeSet. This is usually only the last few objects. Then, I write this returned set to an ObjectOutputStream using the writeObject method. The problem is that it takes a long time for the writeObject method to complete. If my original TreeSet only has around 1000 objects in it, then the writeObject method completes rather quickly. It seems as though the TreeSet returned by the tailSet method is much larger than I think it is. Even if tailSet returns a TreeSet with no objects in it, the writeObject still takes the same (long) amount of time to complete.
Is there something I do not understand about the TreeSet returned by the tailSet method?
Thanks,
Jeff Lueders
[email protected]

tailSet() just creates an view from the original Set. In the case of TreeSet, which is implemented via TreeMap, not much happens when you create this view. Only a tiny Object is created, of type private class TreeMap.SubMap, which holds information of the first element of this view and that it is supposed to extend all the way to the end. So every access to the tail set still needs to go through your huge original Set.
One way to reduce this lookup overhead to a single-time operation would be to copy the tail set into a new TreeSet, which is definitely truly smaller but will not be directly backed by the original Set anymore. So concurrent changes inside any of the Sets will not effect the other.
Set tailSet = new TreeSet(originalSet.tailSet(startKey));

TreeSet problem:

Hello All,
I'm working on an app that is dumping a sql resultset into an arrayList and then into a TreeSet. I've never done work with a TreeSet before, but what I have is one large object of data, with no keys to separate the key/value pairs that are enclosed. What I understand is that there are no keys to try and pull the values out with.
The data is similar to this in the TreeSet:
[model.Role@c7d55 code = [audit] desc = [Access to JIMS usage data] name = [JIMS Audit], model.Role@4455 code = [basic] desc = [Basic access to JIMS ] name = [JIMS Basic], model.Role@3c43 code = [privacy] description = [Access to JIMS privacy data] name = [JIMS Privacy], etc... ]]
My questions are these:
1.) Is there a way to take a treeSet and create a treeMap with ordered key/value pairs? I didn't see any code on this. What I need are separate groupings of key/value pairs.
2.) What is the best collection object to use for this?
Thank you,
James

No, it's much more complicated than what I've explained. I'm maintaining some very complicated, convuluted code, at least in my opinion. There are no duplicates here.
What I have is a single DAO object, containing TreeSets that are each a large, single collection object with sorted groupings of object data in key/value pairs. This single DAO is tightly coupled with two other DAO obects that are used to extract the treeset data throughout the app.
I've used all kinds of collection objects before, but I have never seen this kind of structure and wasn't aware of this type of functionality.
Currently I'm just integrating the existing code with a new object until I can come up with some other mechanism to do the same thing without the other tightly coupled objects because maintaining this code looks like a formidable task as these objects are everywhere in the code. The altered code snippet I provided is part of a 5 item Treeset. Here is another that is part of a 30 value TreeSet:
[[], [model.Function@b4de code = [Utilization] description = [Access to Utilization] name = [Utilization], model.Function@b59a code = [Onhand] description = [Access to Onhand] name = [Onhand], etc...
Each value in the TreeSet is made up of 3 key/value pairs and like I said there are 30 values in this TreeSet, sorted of course, and 5 in another. Then in some of the TreeSets there are arrayList groupings, usually 2 or 3, of the previously mentioned data that are dumped into a TreeSet and the result is one very large object, with all these groupings of data that are difficult to work with (impossible for me so far) to extract without using the existing code.
Does this make more sense of what I'm dealing with?

TreeSet and ClassCastException

Hi,
I know that I shouldn't add abjects to TreeSet which can't be compared (it's called
mutually comparable, isn't it ?) - so basically thay all have to be the same type.
But could anybody explain me why if I break this tule I get this error:
Exception in thread "main" java.lang.ClassCastException: java.lang.Integer
     at java.lang.String.compareTo(String.java:90)
     at java.util.TreeMap.compare(TreeMap.java:1093)
     at java.util.TreeMap.put(TreeMap.java:465)
     at java.util.TreeSet.add(TreeSet.java:210)
     at com.adrian.Book.main(Book.java:26)
What interests me here is what a TreeMap is doing here ?
And how am I supposed to read this information (step by step) ?
I don't understand this output ...
Here is the code:
public class Book {
     public static void main(String[] args) {
          Set s=new TreeSet();
          s.add(new Integer(1));
          s.add("a");
          s.add(new Integer(5));
          s.add(new Integer(3));
          for(Object o:s)
               System.out.print(o+" ");
}Thanks,
Adrian

Ok - I found that TreeSet uses TreeMap in its
implementation - that's why it appears
there.That is correct.
TreeSet makes a call to TreeMap's put(...) method on line 210 from the add(...) method.
Exception in thread "main" java.lang.ClassCastException: java.lang.Integer
at java.lang.String.compareTo(String.java:90)
at java.util.TreeMap.compare(TreeMap.java:1093)
at java.util.TreeMap.put(TreeMap.java:465)
at java.util.TreeSet.add(TreeSet.java:210)
at com.adrian.Book.main(Book.java:26)
If you're curious what is happening exactly, you can always (download and) take a look at the source code:
http://download.java.net/jdk6/

TreeSet and get()

Hello,
just a question: how is it possible do a get on a TreeSet? I don't understand why it hasn't the get() method.
Is iterationg on it the only way to retrieve an element? Something faster?
thanks,

mickey0 wrote:
Hello, for example (hoping to have choose a good example):
class Word {
public String value;
public void compute() {
//do something
//main:
SortedSet<Word> myTreeSet = new TreeSet<Word>();
myTreeSet.get("Hello").compute();
If you have Word objects, and you want to get them with a String, then you should create a Map<String,Word>.
If you want the keys sorted so you can iterate through them in order, then you should make a SortedMap.
TreeMap is an implementation of TreeMap.
The String "Hello" and the Word object that is about the String "Hello", are two different things.
Another alternative, if the Word object doesn't have any state other than the String it's about, would be to not make Word objects at all, but rather to make a StringUtilities class with no available constructor and static methods that take a String as an argument.
Then you could just create a SortedSet of String (and you wouldn't need to do .get()'s on it for the example you gave -- you'd just use the String).
I would like a SortedSet as it must contains a lot of Word; so if it's sorted (a binaryTree? ) it should take less time...Less time how? Sorting a set (or the keys in a Map) doesn't make it any faster to iterate over or do lookups on. In fact it would make it slightly slower. However if you need to iterate through the keys (in a Map) or elements (in a Set) in order, then it would save you programmer time to use a SortedSet or SortedMap, over using an unordered Set or Map and then explicitly sorting them later. In the latter case it's definitely worth it; in the former it's not.

Understanding problem with threads

Hi,
yesterday (at least i think it was yesterday) I posted a question in this forum, I needed help with writing a multithreaded server. The answer was simple and I wrote my program. It kinda works, but there is one thing I don't understand:
I have a class, which handles the clientconnections and one that listens for incoming conections. I pass the socket returned by ServerSocket.accept() to the clientconnection object.
There is only ONE clientconnection-object. The listener just passes the socket and calls the start() method of the clientconnection object.
The clientconnection just writes some text to the client. Connecting more than one client at the same time works too. Everything works fine. And that's what I don't get. If I have only O N E clientconnection the texttransfer shouldn't work after i connect the second client, right?
But it does, is there a mistake in my logic or am I losing my sanity? :)

Hi again Danbas,
Maybe you are losing your sanity... but that's ok. :)
public void startlistening(){
while(true){
try{
clientconn cc = new clientconn(ssock.accept());
}catch(IOException ie){}
//The Constructor in clientconn would look like this:
public clientconn(Socket sock){
//No idea what to do here
Every time you perform "new", you create a new object. And you are calling new every time you accept a new socket connection. So you are creating a new clientconn object each time.

Thoroughly Disappointed By your lack of understanding!!

Dear Sirs,
On September 4th this year my Partner, Anastasia and I went to your Champaign, IL Store on Prospect Ave and we specifically asked for a Color Laser Printer that had Duplex facility, we were sold an HP Laser Jet Pro 200, which does not have Duplex but was Color.
This is after the sales assistant tried to sell us a big clunky all in one printer that was Ink Jet, not Laser Jet!
We phoned up the store this last weekend as we had been out of the country for nearly three months, and returned to set up our home office, only to find what we had been sold couldn't do what was requested of it. The Manager Brian said to bring it back and they would replace it for something more in line with what we requested.
I went back to the Store this past Monday Dec. 9th and took the printer to customer services, which took nearly 45 minutes to sort out what I wanted, The girl refused several times to contact Brian, the manager to verify that I was allowed to do what I had asked to do, return the printer and exchange it for one that was Color, Laser and Duplex! Not very good customer service I'm afraid!!
I was Sold a Brother HL-6180DW Printer, telling me yes it was Duplex/Color and had a large paper tray (Not something I'd requested) and printed quickly (Again not a specific request), and it was not available in store so could not be demonstrated! She set up a shipping order for it, it arrived yesterday, very quick delivery!
BUT WE HAVE A MAJOR PROBLEM HERE!
The Printer is Duplex, a Specific Request, BUT IS NOT COLOR!!
I am contacting YOU, Customer Support as I can no longer deal with your store. It took me a Cab ride and $20 to get the printer there last time, I will not return this one the same way!
I have returned the Second Printer the Brother HL-6810DW
Tracking Number: {removed per forum guidelines}
At the request of Anastasia {removed per forum guidelines} , this notice alerts you of the status of the shipment listed below.
Tracking Detail
Your package has been delivered.
Tracking Number:
{removed per forum guidelines}
Type:
Package
Status:
Delivered
Rescheduled Delivery:
12/19/2013
Signed By:
KELBLY
Location:
Dock
Delivered To:
FINDLAY,OH,US
Reference Number(s):
{removed per forum guidelines}
Service:
UPS Ground
Weight:
32.20 Lbs
Shipment Progress
Location
Date
Local Time
Activity
Findlay,
OH, United States
12/18/2013
2:48 A.M.
Out For Delivery
12/18/2013
2:03 A.M.
Arrival Scan
12/18/2013
1:43 A.M.
Delivered
Columbus,
OH, United States
12/18/2013
12:01 A.M.
Departure Scan
Columbus,
OH, United States
12/17/2013
1:22 P.M.
Arrival Scan
Indianapolis,
IN, United States
12/17/2013
10:22 A.M.
Departure Scan
12/17/2013
12:49 A.M.
Arrival Scan
Urbana,
IL, United States
12/16/2013
9:07 P.M.
Departure Scan
12/16/2013
5:30 P.M.
Pickup Scan
United States
12/14/2013
8:01 P.M.
Order Processed: Ready for UPS
Tracking results provided by UPS: 12/19/2013 1:49 P.M. Eastern Time
As you can see it has been returned to you
But I have only received a partial repayment to my bank account
in the sum of $108-
this still leaves a balance of $217.46 from the first printer.
Your Customer Services lady at the Champaign Store when I returned the first printer, swiped a yellow tag through the Cash Terminal and I assume that was Store Credit?
As that is what came up on the receipt, but she never mentioned to me what she was doing.
I feel very cheated by your company, as you are still withholding $217.46 of my money
Which I would like returned. Please!!
I spent nearly 4 hours on the phone to various departments within your company on December 23rd trying to sort this out, (I charge $150 an hour for my time as a Consultant to Hotels and Restaurants) all to no avail, as nobody had the decency to actually listen to what I said. Yes I got Irate at your staff, because they were just not listening!!
I expect to receive my $217.46 in cash deposited to my account, please
I will accept store credit if it is absolutely necessary, but please be assured I have no wish to deal with your company any more than is necessary as i do not think that you or your staff listen to their customers!!
You as a company have failed me on three occasions now,
First) The HP Laser Jet Pro, was not what I was sold or asked for
Second) The Brother HL-6810DW was not what I asked for either
Third) You are Holding on to my hard earned money, which could be construed as theft
Please be aware I will be contacting my legal representative as soon as possible to discuss this matter with him!
I urge you to make this right.
It is a pretty simple request really, WE WANTED A DUPLEX COLOR LASER PRINTER for our Business! WHAT IS DIFFCULT ABOUT THAT??
The First Printer was Color but not Duplex
The Second Printer is Duplex but not Color
Both Printers are under the delivery name:
{removed per forum guidelines}
I wonder if your staff Know what a customer asks for?
I WOULD request that I get my Money Back, including the $20 for the Cab fare
And at least $200 in compensation for all this grief and the fact I cannot Print out my Catalogs for my products, which I wanted to have out for Christmas
I printed three with The HP Laserjet and it printed blue dots all along the page which ruined the catalog also.
I look forward to your reply!
I had to Call Customer Relations to get anywhere with this, But I'm still no further forward, as I was told I had to wait 7-10 Days for delivery of my Gift Card. Then I got this:
BestBuy.com Customer Care
Jan 17 (12 days ago)
to me
Dear Sir:
Just a follow up.
I note your concerns are being handled and the $217. plus chg. is being issued.
on your order #{removed per forum guidelines}.
I want to thank you for speaking up and helping us improve our service. I do apologize that this was not taken care of earlier. Please refer to case # {removed per forum guidelines} should you need to contact us again - but from all I see this is being addressed.
Thank you,
Jerry
Best Buy Customer Care Team
To Which I replied on January 28th
Case # {removed per forum guidelines}
When I contacted you originally, I never received a reply to my original email although it states 3 DAYS in your standard reply email.
In reply to the below Email I had to call your Customer Relations Team to get anywhere, and that was to get my Money Refunded. Which has STILL NOT ARRIVED, even though I was told it would take 7-10 days!
You'll notice I have now waited 11 days, since you replied! So in effect I've waited nearly 21 days to receive my refund!
This is now beyond ridiculous!
If I DO NOT have my Money within two days from todays date January 28th, 2014, I will be seeing my lawyer and I will be taking your company to court for misappropriation of my funds.
I will not deal with your 3 days, I want answers and I would like them now!!
I am still waiting for the Gift Card with my $217.46 on it
I suggest you get this sent out Signed For Delivery and have it expedited on a Next Day Delivery also!
I still cannot run my business efficiently as I have NO PRINTER, which will not be the case until your company refunds my money.
Personally I have no wish to buy anything else from you, I would like my $217.46 refunded to my Debit Card, I do not want a Gift Card, I never did, I wanted the freedom to shop at another store and not give your company anymore of my money!!
Can you please Return my money!!
Their Reply was:
Hi Mr. {removed per forum guidelines}
My sincerest apologies that you have not received your refund bas yet. Our gift card dept has been backed up and has had some techinical difficulty with process orders. I have researched this and found
that a gift card is being processed for $217.49. You should be receiving it shortly. Thank you for your patients.
Thank You
Mildred C
It is now January 29th I still have NO GIFT CARD!!
All I want is My Money Returned
This has been going on Since December 2013
Nearly Two Months Now
If I do Not get action I will See My Lawyer and I also want Compensation for lost Revenue and Lost Hours at Work because of this!!
The Two Printers:
I could not add them through your site so I found them on Amazon.com
{Removed per Forum Guidelines}
As you can see neither do What I had originally requested

Good afternoon TheScotsman61,
After attempting to buy two different printers and not receiving one that meets your needs for your business, I can fully understand why you would be so frustrated. Not to mention, if you didn't receive the card the store credit was applied to back, you wouldn't have access to the funds returned to it once you returned the Brother printer.
I apologize for any inconvenience this experience may have caused you. Presently, I see we have reissued you the store credit to the address listed on the order. As it finished processing on 1/30/14, it should be in the mail and on its way to you. I also see that you spoke with Andrew from our Executive Resolutions team in regards to your experience, who offered a final resolution to this issue, and you accepted. I’m glad we were able to assist you with this experience!
In regards to your continued lack of a printer, it seems that hydrogenwv and the HP representative both provided you a few options for printers that may work for you that are within your price range. Please let me know if you have any questions or further concerns!
Regards,
Tasha|Social Media Specialist | Best Buy® Corporate
Private Message

Error Posting IDOC: need help in understanding the following error

Hi ALL
Can you please, help me understand the following error encountered while the message was trying to post a IDOC.
where SAP_050 is the RFC destination created to post IDOCs
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
- 
- <SAP:Error xmlns:SAP="http://sap.com/xi/XI/Message/30" xmlns:SOAP="http://schemas.xmlsoap.org/soap/envelope/" SOAP:mustUnderstand="">
<SAP:Category>XIAdapter</SAP:Category>
<SAP:Code area="IDOC_ADAPTER">ATTRIBUTE_IDOC_RUNTIME</SAP:Code>
<SAP:P1>FM NLS_GET_LANGU_CP_TAB: Could not determine code page with SAP_050 Operation successfully executed FM NLS_GET_LANGU_CP_TAB</SAP:P1>
<SAP:P2 />
<SAP:P3 />
<SAP:P4 />
<SAP:AdditionalText />
<SAP:ApplicationFaultMessage namespace="" />
<SAP:Stack>Error: FM NLS_GET_LANGU_CP_TAB: Could not determine code page with SAP_050 Operation successfully executed FM NLS_GET_LANGU_CP_TAB</SAP:Stack>
<SAP:Retry>M</SAP:Retry>
</SAP:Error>
Your help is greatly appreciated.............Thank you!

Hi Patrick,
Check the authorizations assigned to the user which you used in the RFC destinations, If there is no enough authorizations then it is not possible to post the idocs.
Also Refer this Note 747322
Regards,
Prakash

Tcode:File ,Tcode:sf01 understanding

pls help me in understanding these tcode
to create logical path,pls provide me the step by
step to create a logical path

Hi,
Pls check threads like
Application Server -File Upload
How to create logical file name
Eddy

Hello, World - trying to understand the steps

Hello, Experts!
I am pretty new to Flash Development, so I am trying to understand how to implement the following steps using Flash environment
http://pdfdevjunkie.host.adobe.com/00_helloWorld.shtml
Step 1: Create the top level object. Use a "Module" rather than an "Application" and implement the "acrobat.collection.INavigator" interface. The INavigator interface enables the initial hand shake with the Acrobat ActionScript API. Its only member is the set host function, which your application implements. During the initialize cycle, the Acrobat ActionScript API invokes your set host function. Your set host function then initializes itself, can add event listeners, and performs other setup tasks.Your code might look something like this.
<mx:Module xmlns:mx="http://www.adobe.com/2006/mxml" implements="acrobat.collection.INavigator" height="100%" width="100%" horizontalScrollPolicy="off" verticalScrollPolicy="off" >
Step 2: Create your user interface elements. In this example, I'm using a "DataGrid" which is overkill for a simple list but I'm going to expand on this example in the future. Also notice that I'm using "fileName" in the dataField. The "fileName" is a property of an item in the PDF Portfolio "items" collection. Later when we set the dataProvider of the DataGrid, the grid will fill with the fileNames of the files in the Portfolio.
<mx:DataGrid id="itemList" initialize="onInitialize()" width="350" rowCount="12"> <mx:columns> <mx:DataGridColumn dataField="fileName" headerText="Name"/> </mx:columns> </mx:DataGrid>
Step 3: Respond to the "initialize" event during the creation of your interface components. This is important because there is no coordination of the Flash Player's initialization of your UI components and the set host(), so these two important milestone events in your Navigator's startup phase could occur in either order. The gist of a good way to handler this race condition is to have both your INavigator.set host() implementation and your initialize() or creationComplete() handler both funnel into a common function that starts interacting with the collection only after you have a non-null host and an initialized UI. You'll see in the code samples below and in step 4, both events funnel into the "startEverything()" function. I'll duscuss that function in the 5th step.
               private function onInitialize():void { _listInitialized = true; startEverything(); }

Hello, Experts!
I am pretty new to Flash Development, so I am trying to understand how to implement the following steps using Flash environment
http://pdfdevjunkie.host.adobe.com/00_helloWorld.shtml
Step 1: Create the top level object. Use a "Module" rather than an "Application" and implement the "acrobat.collection.INavigator" interface. The INavigator interface enables the initial hand shake with the Acrobat ActionScript API. Its only member is the set host function, which your application implements. During the initialize cycle, the Acrobat ActionScript API invokes your set host function. Your set host function then initializes itself, can add event listeners, and performs other setup tasks.Your code might look something like this.
<mx:Module xmlns:mx="http://www.adobe.com/2006/mxml" implements="acrobat.collection.INavigator" height="100%" width="100%" horizontalScrollPolicy="off" verticalScrollPolicy="off" >
Step 2: Create your user interface elements. In this example, I'm using a "DataGrid" which is overkill for a simple list but I'm going to expand on this example in the future. Also notice that I'm using "fileName" in the dataField. The "fileName" is a property of an item in the PDF Portfolio "items" collection. Later when we set the dataProvider of the DataGrid, the grid will fill with the fileNames of the files in the Portfolio.
<mx:DataGrid id="itemList" initialize="onInitialize()" width="350" rowCount="12"> <mx:columns> <mx:DataGridColumn dataField="fileName" headerText="Name"/> </mx:columns> </mx:DataGrid>
Step 3: Respond to the "initialize" event during the creation of your interface components. This is important because there is no coordination of the Flash Player's initialization of your UI components and the set host(), so these two important milestone events in your Navigator's startup phase could occur in either order. The gist of a good way to handler this race condition is to have both your INavigator.set host() implementation and your initialize() or creationComplete() handler both funnel into a common function that starts interacting with the collection only after you have a non-null host and an initialized UI. You'll see in the code samples below and in step 4, both events funnel into the "startEverything()" function. I'll duscuss that function in the 5th step.
               private function onInitialize():void { _listInitialized = true; startEverything(); }

Understanding the way to connect a MDD to BlackMagic Decklink Extreme card

Hi,
I require some help in the following:
I recently bought myself a Blackmagic DeckLink Extreme™ with 10bit SDI/analog video and audio capture card.
Looking at the specs, http://www.blackmagic-design.com/products/sd/specs/, can someone give me directions as to the best setup I can do from the following sources and what other equipment I may require to achieve it.
- mono stereo audio VHS -> has 1 video/audio in and 1 video/audio out (composite connections)
- stereo audio video camera -> has 1 8 pin S-Video out port to composite connections (Hi8 tape type)
- DVD player -> has composite 2 x 2ch stereo audio out, 1 x 5.1ch stereo audio out, 2 x video out, 1x component video out, 2 x S-video out, 2 x digital audio out; 1 x RCA/OPT
- 2 x 23" monitors connected by ADC and DVI connections to a Apple MDD G4, may relay to 60" Plasma for video monitoring from video card prior to creating DVD final piece for playback.
Basically, I wanted to have multiple source inputs and outputs, but I'm having difficulty in understanding the setup. Please refer to http://www.blackmagic-design.com/downloads/connections/decklinkdiagram.pdf page 5/6.
I purchased the following from JayCar
- 6 x PA3655 ADPT PLG RCA:
https://secure4.vivid-design.com.au/jaycar2005/productView.asp?ID=PA3655&CATID=& keywords=PA3655&SPECIAL=&form=KEYWORD&ProdCodeOnly=&Keyword1=&Keyword2=&pageNumb er=&priceMin=&priceMax=&SUBCATID=
- 1 x AC1668 SWITCH AV 3WAY:
https://secure4.vivid-design.com.au/jaycar2005/productView.asp?ID=AC1668&CATID=& keywords=AC1668&SPECIAL=&form=KEYWORD&ProdCodeOnly=&Keyword1=&Keyword2=&pageNumb er=&priceMin=&priceMax=&SUBCATID=
What other devices do I need to set up the equipment in the following way:
<pre>
Computer ------- Video In + Stereo In -----------> 3WAY SWITCH BOARD
| | ^ ^ ^
| | | | |
Bigpond |---- OUT ---> TV --------|-----|-----|
(Satellite Internet) | | | |
FOXTEL DVD VCR V/CAM
(Satellite TV)
</pre>
Currently I have not succeeded.
I have just done a simple test like so:
<pre>
Computer ------- Video In + Stereo In ---------> DVD (*)
|
Bigpond
</pre>
(*) Tested using the following:
<pre>
From Decklink -- Y IN (from deck) --> DVD Y port
-- B-Y IN (from deck) --> DVD Pb port
-- R-Y IN (from deck) --> DVD Pr port
-- SDI IN (from deck) ---> DVD Digital audio out
ASWELL AS
From Decklink -- Y OUT (from deck) --> DVD Y port
-- B-Y OUT (from deck) --> DVD Pb port
-- R-Y OUT (from deck) --> DVD Pr port
-- SDI OUT (from deck) ---> DVD Digital audio out
</pre>
Not one has seemed to work. What am I missing here?
Thanks
Tiberius
PPC MDD Dual Boot/Dual 1.25GHz Mac OS 9.2.x 2 x 23" Apple HD Display, 2GB RAM, 2x150GB + 1x1TB HD

pomme4moi wrote:
I want to buy a hard disk (not a NAS device) and plug it into my Airport Extreme in order to share data between two Mac computers, and to stream iTunes content to my Apple TV.
One option is to purchase a hard drive (say, a 2TB Hitachi G-Technology drive) and connect it to the USB port on the back of the Apple Extreme. The other option is to purchase a drive with an ethernet connection (say, a 2TB Lacie drive) and connect it to an ethernet port on the Apple Extreme.
In the second case what you'd have actually is a NAS. Apple's AirPort routers aren't known for fast file sharing. The NAS option might be faster.
Is either option better for streaming movies from the hard drive to my Apple TV?
I could be wrong, but an AppleTV may not be able to access content directly from a network drive. It may require that a Mac serve as an intermediary.

Understanding TreeSet

Similar Messages

Maybe you are looking for