Android system using 34-40% battery instead of 6-10%

android system using 34-40% battery instead of 6-10%. Battery graph has awake solid. Had google update that fixed this problem bout 10days ago and now it's started again. It's started and fixed itself 3times now. This time no google update but it's started again

Just upgrades google play services and 198fw update some uninstalling reinstalling apps google play services gapps package and couple of other google updates fixed problem. But got 1 new prob speed dual list. When you have it open hit home the app open button go back to phone dialer the speed dual list will be blank. Hit home again the app button swipe phone dialer closed then re open via shortcut they come back. So big big problem fixed. Also worked similar fix on mates z with similar prib

Similar Messages

Android system responsible for 70% battery?

Hi there! I am an android newbie coming from iPhone. I have had my S4 for 4 days now and am trying to tweek things to make my battery last all day (which it isn't so far!) When I check my battery in my settings I notice that it says Android System is at 70%. When I have looked online at other people's screen shots of their battery usage they are in the single digits. Am I doing something wrong and running something I shouldn't be? I always made it all day on my iPhone and bought the S4 after reading that the battery is fabulous. Will it impove after a few more days? The Verizon store told me to bring it back within 14 days and switch out battery if it doesn't get any better.
Thanks so much!

I am seeing this too on a Galaxy S4. I have only had it a few days. The software update was installed within 12 hours of activation and I have disabled several apps on the device. When I look at the details of what is using the Android system I see the following details.
30% discharge currently over 10h 30m
Android system has used 75% of the battery
Screen is 16%
Android system
CPU total 4m 33s
CPU foreground 38 seconds
Stay Awake 7m 47s
Included packages has a long list of apps and services. I stopped counted at 30, but there were many more.

Can use 9 cell battery instead of 6 Cell

Hello
My laptop model is hp Probook 4410s and have a battery of 6 cell, Battery model is 513128-251. Now I need to replace the battery. Please let me know whether hp probook 4410s will support 9 cell battery? does this create any hardware issue? also If i can use 9 cell battery can I use the same adaper or need to change
Please advise me
Regards
Vipin

There are aftermarket 9 cell batteries:
http://www.ebay.com/itm/9-Cell-Battery-Fit-HP-ProBook-4405-4406-4410s-4411s-4412-4413-4415s-4416s-/3...
There is no need to use a different AC adapter. I can't find if HP offers a "genuine" 9 cell battery. If you can find one of those it would be better but the "knockoff" aftermarket batteries will work.

When I create a New Folder (on the desktop or in Finder), the system uses the Generic Document Icon instead of the Generic Folder Icon. How can I change this back?

When I create a New Folder (on the desktop or in Finder), the system uses the Generic Document Icon instead of the Generic Folder Icon. How can I change this back?
All of a sudden I noticed that most of the folders on my computer were no longer using the folder icon, but the generic document icon. I had to manually change back the icon being used by opening Get Info for each folder and copying and pasting the generic folder icon from some folders that remained unchanged. Now whenever I create a New Folder (right click -> "New Folder"), the icon that shows up is the generic document icon (white page with top right corner turned down). And I have to manually change it so it shows up as a folder in Finder or on my desktop. I don't know why or how this switch happened. All of the folders now on my computer look ok, but I need to change the default so when I create a New Folder it uses the correct icon.
I have also Forced Relaunch of my Finder and rebooted the system. I downloaded Candybar but am not sure what will fix anything, so I haven't proceeded.
Anyone know how I can do this? Thanks.

Anyone?

Can we Use T Code MIRA instead of MIRO for posting incoming invoice?

Hi All,
Can we Use T Code MIRA instead of MIRO for posting incoming invoice?
While trying to post a incoming invoice using MIRO, I am getting a error "HKONT is EMPTY". But when using MIRA i could get the invoice posted.
And in which situations we use MIRA?
Thanks in Advance
Gopi Krishna

Hello
MIRA is for Invoice Verification in the Background
Purpose
This process is suitable for the following transactions:
Posting invoices with mass amounts of data for which no item check is required
Posting invoices referring to transactions not yet entered in the system
Entering Invoices for Verification in the Background (Without Item List)
When verifying invoices in the background, you enter only a small set of document header data, such as the invoice amount, the currency and the tax information. You also allocate the incoming invoice to a purchasing document or a vendor. The system saves the data and allocation criteria you enter.
At a later point, the system verifies the invoice in the background. It uses the allocation criteria you entered to determine the item list. It then calculates the net total from the item list.
If the net total = gross amount invoiced - tax amount (+/- tolerance), the system posts the invoice in the background.
If the net total ¹ gross amount invoiced - tax amount (+/- tolerance), the system does not post the invoice in the background. It saves the document header data and the items determined in the background; the saved document then has to be processed manually in Invoice Verification.
With Invoice Verification in the background, the system does not check for any quantity or price differences at item level. Since you do not enter any actual invoice item data, the system uses the default data for comparison.
Regards
Gregory Mathews

Mapping XML into 3rd party system using XIF adapter

Hi Gurus,
First of all let me thank all of you for a tremondous contribution you are making for these kind of topics(CRM XIF) in SDN. I could solve half my problems by looking into your replies.
But I have a new & similar problem now. I am able to create and send XML file of order data into 3rd party middleware system using XIF & SOAP framework. But the 3rd party system(business connector) is unable to parse this XML file in their system. They keep getting the error message invalid XML file. I tried testing that myself and it gives me the error 'SOAP-ENV' error. They even tried some workarounds using some SOAP wrappers but it still didn't work. They are asking me to provide a DTD (data type definition) to this XML file generated out of SAP. Not sure if anyone has seen a similar problem like this but our interface is stuck at this point.
Any suggestions would be helpful.
Thanks,
Sunil

Hi,
We have figured out this problem for ourselves. The 3rd party system gets this error because SAP generated 2 XML tags in the beginning of the XML file which cannot be interpreted by XML spy or many XML parsing softwares. When we deleted the first 2 tags we stopped getting that error. But it wasn't a feasible solution for us to delete the first 2 lines in the XML file and then save it and then parse it. We preferred an alternative approach via IDOC's instead of processing XML files directly. Its also better because the size of XML file is much bigger (15 mega) than Idoc ( max of 4 mega bytes). But if you have to process XML files only then you cannot do that for real time or near real time processing as the parsing of XML file nearly takes more than 10 min. And it is definitely not preferred way especially if your middleware system has the capability to process Idocs from a middleware architectural stand point.

How can i use the project code instead of project xml?

hello
i use the sessionbean+toplink structure,after i finish the o-r mapping by using the mapping work bench,i generate the project xml file,then in the "session.xml" file,i refer to the project xml,then i can use it from sessionbean.
i hear that if i use the project code instead of project xml file,it will be more performant,is that true?
otherwise,how can i use the project code instead of project xml file?i mean, in "session.xml", i can use the "<project-xml>" tag to refer to the project xml file,then in my session bean,i get the server session by read the "session.xml" file.but if i use the project code,how can i refer it from the "session.xml"?the examples that come with the toplink installation only tell me how can i use the project xml file within the session bean,it don't give me any clue about using the project code in the sesion bean,who can give me a step-by-step instruction and code snippet?
thank you very much?

There is a slight performance gain during session load at startup but there is no difference at runtime. The choice of which to use is dependent upon you build process. Whether it is easier to submit a new version of the class into the comile build process vs an XML file. In most cases it is just a preference of the development team.
When you use the project-class you'll need to generate the source code and compile it into your system. Typically it is packaged with the persistent classes. You may need to configure your environment so that the class-loaders have access to these classes (same for the XML case).
When using the project-class you simply replace the project-xml entry like this:
<project-class>oracle.toplink.demos.employee.relational.EmployeeProject</project-class>
The DTD for the session.xml file is found at <TOPLINK_HOME>\core\sessions_4_5.dtd. It is also in the documentation at:
http://otn.oracle.com/docs/products/ias/doc_library/90200doc_otn/toplink.903/b10064/a-sessio.htm#634246
Doug Clarke
Product Manager
Oracle9iAS TopLink

Error connecting SAP BW System using EP6.0

Hi All
I am trying to connect EP6.0 with SAP BW 3.1, using ITS.
I have created a 'system' in portal and my ITS test connection is successful. I chose 'SAP BW' as sytem instead of SAP R/3.
When I try to preview/access an iView which internally execute BW workbook, I am getting following error. Can anyone please guide me the possible solutions. As this is urgent, please provide help.
Sapgui 640 error window with the following message:
connection to partner broken
Time Wed Dec 12 16:15:03 2005
Component NI(Network interface)
Release 640
Version 37
Module ninti.c
Line 756
Method NiPRead(192.168.64.103/3320, hdl 1)
Return Code -6
System Call recv
Counter 1

Hi,
let me try to sort this out.
You want to use an ITS against a BW system using a SAP GUI for HTML. If you use the system type SAP R/3 everything is OK but if you use the system type SAP BW it doesn't work and you get a error message from your SAP GUI for Windows.
I'm not much aware of this but for me it looks like the portals iview is trying to use your SAP GUI for Windows to connect to your BW System (which is, as far as I understood, not what you intended).
If all my assumtions above are correct you should create a ITS iview (SAP IAC iView) against your BW system and everything should be OK then.
Regards Ralph

Login to multiple SAP systems using pwd of single SAP system

Hi All,
We have 3 different SAP servers, with sids: ECD, BWD, HRD.
for each user, a user with the same username is created in all three systems.
the user does not want to maintain 3 different passwords, instead only single password to be used in all systems. i.e. when he changes the password in system ECD, the changed password should work in other systems BWD and HRD as well.
if we were using SAP EP, we checked the possiblity of username based SSO and having portal login using only on system ECD.
but we are not using the portal, and all the users will access 3 sap systems using SAPGUI.
is there any way, where one system's password will work to login to other systems.
thanks in advance,
Madhu_1980

Hi Tim,
You're right about the fixed client for the MYSAPSSO2-ticket-issuing system. In the case for Java, the "client" is specified inthe UME parameter login.ticket_client. And the trusting ABAP system will have to add the Java system + "client" into its ACL (in addition to the certificate). This "client" will only play a role in that "trust" relationship.
As for launching the actual transaction via SSO, this is how it works.
SAPGUI transaction will be launched by a thing called Portal transaction iview. That iview will have a parameter called the System Object. The System Object will determine which ABAP system-client it will connect and logon on to. So if you want to logon to multiple clients, then create one System Object for each of the system-client combination, and then create transaction iviews to each of the corresponding system object. The iviews will be presented to the user which then allows the user to launch the transaction iview (specificy SAPGUI link in the iview property)
https://help.sap.com/saphelp_nw74/helpdata/en/4e/1262711e3d2287e10000000a15822b/content.htm
I hope I understood your questions.
Cheers
Donald

A suggestion : use "loop array list" instead of ArrayList / LinkedList

ArrayList is good at:
get / set by index : O(1)
appending : O(log(n))
remove last : O(1)
and very bad at:
add middle : O(n)
remove from middle : O(n)
LinkedList is good at:
fast remove from middle, if your iteraror already goes there : O(1)
convenient methods : addFirst, addLast, removeFirst, removeLast : O(1)
and very bad at :
get / set by index : O(n)
here I want to make a suggestion : use "loop array list" instead of the ArrayList and LinkedList.
a "loop array list" is based on array, just like ArrayList. But it has 2 member-variables : the start position, and the real size. the start position can be anywhere within array.length. an element of index "i" is stored in array[ start + i ], and when (start + i > array.length), loop to the beginning of the array; when (start + i < 0), loop to the end of the array.
this "loop array list" has all the good sides:
get / set by index : O(1)
add first / last : O(log(n))
remove first / last : O(log(n))
add / remove from middle : O(n)
(note : because we shrink the backup-array when the real size is too small, add / remove operation take O(log(n)) now.)
the only problem is : add / remove from middle. let's take a look at it.
1. the LinkedList does NOT really add/remove from middle in O(1), you has to locate the element, which is O(n).
2. O(n) is acceptable, O(n^2) is not acceptable. try this : keep removing first element from an very big ArrayList ( size>10^6 ) until it's empty.
the fact is, any list can perform batch-remove / batch-add operation in O(n) instead of O(n^2). it's easy : allocate a new list, iterate the original list, copy the element into the new list if condition is satisfied.
so, instead of "remove from middle", what we need is a new methods : removeAllByCondition( Condition condition ), and now the batch-remove operation can be done in O(n)
here is an implementation of mine. I've tested it on my computer( 512mem + 2G cpu, win2k + jdk1.5 ), it's amazing, just a little slower then ArrayList when add last, and a liitle slower then LinkedList when batch-remove. in all other cases, it's far more better then those 2 kinds of List.
// source code : List2
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.Set;
public final class List2<T> extends AbstractList<T> {
private static int initialArrayLength = 4;
private T[] array;
private int start;
private int size;
private void init( T[] newArray, int start_a, int size_a ) {
array = newArray;
start = start_a;
size = size_a;
@SuppressWarnings("unchecked")
private void init() {
init( (T[]) new Object[ initialArrayLength ], 0, 0 );
public List2() {
     init();
@SuppressWarnings("unchecked")
public List2( Collection<? extends T> collection ) {
     init(
          collection.toArray( (T[]) new Object[ collection.size() * 11 / 10 + 1 ] ),
          0,
          collection.size()
private List2( T[] array_a, int start_a, int size_a ) {
     init( array_a, start_a, size_a );
@SuppressWarnings("unchecked")
public static <TT> List2<TT> createV( TT... elements ) {
     TT[] array = (TT[]) new Object[ elements.length * 11 / 10 + 1 ];
     System.arraycopy( elements, 0, array, 0, elements.length );
     return new List2<TT>( array, 0, elements.length );
public static List2<Double> create( double... elements ) {
     Double[] array = new Double[ elements.length * 11 / 10 + 1 ];
     for( int i=0; i < elements.length; i++ )
          array[i] = elements;
     return new List2<Double>( array, 0, elements.length );
public static List2<Integer> create( int... elements ) {
     Integer[] array2 = new Integer[ elements.length * 11 / 10 + 1 ];
     for( int i=0; i < elements.length; i++ )
          array2[i] = elements[i];
     return new List2<Integer>( array2, 0, elements.length );
public static List2<Character> create( char... elements ) {
     Character[] array2 = new Character[ elements.length * 11 / 10 + 1 ];
     for( int i=0; i < elements.length; i++ )
          array2[i] = elements[i];
     return new List2<Character>( array2, 0, elements.length );
public static List2<Character> create( String s ) {
     return create( s.toCharArray() );
public List2<T> clone() {
     return new List2<T>( this );
// basic
public int size() {
     return size;
private int index( int index ) {
     int i = start + index;
     if( i >= array.length )
          i -= array.length;
     return i;
public T get( int d ) {
     if( d < 0 || d >= size )
          throw new IndexOutOfBoundsException();
     if( size == 0 )
          throw new NoSuchElementException();
     return array[ index( d ) ];
public T set( int index, T element ) {
     if( index < 0 || index >= size )
          throw new IndexOutOfBoundsException();
     int i = index( index );
     T oldElement = array[i];
     array[i] = element;
     return oldElement;
@SuppressWarnings("unchecked")
private void copyAndSetToNewArray( int newArrayLength ) {
     T[] newArray = (T[]) new Object[ newArrayLength ];
     for( int i=0; i<size; i++ )
          newArray[i] = array[ index( i ) ];
     init( newArray, 0, size );
public void addFirst( T element ) {
     if( size == array.length )
          copyAndSetToNewArray( size * 3 / 2 + 1 );
     int i = index( array.length - 1 );
     array[ i ] = element;
     start = i;
     size++;
public void addLast( T element ) {
     if( size == array.length )
          copyAndSetToNewArray( size * 3 / 2 + 1 );
     array[ index( size ) ] = element;
     size++;
public T removeFirst() {
     if( size == 0 )
          throw new NoSuchElementException();
     T oldElement = array[ start ];
     array[ start ] = null;
     start = index( 1 );
     size--;
     if( array.length > size * 2 + 1 )
          copyAndSetToNewArray( size * 11 / 10 + 1 );
     return oldElement;
public T removeLast() {
     if( size == 0 )
          throw new NoSuchElementException();
     int i = index( size - 1 );
     T oldElement = array[i];
     array[i] = null;
     size--;
     if( array.length > size * 2 + 1 )
          copyAndSetToNewArray( size * 11 / 10 + 1 );
     return oldElement;
@SuppressWarnings("unchecked")
public int removeAll( ListCondition<T> condition ) {
     T[] newArray = (T[]) new Object[ array.length ];
     int iNew = 0;
     for( int i=0; i < size; i++ ) {
          T element = get( i );
          if( ! condition.isConditionSatisfied( this, i, element ) )
               newArray[ iNew++ ] = element;
     int oldSize = size;
     init( newArray, 0, iNew );
     if( array.length > size * 2 + 1 )
          copyAndSetToNewArray( size * 11 / 10 + 1 );
     return size - oldSize;
// aux
public boolean equals(Object obj) {
     if( obj == this )
     return true;
     if( obj instanceof List2 ) {
          List2 that = (List2) obj;
          if( this.size != that.size )
               return false;
          for( int i=0; i < size; i++ )
               if( ! Tools.equals( this.array[ this.index(i) ], that.array[ that.index(i) ] ) )
                    return false;
          return true;
     if( obj instanceof List ) {
          List that = (List) obj;
          if( this.size != that.size() )
               return false;
          Iterator thatIter = that.iterator();
          for( int i=0; i < size; i++ )
               if( ! Tools.equals( this.array[ this.index(i) ], thatIter.next() ) )
                    return false;
          return true;
     return true;
public int hashCode() {
     int hashCode = 1;
     for( int i=0; i < size; i++ ) {
          T element = array[ index( i ) ];
     hashCode = 31*hashCode + ( element==null ? 0 : element.hashCode() );
     return hashCode;
public boolean isEmpty() {
     return size == 0;
public T getFirst() {
     return get( 0 );
public T getLast() {
     return get( size() - 1 );
public T getRandom() {
     return get( (int) (Math.random() * size) );
public int indexOf( Object element ) {
     for( int i=0; i < size; i++ )
          if( Tools.equals( array[ index( i ) ], element ) )
               return i;
     return -1;
public int lastIndexOf( Object element ) {
     for( int i=size-1; i >= 0; i-- )
          if( Tools.equals( array[ index( i ) ], element ) )
               return i;
     return -1;
public boolean contains( Object element ) {
     return indexOf( element ) != -1;
public boolean add( T element ) {
     addLast( element );
     return true;
@Deprecated
public void add( int index, T element ) {
     throw new UnsupportedOperationException();
public T remove() {
     return removeFirst();
@Deprecated
public boolean remove( Object element ) {
     throw new UnsupportedOperationException( "use removeAll( Condition ) instead" );
@Deprecated
public T remove( int index ) {
     throw new UnsupportedOperationException( "use removeAll( Condition ) instead" );
public void clear() {
     init();
public Object[] toArray() {
     Object[] result = new Object[ size ];
     for( int i=0; i < size; i++ )
     result[i] = array[ index( i ) ];
     return result;
@SuppressWarnings("unchecked")
public <TT> TT[] toArray( TT[] a ) {
if( a.length < size )
a = (TT[]) java.lang.reflect.Array.newInstance( a.getClass().getComponentType(), size );
for( int i=0; i < size; i++ )
a[i] = (TT) array[ index( i ) ];
if( a.length > size )
     a[size] = null;
return a;
@SuppressWarnings("unchecked")
public void sort() {
     Object[] a = toArray();
     Arrays.sort( a );
     for( int i=0; i < size; i++ )
          array[ i ] = (T) a[ i ];
     start = 0;
@SuppressWarnings("unchecked")
public void sortDesc() {
     Object[] a = toArray();
     Arrays.sort( a );
     for( int i=0, j=size-1; i < size; i++, j-- )
          array[ i ] = (T) a[ j ];
     start = 0;
@SuppressWarnings("unchecked")
public void sort( Comparator<T> comparator ) {
     T[] a = (T[]) toArray();
     Arrays.sort( a, comparator );
     for( int i=0; i < size; i++ )
          array[ i ] = a[ i ];
     start = 0;
@SuppressWarnings("unchecked")
public void sortDesc( Comparator<T> comparator ) {
     T[] a = (T[]) toArray();
     Arrays.sort( a, comparator );
     for( int i=0, j=size-1; i < size; i++, j-- )
          array[ i ] = a[ j ];
     start = 0;
public String toString( String delimiter ) {
     return toString( "", delimiter, "", size() );
public String toString( String prefix, String delimiter, String suffix, int max ) {
     StringBuffer stringBuffer = new StringBuffer( prefix );
     int dest = Math.min( max, size );
     for( int i=0; i < dest; i++ ) {
          stringBuffer.append( get(i) );
          if( i < dest - 1 )
               stringBuffer.append( delimiter );
     if( size > max )
          stringBuffer.append( "...(" ).append( size() - max ).append( " more)" );
     stringBuffer.append( suffix );
     return stringBuffer.toString();
// batch operation
public boolean containsAll( Collection<?> that ) {
     Set<Object> thisSet = new HashSet<Object>( this );
     for( Object element : that )
          if( ! thisSet.contains( element ) )
               return false;
     return true;
@SuppressWarnings("unchecked")
public List2<T> subList( int fromIndex, int toIndex ) {
     if( fromIndex < 0 || toIndex > size || toIndex < fromIndex )
          throw new IndexOutOfBoundsException();
     int newSize = toIndex - fromIndex;
     T[] newArray = (T[]) new Object[ newSize * 11 / 10 + 1 ];
     for( int i=fromIndex, iNew=0; i < toIndex; i++, iNew++ )
          newArray[ iNew ] = array[ index( i ) ];
     return new List2<T>( newArray, 0, newSize );
public void addV( T... that ) {
     for( T element : that )
          addLast( element );
public boolean addAll( Collection<? extends T> that ) {
     for( T element : that )
          addLast( element );
     return ! that.isEmpty();
@Deprecated
public boolean addAll( int index, Collection<? extends T> c ) {
     throw new UnsupportedOperationException();
public void removeRest( T element ) {
     int position = lastIndexOf( element );
     if( position == -1 )
          return;
     while( ! Tools.equals( element, removeLast() ) );
public void removeAllEquals( final T element ) {
     removeAll( new ListCondition<T>() { public boolean isConditionSatisfied(List2 list, int index, T currentElement) {
          return currentElement.equals( element );
public void removeAllBetween( final T from, final T to ) {
     removeAll( new ListCondition<T>() {
          @SuppressWarnings("unchecked")
          public boolean isConditionSatisfied(List2 list, int index, T element) {
               if( from != null && ((Comparable) from).compareTo( element ) > 0 )
                    return false;
               if( to != null && ((Comparable) to).compareTo( element ) <= 0 )
                    return false;
               return true;
public boolean retainAll( Collection<?> that ) {
     final Set<Object> thatSet = new HashSet<Object>( that );
     int removeCount = removeAll( new ListCondition<T>() { public boolean isConditionSatisfied(List2 list, int index, T element) {
          return ! thatSet.contains( element );
     return removeCount > 0;
public boolean removeAll( Collection<?> that ) {
     final Set<Object> thatSet = new HashSet<Object>( that );
     int removeCount = removeAll( new ListCondition<T>() { public boolean isConditionSatisfied(List2 list, int index, T element) {
          return thatSet.contains( element );
     return removeCount > 0;
// unit test
private static int maxTestCount = 1000 * 1000;
public static void unitTest() throws Exception {
     // thest thoese methods for one time
     Tools.ensureEquals( new List2(), new ArrayList() );
     Tools.ensureNotEquals( List2.create( "abcde" ), new ArrayList() );
     Tools.ensureNotEquals( List2.create( "abcde" ), List2.create( "abcdef" ) );
     final List<Double> list1 = new ArrayList<Double>();
     final List2<Double> list2 = new List2<Double>();
     Runnable[] tasks = new Runnable[] {
          // test those methods that do NOT change the list
          new Runnable() { public void run() {
               Tools.ensureEquals( new List2<Double>( list1 ), list1 );
               Tools.ensureEquals( List2.createV( list1.toArray() ), list1 );
               Tools.ensureEquals( List2.createV( list1.toArray( new Double[0] ) ), list1 );
               double[] doubles = new double[ list1.size() ];
               int i = 0;
               for( double d : list1 )
                    doubles[i++] = d;
               Tools.ensureEquals( List2.create( doubles ), list1 );
               Tools.ensure( list1.isEmpty() == list2.isEmpty() );
               Arrays.equals( list1.toArray(), list2.toArray() );
               Tools.ensureEquals( list1, list2.clone() );
               Double notExistElement = -2.0;
               Tools.ensure( list1.indexOf( notExistElement ) == -1 );
               Tools.ensure( list1.lastIndexOf( notExistElement ) == -1 );
               Tools.ensure( list1.contains( notExistElement ) == false );
               Tools.ensureEquals( list1.toString(), list2.toString() );
               Tools.ensureEquals( list1.toString(), list2.toString() );
               Tools.ensureEquals( list1.hashCode(), list2.hashCode() );
               if( list1.isEmpty() )
                    return;
               Tools.ensure( list1.get(0).equals( list2.getFirst() ) );
               Tools.ensure( list1.get(list1.size()-1).equals( list2.getLast() ) );
               Double existRandomElement = list2.getRandom();
               Tools.ensure( list1.contains( existRandomElement ) );
               Tools.ensure( list2.contains( existRandomElement ) );
               Tools.ensure( list1.indexOf( existRandomElement ) == list2.indexOf( existRandomElement ) );
               Tools.ensure( list1.indexOf( existRandomElement ) == list2.indexOf( existRandomElement ) );
               int from = (int) (Math.random() * list1.size());
               int to = (int) (Math.random() * (list1.size()+1));
               if( from > to ) {
                    int t = from;
                    from = to;
                    to = t;
               Tools.ensureEquals( list1.subList( from, to ), list2.subList( from, to ) );
          // test those methods that change the list
          new Runnable() { public void run() {
               if( list1.isEmpty() )
                    return;
               int i = (int) (Math.random() * list1.size());
               double d = Math.random();
               list1.set( i, d );
               list2.set( i, d );
          new Runnable() { public void run() {
               if( list1.isEmpty() )
                    return;
               int i = (int) (Math.random() * list1.size());
               Tools.ensure( list1.get( i ).equals( list2.get( i ) ) );
          new Runnable() { public void run() {
               double d = Math.random();
               list1.add( 0, d );
               list2.addFirst( d );
          new Runnable() { public void run() {
               double d = Math.random();
               list1.add( d );
               list2.addLast( d );
          new Runnable() { public void run() {
               double d = Math.random();
               list1.add( d );
               list2.addLast( d );
          new Runnable() { public void run() {
               if( list1.isEmpty() )
                    return;
               Tools.ensure( list1.remove( 0 ).equals( list2.removeFirst() ) );
          new Runnable() { public void run() {
               if( list1.isEmpty() )
                    return;
               Tools.ensure( list1.remove( list1.size() - 1 ).equals( list2.removeLast() ) );
          new Runnable() { public void run() {
               if( list1.isEmpty() )
                    return;
               int i = 0;
               for( Iterator<Double> iter=list1.iterator(); iter.hasNext(); i++ ) {
                    iter.next();
                    if( i % 3 == 0 )
                         iter.remove();
               list2.removeAll( new ListCondition<Double>() { public boolean isConditionSatisfied(List2 list, int index, Double element) {
                    return index % 3 == 0;
          new Runnable() { public void run() {
               double d = Math.random();
               list1.add( d );
               list2.add( d );
          new Runnable() { public void run() {
               if( list1.isEmpty() )
                    return;
               Tools.ensure( list1.remove(0).equals( list2.remove() ) );
          new Runnable() { public void run() {
               if( list1.isEmpty() )
                    return;
               int r = (int) (Math.random() * list1.size());
               Double element = list1.get( r );
               int index = list1.lastIndexOf( element );
               for( int i=list1.size()-1; i>=index; i-- )
                    list1.remove( i );
               list2.removeRest( element );
          new Runnable() { public void run() {
               list2.removeRest( Math.random() - 2 );
          new Runnable() { public void run() {
               list1.clear();
               list2.clear();
          new Runnable() { public void run() {
               Collections.sort( list1 );
               list2.sort();
          new Runnable() { public void run() {
               Collections.sort( list1 );
               Collections.reverse( list1 );
               list2.sortDesc();
          new Runnable() { public void run() {
               Comparator<Double> comparator = new Comparator<Double>() { public int compare(Double o1, Double o2) {
                    return o1.toString().substring(2).compareTo( o2.toString().substring(2) );
               Collections.sort( list1, comparator );
               list2.sort( comparator );
          new Runnable() { public void run() {
               Comparator<Double> comparator = new Comparator<Double>() { public int compare(Double o1, Double o2) {
                    return o1.toString().substring(2).compareTo( o2.toString().substring(2) );
               Collections.sort( list1, comparator );
               Collections.reverse( list1 );
               list2.sortDesc( comparator );
          new Runnable() { public void run() {
               Double notExistElement = -2.0;
               list2.removeAllEquals( notExistElement );
               Tools.ensureEquals( list1, list2 );
               list2.removeAllBetween( 0.5, 0.6 );
               for( Iterator<Double> iter=list1.iterator(); iter.hasNext(); ) {
                    double d = iter.next();
                    if( d >= 0.5 && d < 0.6 )
                         iter.remove();
               Tools.ensureEquals( list1, list2 );
     System.out.print( "test List2 " );
     for( int i=0; i < maxTestCount; i++ ) {
          tasks[ (int) (Math.random() * tasks.length) ].run();
          Tools.ensureEquals( list1, list2 );
          if( i % (maxTestCount/10) == 0 )
               System.out.print( "." );
     System.out.println( " ok" );
// source code : ListCondition
public interface ListCondition<T> {
boolean isConditionSatisfied( List2 list, int index, T element );

Hi,
I have the following statement:
private List list = new ArrayList();
why not use private ArrayList list = new
ArrayList()?
I know ArrayList implements List, so list has a wide
scope, right? What's the benefit?
Thanks,
JieBy using the interface you are not tied to a specific implementation.
Later, you may determine that using a LinkedList is more efficient to your specific code and then all you need to do is change the statement to:
private List list = new LinkedList();As long as you are not casting the list reference to ArrayList (or something along those lines) you would not need to change anything else.

Unable to load performance pack. Using Java I/O instead. Please ensure...

Hi there.
I am running WL 1033 development version using 64-bit 1.6.1 jdk (jdk-6u21-windows-x64) and the performance is terrible. I have upped my mem settings to this:
set MEM_ARGS=-Xms1024m -Xmx1408m -XX:PermSize=1024m -XX:MaxPermSize=1024m
and after a couple of deploys, I still get out of memory errors.
I notice this message on startup: <BEA-000438> <Unable to load performance pack. Using Java I/O instead. Please ensure that wlntio.dll is in:
Could this be part of my performace issues? If so, how do I fix it?
I followed the install directions in the README.txt file from this zip file: wls1033_dev.zip
Mike

Hi Mike,
If you are using 64 bit of Windows Operating System then Make sure that you add the following directory in the *"java.library.path"*....
Directory: E:\bea1033\wlserver_10.3\server\native\win\64
Example: In your servers start Script please add the following MEM_ARGS or in JAVA_OPTIONS:
<b><font color=maroon>
set MEM_ARGS= -Xms1024m -Xmx1408m -XX:PermSize=1024m -XX:MaxPermSize=1024m -Djava.library.path=E:\bea1033\wlserver_10.3\server\native\win\64</font></b>
Thanks
Jay SenSharma
http://middlewaremagic.com/weblogic (Middleware Magic Is Here)

Bpm UWL iview , it is possile to use BPM UWL iview instead of standard UWL iview?

Hi
It is possible to use BPM UWL iview instead of standard UWL iview?
if yes then how?
thanks in advance

Hi Radhesh,
If you need to get some BPM skills then try the BPM space itself or better yet the Process Orchestration space has the most recent materials by checking out the materials in http://scn.sap.com/community/process-orchestration
Apart from that the BPM forum can help you, but it's always best to post one question at a time.
Perhaps you could be clearer about what you are looking for?
Is it an approach to the process?
Is it how to call the backend system?
Is it how to work with the user interfaces?
Think about it carefully and then start a new discussion for each issue.
Rgds,
Jocelyn

Background data drained by android system even when disabled

Hi all
I am using Z3 compact and I opted to restrict my background data use. However I found that the Android system keeps draining my mobile data (around 600 mb in a week but my data plan is only 1gb per month) anyways to resolve the issue ?

Hello,
Yes, the following setting has been activated for a long time:
Settings > Data Usage > (Overflow Menu?) Menu > Restrict background data
Apps draining most data&colon;
1. Android OS (Background: 681 Mb, Foreground: 0 Mb)
2. Facebook (Background: 2.12 Mb, Foreground: 289 Mb)
3. Chrome (Background: 128 kb, Foreground: 148Mb)
I wonder why the Android OS can still drain so much background data even under such setting.

IPhoto:How to update to use the DR API instead????

Ahoy.
While trying to figure out why safari keeps quitting on me, I found an answer to someone else, who was told to go into logs and I was floowing along, but I guess they are ahead of tiger- anwyay I did find this, and wonder, can I do as it suggests somehow?
iPhoto: WARNING: The DiscRec SPI from the DiscRecording framework is deprecated in 10.3 and later.
iPhoto: WARNING: This app is contributing to an overall degradation of system performance and should
iPhoto: WARNING: be updated to use the DR API instead.
iPhoto: WARNING: The DiscRec SPI from the DiscRecording framework is deprecated in 10.3 and later.
iPhoto: WARNING: This app is contributing to an overall degradation of system performance and should
iPhoto: WARNING: be updated to use the DR API instead.
Fin

BDAqua saved me a lot of typing. It wasn't clear, though, if you just needed to vent or if you're wanting to address these issues (which will involve a lot of typing).
One of the main ones you need to do before you do any installing or installing of Flash Player is deal with the disk that won't verify. Basically you're working with a computer that doesn't know where all its files are. The computer uses a directory to keep tack of them and your directory needs repairing. If you don't repair it then you'll just end up losing files, and getting more problems with running the computer. It's a little bit like never changing the oil in the car, or dealing with an oil leak when it happens.
First, if at all possible make a backup of the drive in its present configuration. If something goes wrong during repair attempts and makes things worse you will have a backup. You will have to decide how to work this in the light of any present backups you may have, for example, a backup that may be a few days out of date. In that case you may want to keep that one and make a second backup of this as they are now, though I realize people often don't have a lot of empty drives sitting around.
Boot from the System Installer disc that came with your computer or is the one for the version you currently have on there, select language if applicable, choose utilities, run Disk Utility and verify (and repair if necessary) the drive. You can verify a drive from DU on your main drive while booted but I have found this can result in incorrect reporting of errors. To repair your drive you have to run it from a drive other than the boot drive anyway.
Next, boot from your drive in [Safe Mode|http://docs.info.apple.com/article.html?artnum=107393] and repair permissions. You can repair permissions while booted from the installer disc but this uses the permissions configuration on the installer disc which may be out of date if you have run any updates on your computer. Booting your computer to Safe Mode restricts the number of things running on your computer while permissions are being run and does a bit of spring cleaning at the same time.
+Reading+
[Resolve startup issues and perform disk maintenance with Disk Utility and fsck|http://docs.info.apple.com/article.html?artnum=106214]
[Using Disk Utility in Mac OS X 10.4.3 or later|http://docs.info.apple.com/article.html?artnum=302672]
[Disk Utility's Repair Disk Permissions 10.0-10.6|http://docs.info.apple.com/article.html?artnum=25751]
"Try Disk Utility" (modified from [http://support.apple.com/kb/TS1417])
1. Insert the Mac OS X Install disc that came with your computer (Edit: Do not use this disc if it is not the same general version as what you have currently on your computer, e.g. use a Tiger disc for a Tiger drive, not a Panther disc), then restart the computer while holding the C key.
2. When your computer finishes starting up from the disc, choose Disk Utility from the Installer menu. (In Mac OS X 10.4 or later, you must select your language first.)
Important: Do not click Continue in the first screen of the Installer. If you do, you must restart from the disc again to access Disk Utility.
3. Click the First Aid tab.
4. Click the disclosure triangle to the left of the hard drive icon to display the names of your hard disk volumes and partitions.
5. Select your Mac OS X volume.
6. Click Repair. Disk Utility checks and repairs the disk."
Then boot in Safe Mode, (holding Shift key down at bootup; takes longer to boot this way so be patient), run Disk Utility in Applications>Utilities, then highlight your drive, click on Repair Permissions, reboot when it completes.
[Mac OS X: Starting up in Safe Mode|http://docs.info.apple.com/article.html?artnum=107393]
[What is Safe Boot, Safe Mode? (Mac OS X)|http://support.apple.com/kb/HT1564]
[Safe Boot takes longer than normal startup|http://docs.info.apple.com/article.html?artnum=107394]
[Mac OS X 10.4, 10.5- Computer shuts down during Safe Boot|http://support.apple.com/kb/TA24054]
There's some things Disk Utility won't repair (more often thatn not). In that case you need to use a tool such as Diskwarrio (probably #1 but only does this one thing), or TechTool Pro, or...

Y_GCD_19000119 report problem. System is picking M rate instead of P rate.

Hi,
Report Y_GCD_19000119 should use the 'P' Exchange Rate (Standard translation for cost planning) when converting from EUR to USD. Currently the report is not converting at the correct rate, which can be demonstrated when comparing a manual calculation with the P rate versus the rate being used in SAP, and noting that the two do not match.
The system is picking 'M' Rate instead of 'P' Rate.
Thanks.

Hi Ravi,
Please check the configuration in SPRO under Controlling > Cost Center Accounting>Planning --> Manual Planning --> User-Defined Planning Layouts --> Create Planning Layouts for Activity Type Planning
Click on Fixed Price and change the required currency.
Than You.
Regards,
AVD

Android system using 34-40% battery instead of 6-10%

Similar Messages

Maybe you are looking for