Position Code in a Payslip
Hi ,
How to Add a Position Code in a Payslip?
Goto PE51,
In Backgroung type the Text as Position r ur req
In Singel Field use the Tabel as P0001 and the Table Field as PLANS.
Align the column and rows in the statement
Similar Messages
-
Can anyone help. How we can create Position Code in SAP HR Module in OM(Organizational Management) what transaction Code and Infotype we will have to use?
Thanks
KamalHi Kamindia ,
Use PO13 Transaction ,write the code to position field ,select object infotype (1000) and click create.
Regards,
Dilek -
How to get Business Partner Number from Position Code
Please help me in determining the Business Partner assigned to a particular position in the Organizational Structure.
Short code of the position is available in table HRP1000 field SHORT.
Thanks in advanceDear Saurabh
You can determine business partner assigned to organization by using PDP.
When you assign partner to organization, in relationship tab of partner we notice relationship of "is employee responsible".
we can use this relation to determine patner assigned to org
Step 1: Define partner function
Step 2: Define Access Sequence..Here use "BP relationship" and specify the partner function that you are going to determine from organization.
Step 3: Define PDP
Step 4: Goto business partner relationship and select maintained sales org and your partner function.
Your pdp will be able to determine partner assigned to organization. -
Can position be created with out creating Job..
Hi Experts,
A simple question but quite complicated.
Can position be created with out creating the job. ( yes it will give the warning and create).
Here my actual question comes, what is the need of creating the Job. when we can create position without job in general Scenario.
Is it compulsory to create job whenever we create position.
Your replies are highly appreciated.
Thanks in advance.
Regards,
DolllyHi Dolly,
I definitely aggree with what guru Sikindar mentions.
One more point:
SAP advises to create separate positions for each of the employees in your organizational structure.
For example, there may be a hundred "Engineer" positions in your company (with codes: 50000001, 50000002, ... 50000100).
At this point, when you're asked to take a report of all of the "Engineer"s in your company, then you need to enter all these position codes into the selection screen : Nearly impossible scenario!
However, if you had linked all of these positions to a single job named "Engineer" and numbered "50000000", then you would be able to find all the positions linked to this job and all the employees holding these positions by entering a single object ID and evaluation path in the selection screen of a particular report.
Regards,
Dilek -
After zoom in/out to open callout is wrong position
Dear All
After zoom in/out screen , i open callout.
I'm having problems with its position
code:
<fx:Declarations>
<s:Callout id="bCallout"
mouseDownOutside="bCallout.close()"
mouseUp="bCallout.close()"
backgroundColor="0x999999"
contentBackgroundAlpha="0"/>
</fx:Declarations>
<fx:Script>
private function zoom_action(act:String):void {
var z:Number;
if(act=='+'){
z=0.25;
}else{
z=-0.25;
var my_matrix:Matrix = new Matrix();
my_matrix.scale(gr1.scaleX+z, gr1.scaleX+z);
gr1.transform.matrix=my_matrix;
</fx:Script>
<s:Group id="gr1">
<s:Button id="btn1" x="24" y="50" label="btnA" click="bCallout.open(btn1)"/>
<s:Button id="btn2" x="100" y="100" label="btnB" click="bCallout.open(btn2)"/>
<s:Button id="btn3" x="170" y="150" label="btnC" click="bCallout.open(btn3)"/>
</s:Group>
<s:Button id="zoomin" y="10" right="108" width="44" height="42" label="+" alpha="0.5"
click="zoom_action('+')"/>
<s:Button id="zoomout" y="10" right="59" width="44" height="42" label="-" alpha="0.5"
click="zoom_action('-')"/>
Any ideas what I'm doing wrong?You need a Mac user to come along and give you better advice, but meanwhile, Goggle
photoshop cc lag yosemite
You are _not_ alone. -
Erecruit JOBID not stored in table Hrp5125 when choosing a vacant position
Hi
Does anyone know where the Position ID or Job Id is stored, if you have selected and saved the position code under the Organisation Data tab under the Position tab as the recruiter. I see that if you choose the Organisation UNit and Job tab, th ejob id is saved under JOBID in HRP5125. I need to know urgently so response will be extremely appreciated.
Thanks
NasHi,
the tabs within the tab for requisition organizational data have a different behaviour.The second tab where you enter org.unit and job stores directly into HRP5125.
But if you assign one or more positions to the requisition they are linked through relations via HRP1001 to the requisition object. The org.unit and the job to these positions are linked again via HRP1001.
It is not really important to know where the data is stored. If you want to read it just use class CL_HRRCF_REQUI_BL method GET_POS_OF_REQ_WT. It should give you all information you need.
Best Regards
Roman Weise -
In this assignment you are asked to create a Java class that simulates the Java Vector class. You are also asked to create two Exception classes to allow the program to continue if errors occur. These are �MyVectNoDataException� and �MyVectIndexOutOfBoundsException�.
1. Write a Java class called �myVect� which will operate in the same way as the Java Vector class. In particular it should have
a. The following data members
i. An Object array
ii. An integer �size� that determines the size of the array
iii. An integer �increment� that defines the number of additional elements that will be added when the Array is to be resized.
b. The following methods
i. Constructor 1 myVect()that creates a new myVect object with an internal array size of 10 and an increment of 3.
ii. Constructor 2 myVect(int s)
that creates a new myVect object with an internal array size of s and an increment of 3.
iii. Constructor 3 myVect(int s, int i)
that creates a new myVect object with an internal array size of s and an increment of i.
iv. A method void resize()
that increases the size of the internal array by the number of elements in the �increment� variable.
v. A method void addElement(Object o)
that inserts an Object at the next available position in the internal array. If there are less than 3 vacant elements left in the array then the resize() method should be run automatically.
vi. A method void deleteElement()
that deletes the Object at the last occupied position in the internal array. If no element contains an Object then a MyVectNoDataException should be thrown and the program should continue.
vii. A method void insertElement(Object o,int p)
that inserts an Object at position p in the internal array. The Objects at position p and below should each be moved down by one position before the insertion.
If the index p is outside the bounds of the internal array then a MyVectIndexOutOfBoundsException should be thrown and the program should continue.
viii. A method void deleteElementAt(int p)
that deletes the Object at position p in the internal array. The Objects below position p should each be moved up by one position after the deletion. If the index p is outside the bounds of the internal array then a MyVectIndexOutOfBoundsException should be thrown and the program should continue.
If the position p is valid but does not contain an Object then a MyVectNoDataException should be thrown and the program should continue.
ix. A method Object getElement()
that returns the Object at the last occupied position in the internal array.
x. A method Object getElementAt(int p)
that returns the Object at position p in the internal array. If the index p is outside the bounds of the internal array then a MyVectIndexOutOfBoundsException should be thrown and the program should continue. If the position p is valid but does not contain an Object then a MyVectNoDataException should be thrown and the program should continue.
xi. A toString() method that produces a formatted String representing the myVect object and its data. It should also include the size and increment values.
c. Write a Java program called Assign3.java that creates a myVect object then
i. Store 6 objects of the following types
1. String
2. Date
3. Integer
4. String
5. StringTokenizer
6. Date
ii. Print the myVect object.
iii. Add 2 more objects
1. StringBuffer
2. Double
iv. Print the myVect object
v. Delete the Object at position 2
vi. Delete the Object at position 15
vii. Display the Object at position 10
viii. Display the length of the second String.
ix. Print the myVect object
d. Include Javadoc comments in the myVect class code then produce Java documentation using Javadoc.* @(#)MyOwnVectorReallyItIs.java 1.89 03/01/23
* Copyright 2003 Sun Microsystems, Inc. All rights reserved.
* SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
package java.util;
* The <code>MyOwnVectorReallyItIs</code> class implements a growable array of
* objects. Like an array, it contains components that can be
* accessed using an integer index. However, the size of a
* <code>MyOwnVectorReallyItIs</code> can grow or shrink as needed to accommodate
* adding and removing items after the <code>MyOwnVectorReallyItIs</code> has been created.<p>
* Each MyOwnVectorReallyItIs tries to optimize storage management by maintaining a
* <code>capacity</code> and a <code>capacityIncrement</code>. The
* <code>capacity</code> is always at least as large as the MyOwnVectorReallyItIs
* size; it is usually larger because as components are added to the
* MyOwnVectorReallyItIs, the MyOwnVectorReallyItIs's storage increases in chunks the size of
* <code>capacityIncrement</code>. An application can increase the
* capacity of a MyOwnVectorReallyItIs before inserting a large number of
* components; this reduces the amount of incremental reallocation. <p>
* As of the Java 2 platform v1.2, this class has been retrofitted to
* implement List, so that it becomes a part of Java's collection framework.
* Unlike the new collection implementations, MyOwnVectorReallyItIs is synchronized.<p>
* The Iterators returned by MyOwnVectorReallyItIs's iterator and listIterator
* methods are <em>fail-fast</em>: if the MyOwnVectorReallyItIs is structurally modified
* at any time after the Iterator is created, in any way except through the
* Iterator's own remove or add methods, the Iterator will throw a
* ConcurrentModificationException. Thus, in the face of concurrent
* modification, the Iterator fails quickly and cleanly, rather than risking
* arbitrary, non-deterministic behavior at an undetermined time in the future.
* The Enumerations returned by MyOwnVectorReallyItIs's elements method are <em>not</em>
* fail-fast.
* <p>Note that the fail-fast behavior of an iterator cannot be guaranteed
* as it is, generally speaking, impossible to make any hard guarantees in the
* presence of unsynchronized concurrent modification. Fail-fast iterators
* throw <tt>ConcurrentModificationException</tt> on a best-effort basis.
* Therefore, it would be wrong to write a program that depended on this
* exception for its correctness: <i>the fail-fast behavior of iterators
* should be used only to detect bugs.</i><p>
* This class is a member of the
* <a href="{@docRoot}/../guide/collections/index.html">
* Java Collections Framework</a>.
* @author Lee Boynton
* @author Jonathan Payne
* @version 1.89, 01/23/03
* @see Collection
* @see List
* @see ArrayList
* @see LinkedList
* @since JDK1.0
public class MyOwnVectorReallyItIs extends AbstractList
implements List, RandomAccess, Cloneable, java.io.Serializable
* The array buffer into which the components of the MyOwnVectorReallyItIs are
* stored. The capacity of the MyOwnVectorReallyItIs is the length of this array buffer,
* and is at least large enough to contain all the MyOwnVectorReallyItIs's elements.<p>
* Any array elements following the last element in the MyOwnVectorReallyItIs are null.
* @serial
protected Object elementData[];
* The number of valid components in this <tt>MyOwnVectorReallyItIs</tt> object.
* Components <tt>elementData[0]</tt> through
* <tt>elementData[elementCount-1]</tt> are the actual items.
* @serial
protected int elementCount;
* The amount by which the capacity of the MyOwnVectorReallyItIs is automatically
* incremented when its size becomes greater than its capacity. If
* the capacity increment is less than or equal to zero, the capacity
* of the MyOwnVectorReallyItIs is doubled each time it needs to grow.
* @serial
protected int capacityIncrement;
/** use serialVersionUID from JDK 1.0.2 for interoperability */
private static final long serialVersionUID = -2767605614048989439L;
* Constructs an empty MyOwnVectorReallyItIs with the specified initial capacity and
* capacity increment.
* @param initialCapacity the initial capacity of the MyOwnVectorReallyItIs.
* @param capacityIncrement the amount by which the capacity is
* increased when the MyOwnVectorReallyItIs overflows.
* @exception IllegalArgumentException if the specified initial capacity
* is negative
public MyOwnVectorReallyItIs(int initialCapacity, int capacityIncrement) {
super();
if (initialCapacity < 0)
throw new IllegalArgumentException("Illegal Capacity: "+
initialCapacity);
this.elementData = new Object[initialCapacity];
this.capacityIncrement = capacityIncrement;
* Constructs an empty MyOwnVectorReallyItIs with the specified initial capacity and
* with its capacity increment equal to zero.
* @param initialCapacity the initial capacity of the MyOwnVectorReallyItIs.
* @exception IllegalArgumentException if the specified initial capacity
* is negative
public MyOwnVectorReallyItIs(int initialCapacity) {
this(initialCapacity, 0);
* Constructs an empty MyOwnVectorReallyItIs so that its internal data array
* has size <tt>10</tt> and its standard capacity increment is
* zero.
public MyOwnVectorReallyItIs() {
this(10);
* Constructs a MyOwnVectorReallyItIs containing the elements of the specified
* collection, in the order they are returned by the collection's
* iterator.
* @param c the collection whose elements are to be placed into this
* MyOwnVectorReallyItIs.
* @throws NullPointerException if the specified collection is null.
* @since 1.2
public MyOwnVectorReallyItIs(Collection c) {
elementCount = c.size();
// 10% for growth
elementData = new Object[
(int)Math.min((elementCount*110L)/100,Integer.MAX_VALUE)];
c.toArray(elementData);
* Copies the components of this MyOwnVectorReallyItIs into the specified array. The
* item at index <tt>k</tt> in this MyOwnVectorReallyItIs is copied into component
* <tt>k</tt> of <tt>anArray</tt>. The array must be big enough to hold
* all the objects in this MyOwnVectorReallyItIs, else an
* <tt>IndexOutOfBoundsException</tt> is thrown.
* @param anArray the array into which the components get copied.
* @throws NullPointerException if the given array is null.
public synchronized void copyInto(Object anArray[]) {
System.arraycopy(elementData, 0, anArray, 0, elementCount);
* Trims the capacity of this MyOwnVectorReallyItIs to be the MyOwnVectorReallyItIs's current
* size. If the capacity of this MyOwnVectorReallyItIs is larger than its current
* size, then the capacity is changed to equal the size by replacing
* its internal data array, kept in the field <tt>elementData</tt>,
* with a smaller one. An application can use this operation to
* minimize the storage of a MyOwnVectorReallyItIs.
public synchronized void trimToSize() {
modCount++;
int oldCapacity = elementData.length;
if (elementCount < oldCapacity) {
Object oldData[] = elementData;
elementData = new Object[elementCount];
System.arraycopy(oldData, 0, elementData, 0, elementCount);
* Increases the capacity of this MyOwnVectorReallyItIs, if necessary, to ensure
* that it can hold at least the number of components specified by
* the minimum capacity argument.
* <p>If the current capacity of this MyOwnVectorReallyItIs is less than
* <tt>minCapacity</tt>, then its capacity is increased by replacing its
* internal data array, kept in the field <tt>elementData</tt>, with a
* larger one. The size of the new data array will be the old size plus
* <tt>capacityIncrement</tt>, unless the value of
* <tt>capacityIncrement</tt> is less than or equal to zero, in which case
* the new capacity will be twice the old capacity; but if this new size
* is still smaller than <tt>minCapacity</tt>, then the new capacity will
* be <tt>minCapacity</tt>.
* @param minCapacity the desired minimum capacity.
public synchronized void ensureCapacity(int minCapacity) {
modCount++;
ensureCapacityHelper(minCapacity);
* This implements the unsynchronized semantics of ensureCapacity.
* Synchronized methods in this class can internally call this
* method for ensuring capacity without incurring the cost of an
* extra synchronization.
* @see java.util.MyOwnVectorReallyItIs#ensureCapacity(int)
private void ensureCapacityHelper(int minCapacity) {
int oldCapacity = elementData.length;
if (minCapacity > oldCapacity) {
Object oldData[] = elementData;
int newCapacity = (capacityIncrement > 0) ?
(oldCapacity + capacityIncrement) : (oldCapacity * 2);
if (newCapacity < minCapacity) {
newCapacity = minCapacity;
elementData = new Object[newCapacity];
System.arraycopy(oldData, 0, elementData, 0, elementCount);
* Sets the size of this MyOwnVectorReallyItIs. If the new size is greater than the
* current size, new <code>null</code> items are added to the end of
* the MyOwnVectorReallyItIs. If the new size is less than the current size, all
* components at index <code>newSize</code> and greater are discarded.
* @param newSize the new size of this MyOwnVectorReallyItIs.
* @throws ArrayIndexOutOfBoundsException if new size is negative.
public synchronized void setSize(int newSize) {
modCount++;
if (newSize > elementCount) {
ensureCapacityHelper(newSize);
} else {
for (int i = newSize ; i < elementCount ; i++) {
elementData[i] = null;
elementCount = newSize;
* Returns the current capacity of this MyOwnVectorReallyItIs.
* @return the current capacity (the length of its internal
* data array, kept in the field <tt>elementData</tt>
* of this MyOwnVectorReallyItIs).
public synchronized int capacity() {
return elementData.length;
* Returns the number of components in this MyOwnVectorReallyItIs.
* @return the number of components in this MyOwnVectorReallyItIs.
public synchronized int size() {
return elementCount;
* Tests if this MyOwnVectorReallyItIs has no components.
* @return <code>true</code> if and only if this MyOwnVectorReallyItIs has
* no components, that is, its size is zero;
* <code>false</code> otherwise.
public synchronized boolean isEmpty() {
return elementCount == 0;
* Returns an enumeration of the components of this MyOwnVectorReallyItIs. The
* returned <tt>Enumeration</tt> object will generate all items in
* this MyOwnVectorReallyItIs. The first item generated is the item at index <tt>0</tt>,
* then the item at index <tt>1</tt>, and so on.
* @return an enumeration of the components of this MyOwnVectorReallyItIs.
* @see Enumeration
* @see Iterator
public Enumeration elements() {
return new Enumeration() {
int count = 0;
public boolean hasMoreElements() {
return count < elementCount;
public Object nextElement() {
synchronized (MyOwnVectorReallyItIs.this) {
if (count < elementCount) {
return elementData[count++];
throw new NoSuchElementException("MyOwnVectorReallyItIs Enumeration");
* Tests if the specified object is a component in this MyOwnVectorReallyItIs.
* @param elem an object.
* @return <code>true</code> if and only if the specified object
* is the same as a component in this MyOwnVectorReallyItIs, as determined by the
* <tt>equals</tt> method; <code>false</code> otherwise.
public boolean contains(Object elem) {
return indexOf(elem, 0) >= 0;
* Searches for the first occurence of the given argument, testing
* for equality using the <code>equals</code> method.
* @param elem an object.
* @return the index of the first occurrence of the argument in this
* MyOwnVectorReallyItIs, that is, the smallest value <tt>k</tt> such that
* <tt>elem.equals(elementData[k])</tt> is <tt>true</tt>;
* returns <code>-1</code> if the object is not found.
* @see Object#equals(Object)
public int indexOf(Object elem) {
return indexOf(elem, 0);
* Searches for the first occurence of the given argument, beginning
* the search at <code>index</code>, and testing for equality using
* the <code>equals</code> method.
* @param elem an object.
* @param index the non-negative index to start searching from.
* @return the index of the first occurrence of the object argument in
* this MyOwnVectorReallyItIs at position <code>index</code> or later in the
* MyOwnVectorReallyItIs, that is, the smallest value <tt>k</tt> such that
* <tt>elem.equals(elementData[k]) && (k >= index)</tt> is
* <tt>true</tt>; returns <code>-1</code> if the object is not
* found. (Returns <code>-1</code> if <tt>index</tt> >= the
* current size of this <tt>MyOwnVectorReallyItIs</tt>.)
* @exception IndexOutOfBoundsException if <tt>index</tt> is negative.
* @see Object#equals(Object)
public synchronized int indexOf(Object elem, int index) {
if (elem == null) {
for (int i = index ; i < elementCount ; i++)
if (elementData==null)
return i;
} else {
for (int i = index ; i < elementCount ; i++)
if (elem.equals(elementData[i]))
return i;
return -1;
* Returns the index of the last occurrence of the specified object in
* this MyOwnVectorReallyItIs.
* @param elem the desired component.
* @return the index of the last occurrence of the specified object in
* this MyOwnVectorReallyItIs, that is, the largest value <tt>k</tt> such that
* <tt>elem.equals(elementData[k])</tt> is <tt>true</tt>;
* returns <code>-1</code> if the object is not found.
public synchronized int lastIndexOf(Object elem) {
return lastIndexOf(elem, elementCount-1);
* Searches backwards for the specified object, starting from the
* specified index, and returns an index to it.
* @param elem the desired component.
* @param index the index to start searching from.
* @return the index of the last occurrence of the specified object in this
* MyOwnVectorReallyItIs at position less than or equal to <code>index</code> in
* the MyOwnVectorReallyItIs, that is, the largest value <tt>k</tt> such that
* <tt>elem.equals(elementData[k]) && (k <= index)</tt> is
* <tt>true</tt>; <code>-1</code> if the object is not found.
* (Returns <code>-1</code> if <tt>index</tt> is negative.)
* @exception IndexOutOfBoundsException if <tt>index</tt> is greater
* than or equal to the current size of this MyOwnVectorReallyItIs.
public synchronized int lastIndexOf(Object elem, int index) {
if (index >= elementCount)
throw new IndexOutOfBoundsException(index + " >= "+ elementCount);
if (elem == null) {
for (int i = index; i >= 0; i--)
if (elementData[i]==null)
return i;
} else {
for (int i = index; i >= 0; i--)
if (elem.equals(elementData[i]))
return i;
return -1;
* Returns the component at the specified index.<p>
* This method is identical in functionality to the get method
* (which is part of the List interface).
* @param index an index into this MyOwnVectorReallyItIs.
* @return the component at the specified index.
* @exception ArrayIndexOutOfBoundsException if the <tt>index</tt>
* is negative or not less than the current size of this
* <tt>MyOwnVectorReallyItIs</tt> object.
* given.
* @see #get(int)
* @see List
public synchronized Object elementAt(int index) {
if (index >= elementCount) {
throw new ArrayIndexOutOfBoundsException(index + " >= " + elementCount);
return elementData[index];
* Returns the first component (the item at index <tt>0</tt>) of
* this MyOwnVectorReallyItIs.
* @return the first component of this MyOwnVectorReallyItIs.
* @exception NoSuchElementException if this MyOwnVectorReallyItIs has no components.
public synchronized Object firstElement() {
if (elementCount == 0) {
throw new NoSuchElementException();
return elementData[0];
* Returns the last component of the MyOwnVectorReallyItIs.
* @return the last component of the MyOwnVectorReallyItIs, i.e., the component at index
* <code>size() - 1</code>.
* @exception NoSuchElementException if this MyOwnVectorReallyItIs is empty.
public synchronized Object lastElement() {
if (elementCount == 0) {
throw new NoSuchElementException();
return elementData[elementCount - 1];
* Sets the component at the specified <code>index</code> of this
* MyOwnVectorReallyItIs to be the specified object. The previous component at that
* position is discarded.<p>
* The index must be a value greater than or equal to <code>0</code>
* and less than the current size of the MyOwnVectorReallyItIs. <p>
* This method is identical in functionality to the set method
* (which is part of the List interface). Note that the set method reverses
* the order of the parameters, to more closely match array usage. Note
* also that the set method returns the old value that was stored at the
* specified position.
* @param obj what the component is to be set to.
* @param index the specified index.
* @exception ArrayIndexOutOfBoundsException if the index was invalid.
* @see #size()
* @see List
* @see #set(int, java.lang.Object)
public synchronized void setElementAt(Object obj, int index) {
if (index >= elementCount) {
throw new ArrayIndexOutOfBoundsException(index + " >= " +
elementCount);
elementData[index] = obj;
* Deletes the component at the specified index. Each component in
* this MyOwnVectorReallyItIs with an index greater or equal to the specified
* <code>index</code> is shifted downward to have an index one
* smaller than the value it had previously. The size of this MyOwnVectorReallyItIs
* is decreased by <tt>1</tt>.<p>
* The index must be a value greater than or equal to <code>0</code>
* and less than the current size of the MyOwnVectorReallyItIs. <p>
* This method is identical in functionality to the remove method
* (which is part of the List interface). Note that the remove method
* returns the old value that was stored at the specified position.
* @param index the index of the object to remove.
* @exception ArrayIndexOutOfBoundsException if the index was invalid.
* @see #size()
* @see #remove(int)
* @see List
public synchronized void removeElementAt(int index) {
modCount++;
if (index >= elementCount) {
throw new ArrayIndexOutOfBoundsException(index + " >= " +
elementCount);
else if (index < 0) {
throw new ArrayIndexOutOfBoundsException(index);
int j = elementCount - index - 1;
if (j > 0) {
System.arraycopy(elementData, index + 1, elementData, index, j);
elementCount--;
elementData[elementCount] = null; /* to let gc do its work */
* Inserts the specified object as a component in this MyOwnVectorReallyItIs at the
* specified <code>index</code>. Each component in this MyOwnVectorReallyItIs with
* an index greater or equal to the specified <code>index</code> is
* shifted upward to have an index one greater than the value it had
* previously. <p>
* The index must be a value greater than or equal to <code>0</code>
* and less than or equal to the current size of the MyOwnVectorReallyItIs. (If the
* index is equal to the current size of the MyOwnVectorReallyItIs, the new element
* is appended to the MyOwnVectorReallyItIs.)<p>
* This method is identical in functionality to the add(Object, int) method
* (which is part of the List interface). Note that the add method reverses
* the order of the parameters, to more closely match array usage.
* @param obj the component to insert.
* @param index where to insert the new component.
* @exception ArrayIndexOutOfBoundsException if the index was invalid.
* @see #size()
* @see #add(int, Object)
* @see List
public synchronized void insertElementAt(Object obj, int index) {
modCount++;
if (index > elementCount) {
throw new ArrayIndexOutOfBoundsException(index
+ " > " + elementCount);
ensureCapacityHelper(elementCount + 1);
System.arraycopy(elementData, index, elementData, index + 1, elementCount - index);
elementData[index] = obj;
elementCount++;
* Adds the specified component to the end of this MyOwnVectorReallyItIs,
* increasing its size by one. The capacity of this MyOwnVectorReallyItIs is
* increased if its size becomes greater than its capacity. <p>
* This method is identical in functionality to the add(Object) method
* (which is part of the List interface).
* @param obj the component to be added.
* @see #add(Object)
* @see List
public synchronized void addElement(Object obj) {
modCount++;
ensureCapacityHelper(elementCount + 1);
elementData[elementCount++] = obj;
* Removes the first (lowest-indexed) occurrence of the argument
* from this MyOwnVectorReallyItIs. If the object is found in this MyOwnVectorReallyItIs, each
* component in the MyOwnVectorReallyItIs with an index greater or equal to the
* object's index is shifted downward to have an index one smaller
* than the value it had previously.<p>
* This method is identical in functionality to the remove(Object)
* method (which is part of the List interface).
* @param obj the component to be removed.
* @return <code>true</code> if the argument was a component of this
* MyOwnVectorReallyItIs; <code>false</code> otherwise.
* @see List#remove(Object)
* @see List
public synchronized boolean removeElement(Object obj) {
modCount++;
int i = indexOf(obj);
if (i >= 0) {
removeElementAt(i);
return true;
return false;
* Removes all components from this MyOwnVectorReallyItIs and sets its size to zero.<p>
* This method is identical in functionality to the clear method
* (which is part of the List interface).
* @see #clear
* @see List
public synchronized void removeAllElements() {
modCount++;
// Let gc do its work
for (int i = 0; i < elementCount; i++)
elementData[i] = null;
elementCount = 0;
* Returns a clone of this MyOwnVectorReallyItIs. The copy will contain a
* reference to a clone of the internal data array, not a reference
* to the original internal data array of this <tt>MyOwnVectorReallyItIs</tt> object.
* @return a clone of this MyOwnVectorReallyItIs.
public synchronized Object clone() {
try {
MyOwnVectorReallyItIs v = (MyOwnVectorReallyItIs)super.clone();
v.elementData = new Object[elementCount];
System.arraycopy(elementData, 0, v.elementData, 0, elementCount);
v.modCount = 0;
return v;
} catch (CloneNotSupportedException e) {
// this shouldn't happen, since we are Cloneable
throw new InternalError();
* Returns an array containing all of the elements in this MyOwnVectorReallyItIs
* in the correct order.
* @since 1.2
public synchronized Object[] toArray() {
Object[] result = new Object[elementCount];
System.arraycopy(elementData, 0, result, 0, elementCount);
return result;
* Returns an array containing all of the elements in this MyOwnVectorReallyItIs in the
* correct order; the runtime type of the returned array is that of the
* specified array. If the MyOwnVectorReallyItIs fits in the specified array, it is
* returned therein. Otherwise, a new array is allocated with the runtime
* type of the specified array and the size of this MyOwnVectorReallyItIs.<p>
* If the MyOwnVectorReallyItIs fits in the specified array with room to spare
* (i.e., the array has more elements than the MyOwnVectorReallyItIs),
* the element in the array immediately following the end of the
* MyOwnVectorReallyItIs is set to null. This is useful in determining the length
* of the MyOwnVectorReallyItIs <em>only</em> if the caller knows that the MyOwnVectorReallyItIs
* does not contain any null elements.
* @param a the array into which the elements of the MyOwnVectorReallyItIs are to
* be stored, if it is big enough; otherwise, a new array of the
* same runtime type is allocated for this purpose.
* @return an array containing the elements of the MyOwnVectorReallyItIs.
* @exception ArrayStoreException the runtime type of a is not a supertype
* of the runtime type of every element in this MyOwnVectorReallyItIs.
* @throws NullPointerException if the given array is null.
* @since 1.2
public synchronized Object[] toArray(Object a[]) {
if (a.length < elementCount)
a = (Object[])java.lang.reflect.Array.newInstance(
a.getClass().getComponentType(), elementCount);
System.arraycopy(elementData, 0, a, 0, elementCount);
if (a.length > elementCount)
a[elementCount] = null;
return a;
// Positional Access Operations
* Returns the element at the specified position in this MyOwnVectorReallyItIs.
* @param index index of element to return.
* @return object at the specified index
* @exception ArrayIndexOutOfBoundsException index is out of range (index
* < 0 || index >= size()).
* @since 1.2
public synchronized Object get(int index) {
if (index >= elementCount)
throw new ArrayIndexOutOfBoundsException(index);
return elementData[index];
* Replaces the element at the specified position in this MyOwnVectorReallyItIs with the
* specified element.
* @param index index of element to replace.
* @param element element to be stored at the specified position.
* @return the element previously at the specified position.
* @exception ArrayIndexOutOfBoundsException index out of range
* (index < 0 || index >= size()).
* @since 1.2
public synchronized Object set(int index, Object element) {
if (index >= elementCount)
throw new ArrayIndexOutOfBoundsException(index);
Object oldValue = elementData[index];
elementData[index] = element;
return oldValue;
* Appends the specified element to the end of this MyOwnVectorReallyItIs.
* @param o element to be appended to this MyOwnVectorReallyItIs.
* @return true (as per the general contract of Collection.add).
* @since 1.2
public synchronized boolean add(Object o) {
modCount++;
ensureCapacityHelper(elementCount + 1);
elementData[elementCount++] = o;
return true;
* Removes the first occurrence of the specified element in this MyOwnVectorReallyItIs
* If the MyOwnVectorReallyItIs does not contain the element, it is unchanged. More
* formally, removes the element with the lowest index i such that
* <code>(o==null ? get(i)==null : o.equals(get(i)))</code> (if such
* an element exists).
* @param o element to be removed from this MyOwnVectorReallyItIs, if present.
* @return true if the MyOwnVectorReallyItIs contained the specified element.
* @since 1.2
public boolean remove(Object o) {
return removeElement(o);
* Inserts the specified element at the specified position in this MyOwnVectorReallyItIs.
* Shifts the element currently at that position (if any) and any
* subsequent elements to the right (adds one to their indices).
* @param index index at which the specified element is to be inserted.
* @param -
Position for Programmer experience with DAQ and C++/Labview
We are company located in the Bay Area of California and looking for
a programmer experienced with programming (from scratch) DAQ boards for
signal generation (sine/triangle/sawtooth) waveforms as well as DAQ
digitizers, FFT, and data displaying.
You should be
able to program these cards using C++, but should have strong knowledge
of labview as well. You may be asked to translate and migrate labview
VI's to the C++ enviroment.
Job applicants from
the Bay Area, as well as abroad are welcome to apply.Those outside of
the Bay Area can develop code at your own home office and must have
C++/labview on a suitable computer for programming.
Applicants should apply by sending an email to: jobs at intereasemedical dot com and indicate IE002 as the job position code.
Do not post your resume as a reply to this forum post.
Do include your resume in PDF or DOC format
Do
include your billing rate and if you are authorized to work in the U.S
if located in the Bay Area. We do not provide H1B sponsorship.
Responses without the above information will not be considered.
Thank you!Hello, I have much experience with DAQ, C++ and Labview. How to apply for this position?
-
One position on multiple organization unit
I see ,one postion belongs to only one org unit (A 003). But Let's assume we have production engineer position(code: 5000100). I want to use this position in Bus production org unit and in Car production org unit. Sap doesn't allow to do this. I don't mean percentage working also i don't mean same employee on different org units. I mean same position-different person-different org units. I don't understand why do we have to re-create same named ,same qualified position again for another org units? So we see a lot of same position in our list. Is there any way to use an already created position with different org units?
I belive U must have two positon. Afterall those two different Org. Units.
For Example:-
We got org units like this
HR , Finance
HR Executive is a positon
Fin Executive is postion
Both are executives but still there is a differene in the similar way you have the differeces
Experts please correct me if i am wrong
Regards -
ESS and MSS role assigned to position
Hi,
I have to find out that wheter the ESS Role is assigned to a position .I have to display (Y/N) (Details 'Y' if ESS Role Assigned, 'N' if no ESS role is assigned) To have a 'Y' it must be an active role
Is MSS Role assigned to a position .I have to display (Y/N) (Details 'Y' if MSS Role Assigned, 'N' if no MSS role is assigned) To have a 'Y' it must be an active role.
Kindly let me know how to do it.I am a abap developer and new to HR module.
Thanks !
Sachin Sharmahi
you can check the user id assigned to the position ,
the correct procedure would be to use Logical database and HR function modules to retrive the poistion code and user id
position code can be taken from infotype 1 and user id can be taken from infotype 105 , once u get the user id , then you can check the roles that are there , in your case it might be custom roles , you can hard code the role name for that matter to query the same.
Hope this gives you a clear idea.
Regards
sameer -
Trouble positioning html objects
I'm having a lot of trouble positioning html elements such as paypal buttons and video players (jwplayer). They look fine in design mode but the exported html is completely unpredictable. Is anybody else experiencing this problem?
I haven't seen this problem personally. there may be some unnecessary positioning code in the HTML/CSS/PHP that is involved with the code that you are trying to paste into Muse.
What would be needed to resolve your issue is the following:
1) a screenshot of your positioning in Muse' Design Mode.
2) a screen shot of the resulting position in Prieview or Publish.
3) the actual HTML code that you are pasting in. -
How do I run multiple java apps in one JVM to reduce memory use?
Hi all,
I saw an article either on the web or in a magazine not too long ago about how to "detect" if the app is already running, and if so, it hands off the new instance to the already running JVM, which then creates a thread to run the Java app in. As it turns out, my app will be used in an ASP environment, through Citrix. We may have as many as 50 to 100 users running the same app, each with their own unique user ID, but all using the same one server to run it on. Each instance eats up 25MB of memory right now. So the question is if anybody knows of a URL or an app like this that can handle the process of running the same (or even different Java) apps in one JVM as separate threads, instead of requring several instances of the JVM to run? I know this article presented a fully working example, and I believe I know enough to do it but I wanted ot use the article as a reference to make sure it is done right. I know that each app basically would use the same one "launcher" program that would on first launch "listen" to a port, as well as send a message through the port to see if an existing launcher was running. If it does, it hands off the Java app to be run to the existing luancher application and shuts down the 2nd launching app. By using this method, the JVM eats up its normal memory, but each Java app only consumes its necessary memory as well and doesn't use up more JVM instance memory.
Thanks.<pre>
import java.util.Properties;
import java.io.FileInputStream;
import java.io.IOException;
import java.lang.reflect.Method;
import java.lang.reflect.InvocationTargetException;
import java.util.Enumeration;
import java.util.NoSuchElementException;
public class RunProg implements Runnable, Cloneable
private String iProg;
private String iArgs[];
public static void main(String args[])
new RunProg().main();
// first step is to start main program itself
private void main()
Properties properties = System.getProperties();
try
properties.load(new FileInputStream("RunProg.properties"));
catch(IOException e)
System.setProperties(properties);
int i = 0;
System.out.println("enter main, activeCount=" + Thread.activeCount());
while(true)
String program = properties.getProperty("Prog" + i);
if(program == null)
break;
StringTokenizer st = new StringTokenizer(program);
String[] args = new String[st.countTokens() - 1];
try
RunProg rp = (RunProg)this.clone();
rp.iProg = st.nextToken();
for(int j = 0; st.hasMoreTokens(); j++)
args[j] = st.nextToken();
rp.iArgs = args;
Thread th = new Thread(rp);
th.setName("prog" + i + "=" + program);
th.start();
System.out.println("prog" + i + "=" + program + ", started");
catch(CloneNotSupportedException e)
System.out.println("prog" + i + "=" + program + ", can't start");
i++;
System.out.println("end of main, activeCount=" + Thread.activeCount());
// next step is to start all others one by one
public void run()
try
Class c = Class.forName(iProg);
Class p[] = new Class[1];
p[0] = String[].class;
Method m = c.getMethod("main", p);
Object o[] = new Object[1];
o[0] = iArgs;
m.invoke(null, o);
catch(ClassNotFoundException e)
System.out.println(iProg + "ClassNotFoundException");
catch(NoSuchMethodException e)
System.out.println(iProg + "NoSuchMethodException");
catch(InvocationTargetException e)
System.out.println(iProg + "NoSuchMethodException");
catch(IllegalAccessException e)
System.out.println(iProg + "NoSuchMethodException");
System.out.println(Thread.currentThread().getName() + ", ended");
System.out.println("exit run, activeCount=" + Thread.activeCount());
// setup SecurityManager to disable method System.exit()
public RunProg()
SecurityManager sm = new mySecurityManager();
System.setSecurityManager(sm);
// inner-class to disable method System.exit()
protected class mySecurityManager extends SecurityManager
public void checkExit(int status)
super.checkExit(status);
Thread.currentThread().stop();
throw new SecurityException();
* inner-class to analyze StringTokenizer. This class is enhanced to check double Quotation marks
protected class StringTokenizer implements Enumeration
private int currentPosition;
private int maxPosition;
private String str;
private String delimiters;
private boolean retTokens;
* Constructs a string tokenizer for the specified string. All
* characters in the <code>delim</code> argument are the delimiters
* for separating tokens.
* <p>
* If the <code>returnTokens</code> flag is <code>true</code>, then
* the delimiter characters are also returned as tokens. Each
* delimiter is returned as a string of length one. If the flag is
* <code>false</code>, the delimiter characters are skipped and only
* serve as separators between tokens.
* @param str a string to be parsed.
* @param delim the delimiters.
* @param returnTokens flag indicating whether to return the delimiters
* as tokens.
public StringTokenizer(String str, String delim, boolean returnTokens)
currentPosition = 0;
this.str = str;
maxPosition = str.length();
delimiters = delim;
retTokens = returnTokens;
* Constructs a string tokenizer for the specified string. The
* characters in the <code>delim</code> argument are the delimiters
* for separating tokens. Delimiter characters themselves will not
* be treated as tokens.
* @param str a string to be parsed.
* @param delim the delimiters.
public StringTokenizer(String str, String delim)
this(str, delim, false);
* Constructs a string tokenizer for the specified string. The
* tokenizer uses the default delimiter set, which is
* <code>"\t\n\r\f"</code>: the space character, the tab
* character, the newline character, the carriage-return character,
* and the form-feed character. Delimiter characters themselves will
* not be treated as tokens.
* @param str a string to be parsed.
public StringTokenizer(String str)
this(str, " \t\n\r\f", false);
* Skips delimiters.
protected void skipDelimiters()
while(!retTokens &&
(currentPosition < maxPosition) &&
(delimiters.indexOf(str.charAt(currentPosition)) >= 0))
currentPosition++;
* Tests if there are more tokens available from this tokenizer's string.
* If this method returns <tt>true</tt>, then a subsequent call to
* <tt>nextToken</tt> with no argument will successfully return a token.
* @return <code>true</code> if and only if there is at least one token
* in the string after the current position; <code>false</code>
* otherwise.
public boolean hasMoreTokens()
skipDelimiters();
return(currentPosition < maxPosition);
* Returns the next token from this string tokenizer.
* @return the next token from this string tokenizer.
* @exception NoSuchElementException if there are no more tokens in this
* tokenizer's string.
public String nextToken()
skipDelimiters();
if(currentPosition >= maxPosition)
throw new NoSuchElementException();
int start = currentPosition;
boolean inQuotation = false;
while((currentPosition < maxPosition) &&
(delimiters.indexOf(str.charAt(currentPosition)) < 0 || inQuotation))
if(str.charAt(currentPosition) == '"')
inQuotation = !inQuotation;
currentPosition++;
if(retTokens && (start == currentPosition) &&
(delimiters.indexOf(str.charAt(currentPosition)) >= 0))
currentPosition++;
String s = str.substring(start, currentPosition);
if(s.charAt(0) == '"')
s = s.substring(1);
if(s.charAt(s.length() - 1) == '"')
s = s.substring(0, s.length() - 1);
return s;
* Returns the next token in this string tokenizer's string. First,
* the set of characters considered to be delimiters by this
* <tt>StringTokenizer</tt> object is changed to be the characters in
* the string <tt>delim</tt>. Then the next token in the string
* after the current position is returned. The current position is
* advanced beyond the recognized token. The new delimiter set
* remains the default after this call.
* @param delim the new delimiters.
* @return the next token, after switching to the new delimiter set.
* @exception NoSuchElementException if there are no more tokens in this
* tokenizer's string.
public String nextToken(String delim)
delimiters = delim;
return nextToken();
* Returns the same value as the <code>hasMoreTokens</code>
* method. It exists so that this class can implement the
* <code>Enumeration</code> interface.
* @return <code>true</code> if there are more tokens;
* <code>false</code> otherwise.
* @see java.util.Enumeration
* @see java.util.StringTokenizer#hasMoreTokens()
public boolean hasMoreElements()
return hasMoreTokens();
* Returns the same value as the <code>nextToken</code> method,
* except that its declared return value is <code>Object</code> rather than
* <code>String</code>. It exists so that this class can implement the
* <code>Enumeration</code> interface.
* @return the next token in the string.
* @exception NoSuchElementException if there are no more tokens in this
* tokenizer's string.
* @see java.util.Enumeration
* @see java.util.StringTokenizer#nextToken()
public Object nextElement()
return nextToken();
* Calculates the number of times that this tokenizer's
* <code>nextToken</code> method can be called before it generates an
* exception. The current position is not advanced.
* @return the number of tokens remaining in the string using the current
* delimiter set.
* @see java.util.StringTokenizer#nextToken()
public int countTokens()
int count = 0;
int currpos = currentPosition;
while(currpos < maxPosition)
* This is just skipDelimiters(); but it does not affect
* currentPosition.
while(!retTokens &&
(currpos < maxPosition) &&
(delimiters.indexOf(str.charAt(currpos)) >= 0))
currpos++;
if(currpos >= maxPosition)
break;
int start = currpos;
boolean inQuotation = false;
while((currpos < maxPosition) &&
(delimiters.indexOf(str.charAt(currpos)) < 0 || inQuotation))
if(str.charAt(currpos) == '"')
inQuotation = !inQuotation;
currpos++;
if(retTokens && (start == currpos) &&
(delimiters.indexOf(str.charAt(currpos)) >= 0))
currpos++;
count++;
return count;
</pre>
RunProg.properties like this:
Prog1=GetEnv 47838 837489 892374 839274
Prog0=GetEnv "djkfds dfkljsd" dsklfj -
Here is the Build:
1. MSI Z77A-GD65 Gaming LGA 1155 Intel Z77 HDMI SATA 6Gb/s USB 3.0 ATX Intel Motherboard
2. ASUS GTX650TI-O-1GD5 GeForce GTX 650 Ti 1GB 128-bit GDDR5 PCI Express 3.0 x16 HDCP Ready Video Card
3. COOLER MASTER GX 450W RS450-ACAAD3-US 450W ATX12V v2.31 80 PLUS BRONZE Certified Active PFC Power Supply
4. Intel Core i5-3570K Ivy Bridge 3.4GHz (3.8GHz Turbo) LGA 1155 77W Quad-Core Desktop Processor Intel HD Graphics 4000 BX80637I53570K
5. Western Digital WD AV-GP WD20EURS 2TB 64MB Cache SATA 3.0Gb/s 3.5" Internal Hard Drive Bare Drive
6. SAMSUNG DVD Burner SATA Model SH-224DB/BEBE
7. ARCTIC Alpine 11 Rev. 2 CPU Cooler - Intel, Supports Multiple Sockets, 92mm PWM Fan at 23dBA
8. G.SKILL Ripjaws X Series 16GB (2 x 8GB) 240-Pin DDR3 SDRAM DDR3 2400 (PC3 19200) Desktop Memory Model F3-2400C11D-16GXM (2 Sticks)
I assembled the entire system and then put the Windows 8 disk in the optical drive. Powered up the system and windows started to load. Got a blue screen showing the Error 0xc00000e9 with a possible I/O for the hard drive. checked all connections and tried again with the same result. Powered down the system and tried a different SATA port. Got the same result. Tried all of the SATA ports and still the same thing. Tried a Windows 7 Pro disk and got the same result. Suspected a bad cable, swapped it and same result. Suspected a DOA HDD, put in a new HDD, this time a Seagate 1TB SATA drive and got the same result.
I did some research to see if anyone else was having the same problems as me. Followed a thread on another site that mentioned re-flashing the BIOS and the step they received from Tech Support. I downloaded the latest BIOS from the MSI website, installed in on a FAT32 USB stick and flashed the BIOS with the M-Flash utility. During the flashing, the system rebooted and gave me a black screen. Here are the steps that the site listed:
1. Tech Support originally had me attempt to clear the CMOS. When this failed to work, he had me attempt to flash the bios.
2. Downloaded latest version of BIOS to usb flash drive (The drive was FAT32). Comes in a zip file. Unzip, and only needed the E7751IMS.A50 in the root directory of the flash drive.
3. Plug in flash drive to back panel connector while computer was OFF.
4. Flip the multi-bios switch to the second functioning bios.
5. Once into the bios, flip the switch to the primary bios.
6. Run the m-flash.
7. Once completed flashing, it rebooted twice before powering on.
8. Computer now runs fine.
Now when the system starts up, I get a black screen. There are different codes that post on the MB during to boot process with the BIOS switch in the A position Code 62, Code CA, Code A2. After A2 post on the MB, It detected a change in the system and asked me to hit F1 to enter setup. I hit F1 and then in went to another screen, where I hit F1 again to enter Setup again, but it wouldn't let me select F1. Then the system rebooted, gave the same codes but stopped at A2. I also have a an A2 on a black screen in the lower right hand corner, and no options listed. It sat there for approximately 2 minutes then shutdown. I Restarted and got Code 9d but the screen showed CA in the lower right. Then system shutdown again after about 1 minute.
Moved the switch to Position B and powered up got Code 62 and a black screen with a cursor in the top left. No other info displayed. System shutdown after about 1 minute. I restarted the system again and got this: Code 72, rebooted on its own after 10 Seconds. Code 55, rebooted on its own after 10 Seconds. Code 49, rebooted on its own after 20 Seconds. Code b6, system shut down.
Moved the switch back to Position A and restarted got these codes: Code 72, rebooted on its own after 10 Seconds. Code 56, rebooted on its own after 10 Seconds. Code 4F, then system shutdown.
I have tried clearing the CMOS many times and get the same results.
Any thoughts?Just to be clear, you are unable to boot from either bios now?
Have you tried this with only a single stick of ram installed into DIMM 2, onboard vga, psu, cpu and cooler? -
Hey guys, I have a question about Web Design
I have been trying to learn webdesign for a few months now, and so far, I am still learning HTML and some CSS. At the moment, my experience is still very thin, I am struggling with things, and I only know how to create simple, static pages. For example I still don't know how to produce "clean code". Or how one determines just how "clean" the code he has produced really is.
I was wondering if someone could answer a few questions I have:
I am still not sure how I will know when I am competent enough to work in Web Design... What are the best signs that an individual is good enough?
I was also wondering what programming language I need to know to do the following:
Create a WORKING Site Search. One like the search bar in the top corner of this page that will return search results from your website... Do I need to know how to program PHP? I've heard that you do need PHP to do this? The same goes for creating e-mail forms, and other forms like this. Do I need PHP for this?
Another thing is CMS systems like Wordpress and Joomla. What is the reason for using these as opposed to just designing a website's pages in Dreamweaver, and then uploading them via FTP to your web server?
And finally, can someone explain to me why CSS is groped like this when it is coded? Why has the Div ID "OuterWrapper" been styled multiple times?
For example: #outerWrapper #feature {
#outerWrapper #subcontentWrapper {
#outerWrapper #subcontentWrapper #rightColumn {
^ Couldnt the designer simply have styled "~OuterWrapper" once and left it at that?
Please see below:
#outerWrapper #feature {
height: 225px;
width: 880px;
margin-left: 0px;
margin-bottom: 5px;
background-image: url(images/feature.jpg);
background-repeat: no-repeat;
background-position: center top;
#outerWrapper #subcontentWrapper {
padding-right: 15px;
padding-left: 15px;
clear: both;
padding-top: 20px;
background-color: #FFF;
padding-bottom: 40px;
border-top-width: 4px;
border-right-width: 4px;
border-left-width: 4px;
border-top-style: solid;
border-right-style: solid;
border-left-style: solid;
border-top-color: #F90;
border-right-color: #F90;
border-left-color: #F90;
background-image: url(images/footer-fade.jpg);
background-repeat: repeat-x;
background-position: bottom;
height: 100%;
#outerWrapper #subcontentWrapper #rightColumn {
float: right;
width: 220px;
background-color: #DBE7FB;
border: 1px solid #DCDFE4;
margin-bottom: 15px;
Also, regarding Javascript: How exactly does one become proficient enough to learn scripting for the thousands of little widgets, and navigation bars, and other functions that Javascript can do out there?
I know a lot of these questions are strange and may be hard to answer, but I am really hoping some of you guys can provide some helpful advice/direction for me to improve with code. I studied as a Print Graphic Designer, and now it's really hurting me in this economy trying to find a job due to the fact that I lack full competency in Web Design... and the longer it takes me to get better at this, the slimmer my chances become at finding work!
I really need help on this, so I would be extremely grateful for detailed and informative answers. Perhaps some links to very good video tutorials on learning how to effectively design webpages - Common things like Javascripted navigation bars, image slideshows, how to design working site search forms and contact forms, and how to use Wordpress. I ask this because there are so many terrbile tutorial videos out there (I know from experience) and it is next to impossible for myself, a beginner, to tell the good ones from the bad.
Thankyou guys.CMS's like WordPress, Joomla! & Drupal are popular open source (PHP & MySql) frameworks. They contain all the backend PHP code needed to create a dynamic web site that contains capability for advanced functions: site search, on-line editing, shopping carts, member log-in sites, blogs with comments, scripted contact forms, and so much more...
The allure of Open Source frameworks is that they save developers time and money. Instead of building everything from scratch (which can take months), an experienced developer can usually install WordPress on the client's server and be up & running in a few hours without customizations, or in a couple of weeks with customizations. A firm understanding of PHP, how to set up a server-side database, backing up MySql, CSS theming, and HTML code are required skills to work with these frameworks. WordPress is probably the easiest to set-up; Drupal is for more experienced coders.
I am still not sure how I will know when I am competent enough to work in Web Design... What are the best signs that an individual is good enough?
You're ready when you can look at code and understand what it means/does. Being able to problem solve, identify mistakes and fix them on your own is a must have skill.
Code Tutorials - http://w3schools.com/
How to Develop with CSS?
http://phrogz.net/css/HowToDevelopWithCSS.html
CSS positioning in 10 Steps
http://www.barelyfitz.com/screencast/html-training/css/positioning/
Code Validation Tools
CSS - http://jigsaw.w3.org/css-validator/
HTML - http://validator.w3.org/
Nancy O.
Alt-Web Design & Publishing
Web | Graphics | Print | Media Specialists
http://alt-web.com/
http://twitter.com/altweb -
NW04 + MAXdb testdrive on SLES10, startsap nw4host failed
Hi all,
i am trying this SAP's product, i have experienced some problems,
the first
the installation failed because the install.sh script set the wrong path to .cshrc of nw4adm
solution:
copy the dvd on the hard disk then modify the install scirpt
[code]
update_cshrc () {
do_redhat_specific
vv=`find ${installed_jdk_home} -name 'libjvm.so'`
if [ -n "$" ]; then
vv1=`echo -e "$" | grep 'server/libjvm.so$'`
if [ -z "$" ]; then
vv1=`echo -e $ | head -n 1`
fi
vv2=`echo -e $ | sed -e 's@/server/libjvm.so$@@g'`
vv3=`echo -e $ | sed -e 's@/libjvm.so$@@g'`
add_to_file "setenv LD_LIBRARY_PATH \$:$:$:/usr/lib:/lib" ~nw4adm/.cshrc
else
echo ""
to-do error no libjvm.so found / inconsistent JVM installation
fi
add_to_file "# setenv LD_ASSUME_KERNEL 2.4.1" ~nw4adm/.cshrc
[/code]
without this fix the nw4adm havent the library path in its environment and the install.sh was unable to create xuser.
but now i'm experiencing another problem, i cant start my testdrive
[code]
nw4host:nw4adm 7> startsap nw4host
Checking ADA db Database
ABAP Database is not available via R3trans
Checking ADA db Database
Error: java.io.FileNotFoundException: JdbcCon.log (Permission denied)
J2EE Database is not available via test
See logfile JdbcCon.log
Starting SAP-Collector Daemon
This is Saposcol Version COLL 20.85 04/03/01 640 - V1.12 for Linux
Usage: saposcol -l: Start OS Collector
saposcol -k: Stop OS Collector
saposcol -d: OS Collector Dialog Mode
saposcol -s: OS Collector Status
Starting collector (create new process)
could not move /usr/sap/tmp/dev_coll to /usr/sap/tmp/dev_coll.old
saposcol on host tron started
Running /usr/sap/NW4/SYS/exe/run/startdb
Trying to start database ...
Log file: /sapmnt/home/nw4adm/startdb.log
Database start failed
DB startup failed
[/code]
this is the startdb.log
[code]nw4host:nw4adm 8> cat /sapmnt/home/nw4adm/startdb.log
Fri Jun 29 13:23:09 CEST 2007
LOGFILE FOR STARTING DATABASE
Trying to start database ...
Fri Jun 29 13:23:09 CEST 2007
Checking required environment variables
SAPSYSTEMNAME is >NW4<
Start database with xuserkey >c<
Fri Jun 29 13:23:09 CEST 2007
Connect to the database to check the database state
dbmcli: connect check finished with return code: 0
Database not available
Fri Jun 29 13:23:09 CEST 2007
Starting XServer
12798 NISERVER server started.
12902 XSERVER started, 'X32/LINUX 7.5.0 Build 010-121-066-665'
Fri Jun 29 13:23:09 CEST 2007
Starting database
Starting Database Instance...
ERR
-24994,ERR_RTE: runtime environment error
1,Check knldiag! Kernel died before reaching ADMIN state
Opening Database...
ERR
-24994,ERR_RTE: runtime environment error
1,Check knldiag! Kernel died before reaching ADMIN state
Fri Jun 29 13:23:18 CEST 2007
Connect to the database to verify the database is now open
dbmcli check finished with return code: 0
Database start failed
nw4host:nw4adm 9>
[/code]
this is the JdbcCon.log
[code]nw4host:nw4adm 12> cat JdbcCon.log
Start: Thu Jun 28 23:55:30 CEST 2007
Error: Couldn't connect to DB
com.sap.dbtech.jdbc.exceptions.JDBCDriverException: SAP DBTech JDBC: Cannot connect to jdbc:sapdb://nw4host/NW4 [Reply is garbled.].
nw4host:nw4adm 13> [/code]
here some files, the owner is root
[code]nw4host:nw4adm 13> ls -altr | grep root
-rwxrwxr-x 1 root root 757520 2004-04-07 22:35 dsrlib.so
-rwxrwxr-x 1 root root 7875161 2004-04-07 23:22 sapccmsr
-rwxr-xr-x 1 root sapsys 528204 2004-05-02 20:12 saposcol
-rwxr-x--- 1 root sapsys 107 2004-06-01 11:44 license_F1457087767
-rwxrr 1 root root 4730 2004-08-19 06:37 jdbcconnect.jar
nw4host:nw4adm 14> pwd
/sapmnt/NW4/exe
[/code]
the knldia
[code]----
Date Time TID Typ MsgID Label Message-Text
2007-06-29 13:23:14 12059 WNG 11489 PARAM Open system console '/dev/console' reports (13) Permission denied
2007-06-29 13:23:14 12059 WNG 11489 PARAM Modify parameter OPMSG1 or enable write access to prevent this message
2007-06-29 13:23:14 12059 12841 DIAGHIST Backup of diagnostic files is in progress
2007-06-29 13:23:14 12059 12842 DIAGHIST Backup of diagnostic files has finished
2007-06-29 13:23:14 12059 12769 INFO Starting SERVERDB: 'NW4'
2007-06-29 13:23:14 12059 12770 INFO SERVERNODE: 'tron'
2007-06-29 13:23:14 12059 12773 INFO Date: 2007-06-29
2007-06-29 13:23:14 12059 12771 INFO Process ID: 12059
2007-06-29 13:23:14 12059 12772 INFO Owner: 'sdb'
2007-06-29 13:23:14 12059 12772 INFO Group: 'sdba'
2007-06-29 13:23:14 12059 12781 INFO Version: '32BIT Kernel'
2007-06-29 13:23:14 12059 12781 INFO Version: 'X32/LINUX 7.5.0 Build 010-121-066-665'
2007-06-29 13:23:14 12059 12780 INFO DBROOT: '/sapdb/data/wrk/NW4'
2007-06-29 13:23:14 12059 12780 INFO LD_LIBRARY_PATH: '/sapdb/NW4/db/lib:/sapdb/NW4/db/sap'
2007-06-29 13:23:14 12059 12932 INFO maximum cpu time: unlimited
2007-06-29 13:23:14 12059 12933 INFO maximum number of processes: 0 MB
2007-06-29 13:23:14 12059 12891 INFO maximum core size: 0 MB
2007-06-29 13:23:14 12059 12892 INFO maximum number of open files: 1024
2007-06-29 13:23:14 12059 12934 INFO maximum file size: unlimited
2007-06-29 13:23:14 12059 12895 INFO maximum number of threads: unlimited
2007-06-29 13:23:14 12059 12935 INFO maximum stack size: 8 MB
2007-06-29 13:23:14 12059 12936 INFO lockable memory size: 0 MB
2007-06-29 13:23:14 12059 12893 INFO maximum virtual memory size: unlimited
2007-06-29 13:23:14 12059 12937 INFO resident set size size: unlimited
2007-06-29 13:23:14 12059 12894 INFO maximum heap size: unlimited
2007-06-29 13:23:14 12059 12898 ENVIRON Environment dump start
2007-06-29 13:23:14 12059 12898 ENVIRON LESSKEY=/etc/lesskey.bin
2007-06-29 13:23:14 12059 12898 ENVIRON NNTPSERVER=news
2007-06-29 13:23:14 12059 12898 ENVIRON INFODIR=/usr/local/info:/usr/share/info:
2007-06-29 13:23:14 12059 12898 ENVIRON /usr/info
2007-06-29 13:23:14 12059 12898 ENVIRON MANPATH=/usr/local/man:/usr/share/man:/u
2007-06-29 13:23:14 12059 12898 ENVIRON sr/X11R6/man:/opt/gnome/share/man
2007-06-29 13:23:14 12059 12898 ENVIRON DIR_LIBRARY=/usr/sap/NW4/SYS/exe/run
2007-06-29 13:23:14 12059 12898 ENVIRON KDE_MULTIHEAD=false
2007-06-29 13:23:14 12059 12898 ENVIRON HOSTNAME=nw4host
2007-06-29 13:23:14 12059 12898 ENVIRON DM_CONTROL=/var/run/xdmctl
2007-06-29 13:23:14 12059 12898 ENVIRON GNOME2_PATH=/usr/local:/opt/gnome:/usr
2007-06-29 13:23:14 12059 12898 ENVIRON XKEYSYMDB=/usr/X11R6/lib/X11/XKeysymDB
2007-06-29 13:23:14 12059 12898 ENVIRON SAPDBHOST=nw4host
2007-06-29 13:23:14 12059 12898 ENVIRON dbms_type=ADA
2007-06-29 13:23:14 12059 12898 ENVIRON HOST=tron
2007-06-29 13:23:14 12059 12898 ENVIRON SHELL=/bin/csh
2007-06-29 13:23:14 12059 12898 ENVIRON TERM=xterm
2007-06-29 13:23:14 12059 12898 ENVIRON PROFILEREAD=true
2007-06-29 13:23:14 12059 12898 ENVIRON HISTSIZE=1000
2007-06-29 13:23:14 12059 12898 ENVIRON XDM_MANAGED=/var/run/xdmctl/xdmctl-:0,rs
2007-06-29 13:23:14 12059 12898 ENVIRON vd,method=classic
2007-06-29 13:23:14 12059 12898 ENVIRON GTK2_RC_FILES=/etc/opt/gnome/gtk-2.0/gtk
2007-06-29 13:23:14 12059 12898 ENVIRON rc:/home/utente/.gtkrc-2.0-qtengine:/hom
2007-06-29 13:23:14 12059 12898 ENVIRON e/utente/.gtkrc-2.0:/home/utente/.kde/sh
2007-06-29 13:23:14 12059 12898 ENVIRON are/config/gtkrc-2.0
2007-06-29 13:23:14 12059 12898 ENVIRON GTK_RC_FILES=/etc/opt/gnome/gtk/gtkrc:/h
2007-06-29 13:23:14 12059 12898 ENVIRON ome/utente/.gtkrc:/home/utente/.kde/shar
2007-06-29 13:23:14 12059 12898 ENVIRON e/config/gtkrc
2007-06-29 13:23:14 12059 12898 ENVIRON GS_LIB=/home/utente/.fonts
2007-06-29 13:23:14 12059 12898 ENVIRON WINDOWID=27262983
2007-06-29 13:23:14 12059 12898 ENVIRON MORE=-sl
2007-06-29 13:23:14 12059 12898 ENVIRON DBNAME=nw4host:ADA db
2007-06-29 13:23:14 12059 12898 ENVIRON XSESSION_IS_UP=yes
2007-06-29 13:23:14 12059 12898 ENVIRON KDE_FULL_SESSION=true
2007-06-29 13:23:14 12059 12898 ENVIRON GROFF_NO_SGR=yes
2007-06-29 13:23:14 12059 12898 ENVIRON USER=nw4adm
2007-06-29 13:23:14 12059 12898 ENVIRON GROUP=sapsys
2007-06-29 13:23:14 12059 12898 ENVIRON LS_COLORS=no=00:fi=00:di=01;34:ln=00;36:
2007-06-29 13:23:14 12059 12898 ENVIRON pi=40;33:so=01;35:do=01;35:bd=40;33;01:c
2007-06-29 13:23:14 12059 12898 ENVIRON d=40;33;01:or=41;33;01:ex=00;32:*.cmd=00
2007-06-29 13:23:14 12059 12898 ENVIRON ;32:.exe=01;32:.com=01;32:*.bat=01;32:
2007-06-29 13:23:14 12059 12898 ENVIRON .btm=01;32:.dll=01;32:.tar=00;31:.tb
2007-06-29 13:23:14 12059 12898 ENVIRON z=00;31:.tgz=00;31:.rpm=00;31:*.deb=00
2007-06-29 13:23:14 12059 12898 ENVIRON ;31:.arj=00;31:.taz=00;31:*.lzh=00;31:
2007-06-29 13:23:14 12059 12898 ENVIRON .zip=00;31:.zoo=00;31:.z=00;31:.Z=00
2007-06-29 13:23:14 12059 12898 ENVIRON ;31:.gz=00;31:.bz2=00;31:.tb2=00;31:
2007-06-29 13:23:14 12059 12898 ENVIRON .tz2=00;31:.tbz2=00;31:.avi=01;35:*.bm
2007-06-29 13:23:14 12059 12898 ENVIRON p=01;35:.fli=01;35:.gif=01;35:*.jpg=01
2007-06-29 13:23:14 12059 12898 ENVIRON ;35:.jpeg=01;35:.mng=01;35:*.mov=01;35
2007-06-29 13:23:14 12059 12898 ENVIRON :.mpg=01;35:.pcx=01;35:.pbm=01;35:.p
2007-06-29 13:23:14 12059 12898 ENVIRON gm=01;35:.png=01;35:.ppm=01;35:*.tga=0
2007-06-29 13:23:14 12059 12898 ENVIRON 1;35:.tif=01;35:.xbm=01;35:*.xpm=01;35
2007-06-29 13:23:14 12059 12898 ENVIRON :.dl=01;35:.gl=01;35:.wmv=01;35:.aif
2007-06-29 13:23:14 12059 12898 ENVIRON f=00;32:.au=00;32:.mid=00;32:*.mp3=00;
2007-06-29 13:23:14 12059 12898 ENVIRON 32:.ogg=00;32:.voc=00;32:*.wav=00;32:
2007-06-29 13:23:14 12059 12898 ENVIRON DESKTOP_LAUNCH=kde-open
2007-06-29 13:23:14 12059 12898 ENVIRON OPENWINHOME=/usr/openwin
2007-06-29 13:23:14 12059 12898 ENVIRON XNLSPATH=/usr/X11R6/lib/X11/nls
2007-06-29 13:23:14 12059 12898 ENVIRON ENV=/etc/bash.bashrc
2007-06-29 13:23:14 12059 12898 ENVIRON HOSTTYPE=i586-linux
2007-06-29 13:23:14 12059 12898 ENVIRON SESSION_MANAGER=local/tron:/tmp/.ICE-uni
2007-06-29 13:23:14 12059 12898 ENVIRON x/3917
2007-06-29 13:23:14 12059 12898 ENVIRON FROM_HEADER=
2007-06-29 13:23:14 12059 12898 ENVIRON PAGER=less
2007-06-29 13:23:14 12059 12898 ENVIRON CSHEDIT=emacs
2007-06-29 13:23:14 12059 12898 ENVIRON XDG_CONFIG_DIRS=/usr/local/etc/xdg/:/etc
2007-06-29 13:23:14 12059 12898 ENVIRON /xdg/:/etc/opt/gnome/xdg/
2007-06-29 13:23:14 12059 12898 ENVIRON KONSOLE_DCOP=DCOPRef(konsole-3950,konsol
2007-06-29 13:23:14 12059 12898 ENVIRON e)
2007-06-29 13:23:14 12059 12898 ENVIRON MINICOM=-c on
2007-06-29 13:23:14 12059 12898 ENVIRON MAIL=/var/spool/mail/utente
2007-06-29 13:23:14 12059 12898 ENVIRON PATH=/sapdb/NW4/db/bin:/sapdb/programs/b
2007-06-29 13:23:14 12059 12898 ENVIRON in:/sapdb/programs/bin:/usr/lib/java/bin
2007-06-29 13:23:14 12059 12898 ENVIRON :.:/sapmnt/home/nw4adm:/usr/sap/NW4/SYS/
2007-06-29 13:23:14 12059 12898 ENVIRON exe/runU:/usr/sap/NW4/SYS/exe/run:/home/
2007-06-29 13:23:14 12059 12898 ENVIRON utente/bin:/usr/local/bin:/usr/bin:/usr/
2007-06-29 13:23:14 12059 12898 ENVIRON X11R6/bin:/bin:/usr/games:/opt/gnome/bin
2007-06-29 13:23:14 12059 12898 ENVIRON :/opt/kde3/bin:/usr/lib/mit/bin:/usr/lib
2007-06-29 13:23:14 12059 12898 ENVIRON /mit/sbin
2007-06-29 13:23:14 12059 12898 ENVIRON DESKTOP_SESSION=default
2007-06-29 13:23:14 12059 12898 ENVIRON CPU=i686
2007-06-29 13:23:14 12059 12898 ENVIRON KONSOLE_DCOP_SESSION=DCOPRef(konsole-395
2007-06-29 13:23:14 12059 12898 ENVIRON 0,session-1)
2007-06-29 13:23:14 12059 12898 ENVIRON INPUTRC=/home/utente/.inputrc
2007-06-29 13:23:14 12059 12898 ENVIRON PWD=/home/utente
2007-06-29 13:23:14 12059 12898 ENVIRON XMODIFIERS=@im=local
2007-06-29 13:23:14 12059 12898 ENVIRON JAVA_HOME=/usr/lib/java
2007-06-29 13:23:14 12059 12898 ENVIRON LANG=en_US.UTF-8
2007-06-29 13:23:14 12059 12898 ENVIRON PYTHONSTARTUP=/etc/pythonstart
2007-06-29 13:23:14 12059 12898 ENVIRON SAPSYSTEMNAME=NW4
2007-06-29 13:23:14 12059 12898 ENVIRON TEXINPUTS=:/home/utente/.TeX:/usr/share/
2007-06-29 13:23:14 12059 12898 ENVIRON doc/.TeX:/usr/doc/.TeX
2007-06-29 13:23:14 12059 12898 ENVIRON QT_SYSTEM_DIR=/usr/share/desktop-data
2007-06-29 13:23:14 12059 12898 ENVIRON HOME=/sapmnt/home/nw4adm
2007-06-29 13:23:14 12059 12898 ENVIRON SHLVL=5
2007-06-29 13:23:14 12059 12898 ENVIRON LESS_ADVANCED_PREPROCESSOR=no
2007-06-29 13:23:14 12059 12898 ENVIRON OSTYPE=linux
2007-06-29 13:23:14 12059 12898 ENVIRON LS_OPTIONS=-N --color=tty -T 0
2007-06-29 13:23:14 12059 12898 ENVIRON XCURSOR_THEME=crystalwhite
2007-06-29 13:23:14 12059 12898 ENVIRON WINDOWMANAGER=/usr/X11R6/bin/kde
2007-06-29 13:23:14 12059 12898 ENVIRON GTK_PATH=/usr/local/lib/gtk-2.0:/opt/gno
2007-06-29 13:23:14 12059 12898 ENVIRON me/lib/gtk-2.0:/usr/lib/gtk-2.0
2007-06-29 13:23:14 12059 12898 ENVIRON VENDOR=suse
2007-06-29 13:23:14 12059 12898 ENVIRON G_FILENAME_ENCODING=@locale,UTF-8,ISO-88
2007-06-29 13:23:14 12059 12898 ENVIRON 59-15,CP1252
2007-06-29 13:23:14 12059 12898 ENVIRON LESS=-M -I
2007-06-29 13:23:14 12059 12898 ENVIRON MACHTYPE=i586
2007-06-29 13:23:14 12059 12898 ENVIRON LOGNAME=nw4adm
2007-06-29 13:23:14 12059 12898 ENVIRON CVS_RSH=ssh
2007-06-29 13:23:14 12059 12898 ENVIRON XDG_DATA_DIRS=/usr/local/share/:/usr/sha
2007-06-29 13:23:14 12059 12898 ENVIRON re/:/etc/opt/kde3/share/:/opt/kde3/share
2007-06-29 13:23:14 12059 12898 ENVIRON /:/opt/gnome/share/
2007-06-29 13:23:14 12059 12898 ENVIRON ACLOCAL_FLAGS=-I /opt/gnome/share/acloca
2007-06-29 13:23:14 12059 12898 ENVIRON l
2007-06-29 13:23:14 12059 12898 ENVIRON PKG_CONFIG_PATH=/usr/local/lib/pkgconfig
2007-06-29 13:23:14 12059 12898 ENVIRON :/usr/local/share/pkgconfig:/usr/lib/pkg
2007-06-29 13:23:14 12059 12898 ENVIRON config:/usr/share/pkgconfig:/opt/kde3/li
2007-06-29 13:23:14 12059 12898 ENVIRON b/pkgconfig:/opt/gnome/lib/pkgconfig:/op
2007-06-29 13:23:14 12059 12898 ENVIRON t/gnome/lib/pkgconfig:/opt/gnome/share/p
2007-06-29 13:23:14 12059 12898 ENVIRON kgconfig
2007-06-29 13:23:14 12059 12898 ENVIRON LESSOPEN=lessopen.sh %s
2007-06-29 13:23:14 12059 12898 ENVIRON USE_FAM=
2007-06-29 13:23:14 12059 12898 ENVIRON INFOPATH=/usr/local/info:/usr/share/info
2007-06-29 13:23:14 12059 12898 ENVIRON :/usr/info:/opt/gnome/share/info
2007-06-29 13:23:14 12059 12898 ENVIRON DISPLAY=:0
2007-06-29 13:23:14 12059 12898 ENVIRON SAPJDBHOST=nw4host
2007-06-29 13:23:14 12059 12898 ENVIRON XAUTHLOCALHOSTNAME=tron
2007-06-29 13:23:14 12059 12898 ENVIRON LESSCLOSE=lessclose.sh %s %s
2007-06-29 13:23:14 12059 12898 ENVIRON G_BROKEN_FILENAMES=1
2007-06-29 13:23:14 12059 12898 ENVIRON COLORTERM=
2007-06-29 13:23:14 12059 12898 ENVIRON XAUTHORITY=/sapmnt/home/nw4adm/.xauthNeq
2007-06-29 13:23:14 12059 12898 ENVIRON DZQ
2007-06-29 13:23:14 12059 12898 ENVIRON =/sapdb/programs/bin/xserver
2007-06-29 13:23:14 12059 12898 ENVIRON DBROOT=/sapdb/NW4/db
2007-06-29 13:23:14 12059 12898 ENVIRON LD_LIBRARY_PATH=/sapdb/NW4/db/lib:/sapdb
2007-06-29 13:23:14 12059 12898 ENVIRON /NW4/db/sap
2007-06-29 13:23:14 12059 12898 ENVIRON SERVERDB=NW4
2007-06-29 13:23:14 12059 12898 ENVIRON Environment dump completed
2007-06-29 13:23:14 12059 12883 DBSTATE Core dump suppressed
2007-06-29 13:23:14 12059 202 RTE Memory allocation not limited
2007-06-29 13:23:14 12059 203 RTE System page cache usage enabled
2007-06-29 13:23:14 12059 12928 TASKING Using threads for tasks
2007-06-29 13:23:14 12059 11532 init_shm SHMCHUNK size 0x2000000
2007-06-29 13:23:14 12059 12692 TCLUSTER tw;al;ut;2000sv,100bup;10ev,10gc;ti,100dw;30000us;compress
2007-06-29 13:23:14 12059 12693 TCLUSTER number of 'BUP': 0
2007-06-29 13:23:14 12059 12693 TCLUSTER number of ' DW': 16
2007-06-29 13:23:14 12059 12693 TCLUSTER number of ' US': 50
2007-06-29 13:23:14 12059 12693 TCLUSTER number of ' SV': 21
2007-06-29 13:23:14 12059 12693 TCLUSTER number of ' EV': 1
2007-06-29 13:23:14 12059 12693 TCLUSTER number of ' GC': 0
2007-06-29 13:23:14 12059 11533 init_shm creating shared section size 513004
2007-06-29 13:23:14 12059 12698 IPC Common RTE specific IPC key: 0x44000000
2007-06-29 13:23:14 12059 11536 init_shm attached shared section at 0x50000000
2007-06-29 13:23:14 12059 11537 init_shm shared section ends at 0x5007D3EC
2007-06-29 13:23:15 12059 11521 PIPE_IO Operating system does not support fstat for input check of pipes
2007-06-29 13:23:15 12059 11522 PIPE_IO Input check for pipe with poll supported
2007-06-29 13:23:16 12059 12811 EVENTING Suppressing output to 'knldiag.evt' 0 pages
2007-06-29 13:23:16 12059 12812 EVENTING Eventbuffer 1 events 100 tasks
2007-06-29 13:23:16 12059 12815 EVENTING No AliveEvent generation
2007-06-29 13:23:17 12061 12885 MEMORY 25805 Pages allocated for I/O cache
2007-06-29 13:23:17 12061 12886 TASKING Maximum non user task stack size 100KB
2007-06-29 13:23:17 12061 12886 TASKING Maximum task stack size 400KB
2007-06-29 13:23:17 12061 12886 TASKING Task stack at system choosen address
2007-06-29 13:23:17 12061 12886 TASKING Allocating task stack chunk for 92 tasks
2007-06-29 13:23:17 12061 12886 TASKING Maximum single aligned task stack size 400KB
2007-06-29 13:23:17 12061 12886 TASKING Size of single task guard area 4KB
2007-06-29 13:23:17 12061 12886 TASKING Task stack chunk area [ 0xa949c000 - 0xaace4fff ]
2007-06-29 13:23:17 12061 12886 TASKING Physical memory used for task stacks 24500KB
2007-06-29 13:23:17 12061 12886 TASKING Physical memory used for guard areas 372KB
2007-06-29 13:23:17 12061 12831 TRACE_IO Configured MAXMESSAGE_FILES:0
2007-06-29 13:23:17 12061 12832 TRACE_IO Disabled: No TraceMessagefiles wanted
2007-06-29 13:23:17 0 12853 DBSTATE Caught signal 11(SIGSEGV)
2007-06-29 13:23:17 0 ERR 11330 COREHAND ABORTING due to signal 11
2007-06-29 13:23:17 0 ERR 11599 BTRACE -
> Emergency Stack Back Trace <----
2007-06-29 13:23:17 0 ERR 11599 BTRACE (0):0xb7d8c049 [0xbfcc18cc](0x1,0xe,0xbfcc194c,0x865e661)
2007-06-29 13:23:17 0 ERR 11599 BTRACE (1):0xb7ecec66 [0xbfcc18cc](0x1,0xe,0xbfcc194c,0x865e661)
2007-06-29 13:23:17 0 ERR 11599 BTRACE (3):0x865e661 [0xbfcc18dc](0xbfcc1928,0xa949b000,0xbfcc194c,0x865e653)
2007-06-29 13:23:17 0 ERR 11599 BTRACE (5):0x865e840 [0xbfcc194c](0x20000,0x0,0x8655464,0x0)
2007-06-29 13:23:17 0 ERR 11599 BTRACE (7):0x869a412 [0xbfcc198c](0x20000,0x8655464,0x0,0x1)
2007-06-29 13:23:17 0 ERR 11599 BTRACE (9):0x869b24a [0xbfcc19fc](0x0,0x0,0xbfcc1a2c,0x869b204)
2007-06-29 13:23:17 0 ERR 11599 BTRACE (11):0x8148429 [0xbfcc1a2c](0xbfcc1b14,0xbfcc1a48,0xbfcc1a6c,0x814841d)
2007-06-29 13:23:17 0 ERR 11599 BTRACE (13):0x869974c [0xbfcc1a6c](0xbfcc1b14,0xbfcc1ae8,0xbfcc1a88,0xb7ed5234)
2007-06-29 13:23:17 0 ERR 11599 BTRACE (15):0x81483ee [0xbfcc1b48](0x2,0xbfcc1c04,0xbfcc1c10,0x814740a)
2007-06-29 13:23:17 0 ERR 11599 BTRACE (17):0xb7d3c87c [0xbfcc1b78](0x2,0xbfcc1c04,0xbfcc1c10,0xb7efa24d)
2007-06-29 13:23:17 0 ERR 11599 BTRACE -
> Register Dump <----
2007-06-29 13:23:17 0 ERR 11599 BTRACE -
2007-06-29 13:23:17 0 ERR 11599 BTRACE ds es 0x0000007b 0xc010007b
2007-06-29 13:23:17 0 ERR 11599 BTRACE fs gs 0x00000000 0x00000033
2007-06-29 13:23:17 0 ERR 11599 BTRACE trap err 0x0000000d 0x00000000
2007-06-29 13:23:17 0 ERR 11599 BTRACE efl ss 0x00210202 0x0000007b
2007-06-29 13:23:17 0 ERR 11599 BTRACE edi esi 0x00000001 0x00000001
2007-06-29 13:23:17 0 ERR 11599 BTRACE eax ebx 0xfffffff9
2007-06-29 13:23:17 0 ERR 11599 BTRACE ecx edx 0xa947abe0
2007-06-29 13:23:17 0 ERR 11599 BTRACE esp uesp 0xbfcc18b8 0xbfcc18b8
2007-06-29 13:23:17 0 ERR 11599 BTRACE ebp eip 0xbfcc18cc 0xb7d8c049
2007-06-29 13:23:17 0 ERR 11599 BTRACE cs cr2 0x00000073 0x00000000
2007-06-29 13:23:17 0 ERR 11599 BTRACE -
2007-06-29 13:23:17 0 ERR 11599 BTRACE Floating point register unused
2007-06-29 13:23:17 0 ERR 11599 BTRACE -
2007-06-29 13:23:17 0 ERR 11599 BTRACE -
> Module List <----
2007-06-29 13:23:17 0 ERR 11599 BTRACE |.text Start |.text End | Module File Name
2007-06-29 13:23:17 0 ERR 11599 BTRACE | 0x08048000 | 0x087f0000 | /sapdb/NW4/db/pgm/kernel
2007-06-29 13:23:17 0 ERR 11599 BTRACE | 0xa8c5e000 | 0xa8c68000 | /lib/libgcc_s.so.1
2007-06-29 13:23:17 0 ERR 11599 BTRACE | 0xb7d27000 | 0xb7e41000 | /lib/libc-2.4.so
2007-06-29 13:23:17 0 ERR 11599 BTRACE | 0xb7e41000 | 0xb7e43000 | /lib/libc-2.4.so
2007-06-29 13:23:17 0 ERR 11599 BTRACE | 0xb7e48000 | 0xb7e6b000 | /lib/libm-2.4.so
2007-06-29 13:23:17 0 ERR 11599 BTRACE | 0xb7e6e000 | 0xb7ea8000 | /usr/lib/libstdc++-3-libc6.2-2-2.10.0.so
2007-06-29 13:23:17 0 ERR 11599 BTRACE | 0xb7ebb000 | 0xb7ec2000 | /lib/librt-2.4.so
2007-06-29 13:23:17 0 ERR 11599 BTRACE | 0xb7ec4000 | 0xb7ec6000 | /lib/libdl-2.4.so
2007-06-29 13:23:17 0 ERR 11599 BTRACE | 0xb7ec8000 | 0xb7ed7000 | /lib/libpthread-2.4.so
2007-06-29 13:23:17 0 ERR 11599 BTRACE | 0xb7eed000 | 0xb7f07000 | /lib/ld-2.4.so
2007-06-29 13:23:17 0 ERR 11599 BTRACE
2007-06-29 13:23:17 0 ERR 11599 BTRACE -
> Symbolic Stack Back Trace <----
2007-06-29 13:23:17 0 ERR 11599 BTRACE 0: 0xb7d8c049 __cfree +0x0049
2007-06-29 13:23:17 0 ERR 11599 BTRACE /lib/libc-2.4.so
2007-06-29 13:23:17 0 ERR 11599 BTRACE Frameinfo [0xbfcc18cc] (0x1,0xe,0xbfcc194c,0x865e661)
2007-06-29 13:23:17 0 ERR 11599 BTRACE 1: 0xb7ecec66 __pthread_attr_destroy +0x0026
2007-06-29 13:23:17 0 ERR 11599 BTRACE /lib/libpthread-2.4.so
2007-06-29 13:23:17 0 ERR 11599 BTRACE Frameinfo [0xbfcc18cc] (0x1,0xe,0xbfcc194c,0x865e661)
2007-06-29 13:23:17 0 ERR 11599 BTRACE 2: 0x0865e661 eo07_CreateThread +0x01f9
2007-06-29 13:23:17 0 ERR 11599 BTRACE /sapdb/NW4/db/pgm/kernel
2007-06-29 13:23:17 0 ERR 11599 BTRACE Frameinfo [0xbfcc18dc] (0xbfcc1928,0xa949b000,0xbfcc194c,0x865e653)
2007-06-29 13:23:17 0 ERR 11599 BTRACE 3: 0x0865e840 sqlbeginthread +0x002c
2007-06-29 13:23:17 0 ERR 11599 BTRACE /sapdb/NW4/db/pgm/kernel
2007-06-29 13:23:17 0 ERR 11599 BTRACE Frameinfo [0xbfcc194c] (0x20000,0x0,0x8655464,0x0)
2007-06-29 13:23:17 0 ERR 11599 BTRACE 4: 0x0869a412 en81_CreateRteProcs +0x0032
2007-06-29 13:23:17 0 ERR 11599 BTRACE /sapdb/NW4/db/pgm/kernel
2007-06-29 13:23:17 0 ERR 11599 BTRACE Frameinfo [0xbfcc198c] (0x20000,0x8655464,0x0,0x1)
2007-06-29 13:23:17 0 ERR 11599 BTRACE 5: 0x0869b24a en81RunKernel +0x00d6
2007-06-29 13:23:17 0 ERR 11599 BTRACE /sapdb/NW4/db/pgm/kernel
2007-06-29 13:23:17 0 ERR 11599 BTRACE Frameinfo [0xbfcc19fc] (0x0,0x0,0xbfcc1a2c,0x869b204)
2007-06-29 13:23:17 0 ERR 11599 BTRACE 6: 0x08148429 en80RunKernel +0x002d
2007-06-29 13:23:17 0 ERR 11599 BTRACE /sapdb/NW4/db/pgm/kernel
2007-06-29 13:23:17 0 ERR 11599 BTRACE Frameinfo [0xbfcc1a2c] (0xbfcc1b14,0xbfcc1a48,0xbfcc1a6c,0x814841d)
2007-06-29 13:23:17 0 ERR 11599 BTRACE 7: 0x0869974c en81_kernel_main +0x051c
2007-06-29 13:23:17 0 ERR 11599 BTRACE /sapdb/NW4/db/pgm/kernel
2007-06-29 13:23:17 0 ERR 11599 BTRACE Frameinfo [0xbfcc1a6c] (0xbfcc1b14,0xbfcc1ae8,0xbfcc1a88,0xb7ed5234)
2007-06-29 13:23:17 0 ERR 11599 BTRACE 8: 0x081483ee main +0x004e
2007-06-29 13:23:17 0 ERR 11599 BTRACE /sapdb/NW4/db/pgm/kernel
2007-06-29 13:23:17 0 ERR 11599 BTRACE Frameinfo [0xbfcc1b48] (0x2,0xbfcc1c04,0xbfcc1c10,0x814740a)
2007-06-29 13:23:17 0 ERR 11599 BTRACE -
> End of Stack Back Trace <----
2007-06-29 13:23:17 0 ERR 11599 BTRACE analysing LVCMem_Allocator_1
2007-06-29 13:23:17 0 ERR 11599 BTRACE
2007-06-29 13:23:17 0 ERR 11599 BTRACE no problems detected in LVCMem_Allocator_1
+++++++++++++++++++++++++++++++++++++++ Kernel Exit ++++++++++++++++++++++++++++
2007-06-29 13:23:18 0 12847 DBSTATE Kernel exited without core and exit status 0x2f00
2007-06-29 13:23:18 0 12849 DBSTATE Kernel exited due to signal in signal handler
2007-06-29 13:23:18 0 12890 DIAGHIST Backup of diagnostic files will be forced at next restart
2007-06-29 13:23:18 0 12808 DBSTATE Flushing knltrace pages
sh: line 1: 12065 Segmentation fault /sapdb/NW4/db/pgm/cons NW4 sh all >rtedump
2007-06-29 13:23:18 0 11987 dump_rte 'cd /sapdb/data/wrk/NW4/rtedump_dir; /sapdb/NW4/db/pgm/cons NW4 sh all > rtedump' failed
2007-06-29 13:23:18 0 12696 DBSTATE Change DbState to 'OFFLINE '(29)
current write position -
[/code]
Thank you for the supportThank you for the support Markus,
then i have to download a newer version than mine?
sapdb - MaxDB
Version:7.5-2
Build Time:Tue 21 Sep 2004 02:53:17 PM CEST
Install Time:Fri 29 Jun 2007 01:05:46 PM CEST
Package Group:Applications/Productivity
License:(c) 2004 SAP AG, Germany
Installed Size:191.3 M
Archive Size:191.1 M
Distribution:
Vendor:SAP AG, Germany
Packager:
Architecture:i386
OS:
Build Host:nw4host.wdf.sap.corp
URL:
Media No.:0
Authors:
http://dev.mysql.com/downloads/maxdb/7.6.00.html#Linux_x86_RPM
here there is 7.6 version, but the rpm packages are differnet to mine
Message was edited by:
marco scacchi
Maybe you are looking for
-
I bought my macbook air off a friend, i can't install iPhoto or iMovie for free :(
Hi People, me askign for help again i am affraid, mac newbie here.. i was lucky enough to purchase a pristine macbook air mid 2011 off my friend today and have been having some teething troubles. one being i would really like to download imovie and i
-
I have iphone 6 plus 64GB, I have recently faced sceen freeze situation when i received call. I was unable to receive it. Touch screen was not reponding. This was happened when phone in locked as well as unlocked condition. I was able to log in with
-
Down loaded Itunes and got my credit card hacked anyone else have that problem?
It would appear from my research that a lot of people are having money stolen from them when they purchase items from ITunes stores has anyone else experienced this problem and if so what if anything is Apple doing about it. I got ripped off for $70.
-
I'm having so much trouble with the audio levels in logic pro. It seems every VST has a completely different level when the volume on the vst is set to 100. Miroslav Philharmonik is EXTREMELY quiet..., and when I load drums into ultrabeat, they immed
-
On my macbook safari was completely deleted and i dont know how to get it back
I couldn't find the adress bar on safari so i googled how to get it back and it said to delete safari and then upload it again and i cant figure out how to upload it. PLEASE HELP!