Help with MuVo Slim, track listi
Yeah, Got my new Slim for Christmas and now it keeps putting all of my tracks in alphabetical order.....
Help anyone?
SSR,
The slim (and all other MuVos with the exception of the MuVo2 which supports playlists and folders) uses a folder system and doesn't support playlists. What many users do is arrange their files with the desired order added to the front of the titles (0-title, 02-title, etc) and then put them together in a folder.
Jeremy
Similar Messages
-
Muvo Slim - Track starts playing automatically when turned
With my Muvo Slim 52, firmware .0.05, whenever I turn the unit on, it starts to play a track, EVEN if there was NO track playing when I turned off the unit. In a similar situation, after I have transferred files onto the unit - as soon as I disconnect the USB cable - the unit powers itself on, and the first track starts to play - before I even press the play button. QUESTIONS --- () Is "automatically playing track after power on" a normal behavior? (2) Is there any way to stop this i.e. so that a track only starts playing (or resumes) when I MYSELF press play? (3) If not, how can such a feature be requested in a future firmware revision?
Jason,
Thanks. I just downloaded the latest firmware for my MuVo Slim (..03 -- previous version was .02.0) and it has corrected the problem! Perfect!
M. -
My dad has a new Muvo Slim and I am trying to put music on it for him. I can get it to copy up to 28Mb but not to fill it, is there a setting that I have wrong?
Thanks
KizzmoMake sure you have the latest firmware.
Also try the player on another PC to see if the issue is with your PC, or some incompatibility with your PC and the Slim. -
I have a Creative Muvo Slim Mp3. I delete the songs by right-click on the dri've and format but when i on the Mp3 player without the Usb it said file system error, but when i plug in the MP3 to the PC it can play the songs. Can anyone help me please. Thankyou
Just have the player formatted to FAT instead of FAT32.
Jason -
Hi. New to the forum as i need some help with new MuVo. Installed CD, did everything in the correct order but when i plug in MuVo, computer says has found hardware but when i open Media Player or Media Source it says no device is detected. Can anyone shed any light?
:smileyvery-happy:
YYYYYEEEEESSSSS!!!!!!
Have managed to fix. I can now see the dri've and everything is working sweet!!!! Just downloaded the new firmware from Creative and installed it. Computer was coming up up with messages and i have no iedea what i pressed but it worked.
Now have very happy fiance who can play with his Christmas present. Only trouble now is that i have to show him how to download music!!!!!
Thank you to SSR for the giving me advice, knew where to begin after that. Creative should be paying you!!! -
To anyone who can spare 5 minutes to read this and give me feedback, I will be very greatful for your help =)
I switched off my mp3 player (it's a MuVo V200) to the radio mode. When I switched it on I wanted to return it to the music mode, and it automatically switches off.
At first I thought it was the battery- i have bought batteries of 2 different brands and both have not worked.
Has anyone faced the same problem? How did you fix it's
Once again, thank you for reading this and I hope you are able to help me =)That was frustrating me also, could not find my device, but as you suggested, I changed the country to germany and guessed my way through selecting device, etc. Muvo V200 is what I have. I downloaded and executed the mstorage file, and the folder ends up at the programs folder... creative... mstorage and I do see in there the two .inf files and the one log file says everything installed correctly . However I am running windows 98 and for the life of me, I point the wizard directly to the mstorage folder and it still says it cannot find the driver. I also downloaded both the Muvo V200 installation program and the other program to organize the music and transfer, etc,. both of them requires the device to be connecte and detected in order to finalize installation, so I am like the chicken and the egg going in circles... I thought the Installation program would take care of everything but it just hangs up on detecting the device which of course it will never detect because I cannot get the device to install... you see how I am going in circles... This was a promotion from SBC when I ordered dsl and dish, so I am not too worried since I did not pay for it, but it came without the installatin disc, we are supposed to download everything from the site... I am frustrated... anything you can help with will be greatly appreciated... I have two USB ports, I have tried both they are 2.0 by the way.. I also have 2 extra USP ports from the keyboard those don't work either, even though they work fine for my digital camera and my webcam...,,, now I am rambling... Please help
-
Newbie help with Muvo TX FM load
Hello,
Question is using the software that came with mp3 (Creativemedia) once I drag a file from my computer stored music into the other box it automatically starts loading it into the player. What I would like to be able to do is arrange all my artists in order or by song types, but once I move them over they load. Anyway to make your list up and then transfer? Anyway to add a song somewhere up the list later after you have your player somewhat full. Ex.
Toby Keith
Toby Keith
Toby Keith
Kenny Chesney
Kenny Chesnet
New Toby Keith comes out and I want to add it before the Kenny chesney songs. How do I or don't I?
Hope this made it clear
Thanks in advance.I'm not quite sure I understand the problem, but the MuVo sorts alphanumerically by filename.
If you want to keep tracks separate from each other then simply create folders and store the tracks in those. -
Need help with ouput of a list or array of numbers input from user
I'm only a few weeks into learning java, so this may seem simple to some, but...
I am trying to write a program that will receive numbers from a user,
and then list, add, average those numbers. I've got the program to
work except for listing the numbers that were input.
Can someone help guide me????
i've left the code I've tried in as comments.
Enter an integer value, the program exits if the input is 0:
20
Enter an integer value, the program exits if the input is 0:
40
Enter an integer value, the program exits if the input is 0:
60
Enter an integer value, the program exits if the input is 0:
80
Enter an integer value, the program exits if the input is 0:
0
Total numbers entered: 4
The array of numbers is: 0 0 0 0
The sum is 200
The average is 50
The maximum number is 0
The minimum is 0
Here is my code:
* Title: Reads integers and finds the total, average, maximum of the input values
* Description:
* Copyright: Copyright (c) 2002
* Company: Duke Court.
* @author Mary Davenport
* @version 1.0
public class part3page6
public static void main(String[] args)
int data = 0;
int sum = 0;
int countnum = -1;
int maximum = 0;
int minimum = 0;
int average = (countnum - 1);
do
System.out.println("Enter an integer value, " +
" the program exits if the input is 0: ");
data = MyInput.readInt();
sum += data;
countnum++;
} while (data != 0);
//in order to figure the max & the min it appears that the
//program will need to utilize arrays to store the individual numbers
//that are input from the user.
//create an array of the input data
int[] number = new int[countnum];
//creat a list of the input data
int []myList = {data};
//lists how many numbers entered
System.out.println("Total numbers entered: " + number.length);
//list array of numbers -- this is giving me [I@3179c3,
//instead of 20, 40, 60, 80 when I use "new int[countnum]"
// System.out.print("The array of numbers is: "
// + new int[countnum]);
//list array of numbers: this is giving me " 0 0 0 0 "
//instead of 20, 40, 60, 80 with the following for statement
// (number[i] + " ")
System.out.print("The array of numbers is: ");
for(int i=0; i<number.length; i++)
System.out.print(number[i] + " ");
//list mylist of numbers from input, 20, 40, 60, 80
//output is The list of numbers is: [I@3179c3
// System.out.print("The list of numbers is: " + myList);
System.out.println();
System.out.println("The sum is " + sum);
average = sum/countnum;
System.out.println("The average is " + average);
System.out.println("The maximum number is " + maximum);
System.out.println("The minimum is " + minimum);When you input the data you need to save it to the array. Currently you are not saving the value you are just adding it
ArrayList nums = new ArrayList();
do
System.out.println("Enter an integer value, " +
" the program exits if the input is 0: ");
data = MyInput.readInt();
nums.add(new Integer(data));
sum += data;
countnum++;
} while (data != 0); -
Help with creating a price list
I'm just wondering if anybody could possibly help me when creating a price list?. I'm new to SAP so don't have a great knowledge of it.
Our company needs to send out a wholesale price list to customers, however some of the items we stock do not include vat, when the price list is previewed it doesnt show which items include vat or exclusive of vat. this information could do with being visible to make it clearer to the customers.
Is there anyway the priclist could be exported to microsoft excel etc for editing?
many thanks.go to inventory--prce lists-Price List.
double click on the price list you want.
It will open the new window showing Items with prices.
Click on the Excel icon on menu bar on the top.
save file as .xls. -
Hello, I have a Muvo N200 and am having some trouble with it. I have looked around here for awhile and nothing has helped me!
My songs are making a buzzing sound after they are uploaded..thhey will work fine, then make a random buzzing throughout the song. I have tried to download the firmware but i cannot get my player in recovery mode. Could some one please help me with this soon. ThanksRecovery mode should be straightforward. It's explained again in this thread. What's happening when you attempt it's
-
Can someone help with splitting a Linked List.??
Any help would be awesome!!!
My code just will not work!! Any help would be appreciated! My problem is in the last method SplitAt. These are the conditions set and my code:
Splitting a Linked List at a Given Node, into Two Sublists
a. Add the following as an abstract method to the class
LinkedListClass:
public void splitAt (LinkedListClass<T> secondList, T item);
//This method splits the list at the node with the info item into two sublists.
//Precondition: The list must exist.
//Postcondition: first and last point to the first and last nodes of the first sublist,
// respectively. secondList.first and secondList.last point to the first
// and last nodes of the second sublist.
Consider the following statements:
UnorderedLinkedList<Integer> myList;
UnorderedLinkedList<Integer> otherList;
Suppose myList points to the list with the elements 34, 65, 18, 39, 27, 89, and 12 (in this order). The statement
myList.splitAt(otherList, 18);
splits myList into two sublists: myList points to the list with elements 34 and 65, and otherList points to the sublist with elements 18, 39, 27, 89, and 12.
b. Provide the definition of the method splitAt in the class UnorderedLinkedList. Also write a program to test your method.
public class UnorderedLinkedList<T> extends LinkedListClass<T>
//Default constructor
public UnorderedLinkedList()
super();
//Method to determine whether searchItem is in
//the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public boolean search(T searchItem)
LinkedListNode<T> current; //variable to traverse
//the list
boolean found;
current = first; //set current to point to the first
//node in the list
found = false; //set found to false
while (current != null && !found) //search the list
if (current.info.equals(searchItem)) //item is found
found = true;
else
current = current.link; //make current point to
//the next node
return found;
//Method to insert newItem in the list.
//Postcondition: first points to the new list
// and newItem is inserted at the
// beginning of the list. Also,
// last points to the last node and
// count is incremented by 1.
public void insertFirst(T newItem)
LinkedListNode<T> newNode; //variable to create the
//new node
newNode =
new LinkedListNode<T>(newItem, first); //create and
//insert newNode before
//first
first = newNode; //make first point to the
//actual first node
if (last == null) //if the list was empty, newNode is
//also the last node in the list
last = newNode;
count++; //increment count
//Method to insert newItem at the end of the list.
//Postcondition: first points to the new list and
// newItem is inserted at the end
// of the list. Also, last points to
// the last node and
// count is incremented by 1.
public void insertLast(T newItem)
LinkedListNode newNode; //variable to create the
//new node
newNode =
new LinkedListNode(newItem, null); //create newNode
if (first == null) //if the list is empty, newNode is
//both the first and last node
first = newNode;
last = newNode;
else //if the list is not empty, insert
//newNode after last
last.link = newNode; //insert newNode after last
last = newNode; //set last to point to the
//actual last node
count++;
}//end insertLast
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list. Also, first points to the first
// node, last points to the last
// node of the updated list, and count
// is decremented by 1.
public void deleteNode(T deleteItem)
LinkedListNode<T> current; //variable to traverse
//the list
LinkedListNode<T> trailCurrent; //variable just
//before current
boolean found;
if ( first == null) //Case 1; the list is empty
System.err.println("Cannot delete from an empty "
+ "list.");
else
if (first.info.equals(deleteItem)) //Case 2
first = first.link;
if (first == null) //the list had only one node
last = null;
count--;
else //search the list for the given info
found = false;
trailCurrent = first; //set trailCurrent to
//point to the first node
current = first.link; //set current to point to
//the second node
while (current != null && !found)
if (current.info.equals(deleteItem))
found = true;
else
trailCurrent = current;
current = current.link;
}//end while
if (found) //Case 3; if found, delete the node
count--;
trailCurrent.link = current.link;
if (last == current) //node to be deleted
//was the last node
last = trailCurrent; //update the value
//of last
else
System.out.println("Item to be deleted is "
+ "not in the list.");
}//end else
}//end else
}//end deleteNode
public void splitAt(LinkedListClass<T> secondList, T item)
LinkedListNode<T> current;
LinkedListNode<T> trailCurrent;
int i;
boolean found;
if (first==null)
System.out.println("Empty.");
first=null;
last=null;
count--;
else
current=first;
found=false;
i=1;
while(current !=null &&!found)
if(current.info.equals(secondList))
found= true;
else
trailCurrent=current;
i++;
if(found)
if(first==current)
first=first;
last=last;
count=count;
count=0;
else
first=current;
last=last;
last=null;
count = count- i+1;
count = i-1;
else
System.out.println("Item to be split at is "
+ "not in the list.");
first=null;
last=null;
count=0;
}Edited by: romeAbides on Oct 10, 2008 1:24 PMI dont have a test program at all. The program is supposed to prompt for user input of numbers. (it does) Take the input and end at input of -999 (it does). Then it asks user where it wants to split list (it does). When I enter a number it does nothing after that. I am going to post updated code and see if that helps along with all the classes. Thanks!
This is the class to prompt:
import java.util.*;
public class Ch16_ProgEx6
static Scanner console = new Scanner(System.in);
public static void main(String[] args)
UnorderedLinkedList<Integer> list
= new UnorderedLinkedList<Integer>();
UnorderedLinkedList<Integer> subList =
new UnorderedLinkedList<Integer>();
Integer num;
System.out.println("Enter integers ending with -999.");
num = console.nextInt();
while (num != -999)
list.insertLast(num);
num = console.nextInt();
System.out.println();
System.out.println("list: ");
list.print();
System.out.println();
System.out.println("Length of list: " + list.length());
System.out.print("Enter the number at which to split list: ");
num = console.nextInt();
list.splitAt(subList, num);
System.out.println("Lists after splitting list");
System.out.print("list: ");
list.print();
System.out.println();
System.out.println("Length of list: " + list.length());
System.out.print("sublist: ");
subList.print();
System.out.println();
System.out.println("Length of sublist: " + subList.length());
}This is the ADT:
public interface LinkedListADT<T> extends Cloneable
public Object clone();
//Returns a copy of objects data in store.
//This method clones only the references stored in
//each node of the list. The objects that the
//list nodes point to are not cloned.
public boolean isEmptyList();
//Method to determine whether the list is empty.
//Postcondition: Returns true if the list is empty;
// false otherwise.
public void initializeList();
//Method to initialize the list to an empty state.
//Postcondition: The list is initialized to an empty
// state.
public void print();
//Method to output the data contained in each node.
public int length();
//Method to return the number of nodes in the list.
//Postcondition: The number of nodes in the list is
// returned.
public T front();
//Method to return a reference of the object containing
//the data of the first node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the first node
// is returned.
public T back();
//Method to return a reference of object containing
//the data of the last node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the last node
// is returned.
public boolean search(T searchItem);
//Method to determine whether searchItem is in the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public void insertFirst(T newItem);
//Method to insert newItem in the list.
//Postcondition: newItem is inserted at the
// beginning of the list.
public void insertLast(T newItem);
//Method to insert newItem at the end of the list.
//Postcondition: newItem is inserted at the end
// of the list.
public void deleteNode(T deleteItem);
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list.
public void splitAt(LinkedListClass<T> secondList, T item);
}This is the linked list class:
import java.util.NoSuchElementException;
public abstract class LinkedListClass<T> implements LinkedListADT<T>
protected class LinkedListNode<T> implements Cloneable
public T info;
public LinkedListNode<T> link;
//Default constructor
//Postcondition: info = null; link = null;
public LinkedListNode()
info = null;
link = null;
//Constructor with parameters
//This method sets info pointing to the object to
//which elem points to and link is set to point to
//the object to which ptr points to.
//Postcondition: info = elem; link = ptr;
public LinkedListNode(T elem, LinkedListNode<T> ptr)
info = elem;
link = ptr;
//Returns a copy of objects data in store.
//This method clones only the references stored in
//the node. The objects that the nodes point to
//are not cloned.
public Object clone()
LinkedListNode<T> copy = null;
try
copy = (LinkedListNode<T>) super.clone();
catch (CloneNotSupportedException e)
return null;
return copy;
//Method to return the info as a string.
//Postcondition: info as a String object is
// returned.
public String toString()
return info.toString();
} //end class LinkedListNode
public class LinkedListIterator<T>
protected LinkedListNode<T> current; //variable to
//point to the
//current node in
//list
protected LinkedListNode<T> previous; //variable to
//point to the
//node before the
//current node
//Default constructor
//Sets current to point to the first node in the
//list and sets previous to null.
//Postcondition: current = first; previous = null;
public LinkedListIterator()
current = (LinkedListNode<T>) first;
previous = null;
//Method to reset the iterator to the first node
//in the list.
//Postcondition: current = first; previous = null;
public void reset()
current = (LinkedListNode<T>) first;
previous = null;
//Method to return a reference of the info of the
//current node in the list and to advance iterator
//to the next node.
//Postcondition: previous = current;
// current = current.link;
// A refrence of the current node
// is returned.
public T next()
if (!hasNext())
throw new NoSuchElementException();
LinkedListNode<T> temp = current;
previous = current;
current = current.link;
return temp.info;
//Method to determine whether there is a next
//element in the list.
//Postcondition: Returns true if there is a next
// node in the list; otherwise
// returns false.
public boolean hasNext()
return (current != null);
//Method to remove the node currently pointed to
//by the iterator.
//Postcondition: If iterator is not null, then the
// node that the iterator points to
// is removed. Otherwise the method
// throws NoSuchElementException.
public void remove()
if (current == null)
throw new NoSuchElementException();
if (current == first)
first = first.link;
current = (LinkedListNode<T>) first;
previous = null;
if (first == null)
last = null;
else
previous.link = current.link;
if (current == last)
last = first;
while (last.link != null)
last = last.link;
current = current.link;
count--;
//Method to return the info as a string.
//Postcondition: info as a String object is returned.
public String toString()
return current.info.toString();
} //end class LinkedListIterator
//Instance variables of the class LinkedListClass
protected LinkedListNode<T> first; //variable to store the
//address of the first
//node of the list
protected LinkedListNode<T> last; //variable to store the
//address of the last
//node of the list
protected int count; //variable to store the number of
//nodes in the list
//Default constructor
//Initializes the list to an empty state.
//Postcondition: first = null, last = null,
// count = 0
public LinkedListClass()
first = null;
last = null;
count = 0;
//Method to determine whether the list is empty.
//Postcondition: Returns true if the list is empty;
// false otherwise.
public boolean isEmptyList()
return (first == null);
//Method to initialize the list to an empty state.
//Postcondition: first = null, last = null,
// count = 0
public void initializeList()
first = null;
last = null;
count = 0;
//Method to output the data contained in each node.
public void print()
LinkedListNode<T> current; //variable to traverse
//the list
current = first; //set current so that it points to
//the first node
while (current != null) //while more data to print
System.out.print(current.info + " ");
current = current.link;
}//end print
//Method to return the number of nodes in the list.
//Postcondition: The value of count is returned.
public int length()
return count;
//Method to return a reference of the object containing
//the data of the first node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the first node
// is returned.
public T front()
return first.info;
//Method to return a reference of object containing
//the data of the last node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the last node
// is returned.
public T back()
return last.info;
//Returns a copy of objects data in store.
//This method clones only the references stored in
//each node of the list. The objects that the
//list nodes point to are not cloned.
public Object clone()
LinkedListClass<T> copy = null;
try
copy = (LinkedListClass<T>) super.clone();
catch (CloneNotSupportedException e)
return null;
//If the list is not empty clone each node of
//the list.
if (first != null)
//Clone the first node
copy.first = (LinkedListNode<T>) first.clone();
copy.last = copy.first;
LinkedListNode<T> current;
if (first != null)
current = first.link;
else
current = null;
//Clone the remaining nodes of the list
while (current != null)
copy.last.link =
(LinkedListNode<T>) current.clone();
copy.last = copy.last.link;
current = current.link;
return copy;
//Method to return an iterator of the list.
//Postcondition: An iterator is instantiated and
// returned.
public LinkedListIterator<T> iterator()
return new LinkedListIterator<T>();
//Method to determine whether searchItem is in
//the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public abstract boolean search(T searchItem);
//Method to insert newItem in the list.
//Postcondition: first points to the new list
// and newItem is inserted at the
// beginning of the list. Also,
// last points to the last node and
// count is incremented by 1.
public abstract void insertFirst(T newItem);
//Method to insert newItem at the end of the list.
//Postcondition: first points to the new list and
// newItem is inserted at the end
// of the list. Also, last points to
// the last node and
// count is incremented by 1.
public abstract void insertLast(T newItem);
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list. Also, first points to the first
// node, last points to the last
// node of the updated list, and count
// is decremented by 1.
public abstract void deleteNode(T deleteItem);
public abstract void splitAt(LinkedListClass<T> secondList, T item);
}And this is the UnorderedLinked Class with the very last method the one being Im stuck on. The SplitAt Method.
public class UnorderedLinkedList<T> extends LinkedListClass<T>
//Default constructor
public UnorderedLinkedList()
super();
//Method to determine whether searchItem is in
//the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public boolean search(T searchItem)
LinkedListNode<T> current; //variable to traverse
//the list
boolean found;
current = first; //set current to point to the first
//node in the list
found = false; //set found to false
while (current != null && !found) //search the list
if (current.info.equals(searchItem)) //item is found
found = true;
else
current = current.link; //make current point to
//the next node
return found;
//Method to insert newItem in the list.
//Postcondition: first points to the new list
// and newItem is inserted at the
// beginning of the list. Also,
// last points to the last node and
// count is incremented by 1.
public void insertFirst(T newItem)
LinkedListNode<T> newNode; //variable to create the
//new node
newNode =
new LinkedListNode<T>(newItem, first); //create and
//insert newNode before
//first
first = newNode; //make first point to the
//actual first node
if (last == null) //if the list was empty, newNode is
//also the last node in the list
last = newNode;
count++; //increment count
//Method to insert newItem at the end of the list.
//Postcondition: first points to the new list and
// newItem is inserted at the end
// of the list. Also, last points to
// the last node and
// count is incremented by 1.
public void insertLast(T newItem)
LinkedListNode newNode; //variable to create the
//new node
newNode =
new LinkedListNode(newItem, null); //create newNode
if (first == null) //if the list is empty, newNode is
//both the first and last node
first = newNode;
last = newNode;
else //if the list is not empty, insert
//newNode after last
last.link = newNode; //insert newNode after last
last = newNode; //set last to point to the
//actual last node
count++;
}//end insertLast
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list. Also, first points to the first
// node, last points to the last
// node of the updated list, and count
// is decremented by 1.
public void deleteNode(T deleteItem)
LinkedListNode<T> current; //variable to traverse
//the list
LinkedListNode<T> trailCurrent; //variable just
//before current
boolean found;
if ( first == null) //Case 1; the list is empty
System.err.println("Cannot delete from an empty "
+ "list.");
else
if (first.info.equals(deleteItem)) //Case 2
first = first.link;
if (first == null) //the list had only one node
last = null;
count--;
else //search the list for the given info
found = false;
trailCurrent = first; //set trailCurrent to
//point to the first node
current = first.link; //set current to point to
//the second node
while (current != null && !found)
if (current.info.equals(deleteItem))
found = true;
else
trailCurrent = current;
current = current.link;
}//end while
if (found) //Case 3; if found, delete the node
count--;
trailCurrent.link = current.link;
if (last == current) //node to be deleted
//was the last node
last = trailCurrent; //update the value
//of last
else
System.out.println("Item to be deleted is "
+ "not in the list.");
}//end else
}//end else
}//end deleteNode
public void splitAt(LinkedListClass<T> secondList, T item)
LinkedListNode<T> current;
LinkedListNode<T> trailCurrent;
int i;
boolean found;
if (first==null)
System.out.println("Empty.");
first=null;
last=null;
count--;
count=0;
else
current=first;
found=false;
i=1;
while(current !=null &&!found)
if(current.info.equals(item))
found= true;
else
trailCurrent=first;
current=first;
i++;
if(found)
if(first==current)
first.link=first;
last.link=last;
count--;
count=0;
else
first.link=current;
last.link=last;
last=null;
count = count- i+1;
count = i-1;
} else {
System.out.println("Item to be split at is "
+ "not in the list.");
first=null;
last=null;
count=0;
Any help or just advice would be fine. Im not the best at Java, better at VB. Am completely stumped! Thanks so much! -
Need help with creating invoice and list of invoices
Hello everybody,
I need to create Credit / Debit memo invoices and for this I try to use FM GN_INVOICE_CREATE in my Z program, please let me know if it is correct way to go?
As well I need to create list of Credit / Debit memo invoices, how to achieve this?
Thanks in advance.
Usefull answers will be awarded.
Regards, M.You can use RV_INVOICE_CREATE for credit memo and debit memo
list of credit and debit memo - use this FM - RV_INVOICE_LIST_CREATE
see the below sample code
refresh: XKOMFK, XKOMV,
XTHEAD, XVBFS,
XVBPA, XVBRK,
XVBRP, XVBSS.
clear : XKOMFK, XKOMV,
XTHEAD, XVBFS,
XVBPA, XVBRK,
XVBRP, XVBSS,
VBSK_I.
VBSK_I-SMART = 'F'.
XKOMFK-VBELN = v_deliv.
XKOMFK-VBTYP = 'J'.
APPEND XKOMFK.
CALL FUNCTION 'RV_INVOICE_CREATE'
EXPORTING
VBSK_I = VBSK_I
WITH_POSTING = 'C'
TABLES
XKOMFK = XKOMFK
XKOMV = XKOMV
XTHEAD = XTHEAD
XVBFS = XVBFS
XVBPA = XVBPA
XVBRK = XVBRK
XVBRP = XVBRP
XVBSS = XVBSS.
if sy-subrc eq 0.
COMMIT WORK.
flag = 'X'.
else.
message i011 with p_vbeln.
endif.
Reward Points if it is helpful
Thanks
Seshu -
Need help with CRM billing due list error!
Hi Experts,
I created a sales order which got split into 3 deliveries and upon pgi looks like 2 of the deliveries when to the incomplete billing due list with an error "Billing due list item for transaction ****** is blocked by user R3USER" . I see only delivery made it to the billing due list. Has anyone seen this error before if yes can you get me some incite on this pelase.
Appreciate your response. Thanks in advance!
Regards,
Div.Hi Divya,
first thing you can go to SM13 to see the reason for the update terminate. If you think the info provided there is something technical then you resort for an abapers help. Before that if you want analyse in another way why its happening take that invoice number which throws update terminate. Go to VF01 and try to do the invoice individually. Please check if it gives any error log and you may get more info.
regards
sadhu kishore -
Help with Joining two SharePoint lists using LINQ
Hi Guys,
I have found many threads with this question. Although I had one doubt. I wanted to know that while performing a Join operation on two SharePoint Lists using LINQ does the column on which we are performing the join operation need to be a Lookup column?
I was initially using CAML but since my lists does not contain lookup columns I switched to LINQ but my doubt still remains.
I would really appreciate any help from you guys and also would appreciate if I could get some examples that I could refer to.
Thank youJoins in LINQ to SharePoint 2010
How to: Query Using LINQ to SharePoint
This post is my own opinion and does not necessarily reflect the opinion or view of Slalom. -
Help with linking to filtered list
Hi,
I have a dynamic list which has several fields. One of the fields is Australian states, QLD, NSW.... I am trying to work out, with no success so far, how I would link from another page to the list where the States are filtered.
The reason for this is so that people from QLD will only see the list for QLD when they click the link and so on.
if anyone could help me with this I would appreciate it.
thanks
Cheers
laurenceGünter,
I did try that but the list still showed all the states. I have done what you suggest in other pages where I have a recordset.
SELECT *
FROM file_upload
WHERE file_upload.`file_state`='NT' AND file_upload.archive ='0'
ORDER BY file_uploaddate DESC
What I am trying and have no idea if this is possible, if you don't try you won't progess :-), is to have a link "QLD" on a page that when clicked will filter the list to "QLD".
Let me know if this does not make sense.
Cheers
Laurence
Maybe you are looking for
-
Error:Platform version '1.9.1,11'is not compatible with mini or max Version 1.9.1.15
Here is the entire error message: XULRUNNER Error:Platform version '1.9.1,11'is not compatible with mini version>=1.9.1.15 maxVersion<=1.9 1.15 This error occurs when i try to launch Mozilla FireFox
-
I looked at all the previous solutions, some of which were the same., but they didn't answer my question. Firefox 17.01 Ubuntu 12.04 If I go to Edit --> Preferences --> Advanced --> Encryption it looks like 'View Certificates' is the likeliest place
-
Running STAR program in Date Effective mode
Hi All, How the date effective mode of Synchronize Territory Assignment rule concurrent will work? Will it sync all the active territories in that date range? For example if I run the STAR program from 01-Mar-2010 to 31-Mar-2010, will it sync all the
-
Can't find Music tab in Purchased link?
Hi, I use the Romanian AppStore with iTunes 11 on OS X 10.8.2. I tried to download my previous music purchases but there's no Music tab under 'Quick Links -> Purchased' screen, it's attached below (and my account name is censored). Any way to fix thi
-
Skype I'm afraid my most recent post has been deleted. I fear either it was your mods or your terrible Security. Why should I spend my Money with skype when you guys are censoring my posts and have terrible security where people can use your own supp