Can someone spot my coding or linking mistake, please?
Hi there
Forum looks different from my years-ago last visit, hope I'm putting this in the right place.
Two problems.
www.dulcimerassociationofalbany.com, from index to More Info Here (2015.html), under Nina Zanetti more... (zanetti.html).
Her picture doesn't show up. Since I'm using DW, I'm not, like, spelling anything wrong.
If you go back a page and click under the other artists, their pic shows up. I think I've got them both relative to document. They are both in the same folder.
I'm assuming this is something I am overlooking, but I can't see what. (Happens to me sometimes!)
Second problem, on each of those "more..." pages I have a bit of code to open their websites in a new small window.
Doesn't work.
This is exactly the same code I use successfully on another site. (www.sonnyandperley.com/schedule.htm)
Now what am I missing?
TIA !
denno
This is the correct location of the image
http://www.dulcimerassociationofalbany.com/Docs%202015/images/Nina%20Zanetti%20-%202015%20 %28cropped%20%231%29.jpg
Your link code is
http://www.dulcimerassociationofalbany.com/Docs%202015/images/Nina%20Zanetti%20-%202015%20 (cropped%20#1).jpg
You're going to go crazy trying to debug when you use all those spaces in your file and folder names
Use hyphens or underscores.
As for the small window, I am guessing you forgot the script in the head section
<script language="JavaScript" type="text/JavaScript">
<!--
function MM_openBrWindow(theURL,winName,features) { //v2.0
window.open(theURL,winName,features);
//-->
</script>
</HEAD>
Similar Messages
-
Action Script 3, can someone spot where my code is wrong?
I want to have my characters controlled separately, with 'FireBoy' moving using the left, up and right keys and with 'WaterGirl' moving with the a, w and d keys. However upon editing my code somehow WaterGirl now moves with the right key instead of the d key. Please can someone spot where I have made a mistake and advise me on how to resolve the problem.
My code for main.as is:
package
import flash.display.Bitmap;
import flash.display.Sprite;
import flash.events.Event;
import flash.events.KeyboardEvent;
import flash.events.MouseEvent;
* @author Harry
public class Main extends Sprite
private var leftDown:Boolean = false;
private var rightDown:Boolean = false;
private var aDown:Boolean = false;
private var dDown:Boolean = false;
private var FireBoy:Hero = new Hero();
public var StartButton:Go;
public var WaterGirl:Female = new Female();
public var Door1:Firedoor;
public var Door2:Waterdoor;
public var Fire:Lava;
public var Water:Blue;
public var Green:Gem;
public function Main():void
if (stage) init();
else addEventListener(Event.ADDED_TO_STAGE, init);
public function init(e:Event = null):void
StartButton = new Go();
StartButton.x = 100;
StartButton.y = 5;
addChild(StartButton);
StartButton.addEventListener(MouseEvent.CLICK, startgame);
private function startgame(e:Event = null):void
removeEventListener(Event.ADDED_TO_STAGE, init);
// entry point
removeChild(StartButton);
FireBoy.y = 495;
addChild(FireBoy);
stage.addEventListener(Event.ENTER_FRAME, HerocheckStuff);
stage.addEventListener(KeyboardEvent.KEY_DOWN, HerokeysDown);
stage.addEventListener(KeyboardEvent.KEY_UP, HerokeysUp);
WaterGirl.x = 70;
WaterGirl.y = 495;
addChild(WaterGirl);
stage.addEventListener(Event.ENTER_FRAME, FemalecheckStuff);
stage.addEventListener(KeyboardEvent.KEY_DOWN, FemalekeysDown);
stage.addEventListener(KeyboardEvent.KEY_UP, FemalekeysUp);
Door1 = new Firedoor();
stage.addChild(Door1);
Door1.x = 5;
Door1.y = 62;
Door2 = new Waterdoor();
stage.addChild(Door2);
Door2.x = 100;
Door2.y = 62;
Fire = new Lava();
stage.addChild(Fire);
Fire.x = 160;
Fire.y = 570;
Water = new Blue();
stage.addChild(Water);
Water.x = 350;
Water.y = 160;
Green = new Gem()
stage.addChild(Green);
Green.x = 500;
Green.y = 100;
graphics.beginFill(0x804000, 1);
graphics.drawRect(0, 0, 800, 40);
graphics.endFill();
graphics.beginFill(0x804000, 1);
graphics.drawRect(0, 170, 600, 40);
graphics.endFill();
graphics.beginFill(0x804000, 1);
graphics.moveTo(800, 200);
graphics.lineTo(800, 700);
graphics.lineTo(400, 700);
graphics.lineTo(100, 700);
graphics.endFill();
graphics.beginFill(0x804000, 1);
graphics.drawRect(0, 580, 800, 40);
graphics.endFill();
public function Collision():void
if (WaterGirl.hitTestObject(Fire))
WaterGirl.x = 70;
WaterGirl.y = 495;
if (FireBoy.hitTestObject(Water))
FireBoy.x = 15;
FireBoy.y = 495;
public function HerocheckStuff(e:Event):void
if (leftDown)
FireBoy.x -= 5;
if (rightDown)
FireBoy.x += 5;
FireBoy.adjust();
Collision();
Check_Border();
public function HerokeysDown(e:KeyboardEvent):void
if (e.keyCode == 37)
leftDown = true;
if (e.keyCode == 39)
rightDown = true;
if (e.keyCode == 38)
FireBoy.grav = -15;
Collision();
Check_Border();
public function HerokeysUp(e:KeyboardEvent):void
if (e.keyCode == 37)
leftDown = false;
if (e.keyCode == 39)
rightDown = false;
public function FemalecheckStuff(e:Event):void
if (aDown)
WaterGirl.x -= 5;
if (rightDown)
WaterGirl.x += 5;
WaterGirl.adjust2();
Collision();
Check_Border();
public function FemalekeysDown(e:KeyboardEvent):void
if (e.keyCode == 65)
aDown = true;
if (e.keyCode == 68)
dDown = true;
if (e.keyCode == 87)
WaterGirl.grav = -15;
Collision();
Check_Border();
public function FemalekeysUp(e:KeyboardEvent):void
if (e.keyCode == 65)
aDown = false;
if (e.keyCode == 68)
dDown = false;
public function Check_Border():void
if (FireBoy.x <= 0)
FireBoy.x = 0;
else if (FireBoy.x > 750)
FireBoy.x = 750;
if (WaterGirl.x <= 0)
WaterGirl.x = 0;
else if (WaterGirl.x > 750)
WaterGirl.x = 750;
My code for Hero.as (FireBoy) is:
package
import flash.display.Bitmap;
import flash.display.Sprite;
public class Hero extends Sprite
[Embed(source="../assets/FireBoy.jpg")]
private static const FireBoy:Class;
private var FireBoy:Bitmap;
public var grav:int = 0;
public var floor:int = 535;
public function Hero()
FireBoy = new Hero.FireBoy();
scaleX = 0.1;
scaleY = 0.1;
addChild(FireBoy);
public function adjust():void
this.y += grav;
if(this.y+this.height/2<floor)
grav++;
else
grav = 0;
this.y = floor - this.height / 2;
if (this.x - this.width / 2 < 0)
this.x = this.width / 2;
if (this.x + this.width / 2 > 800)
this.x = 800 - this.width / 2;
And finally my code for Female.as (WaterGirl) is:
package
import flash.display.Bitmap;
import flash.display.Sprite;
* @author Harry
public class Female extends Sprite
[Embed(source="../assets/WaterGirl.png")]
private static const WaterGirl:Class;
private var WaterGirl:Bitmap;
public var grav:int = 0;
public var floor:int = 535;
public function Female()
WaterGirl = new Female.WaterGirl();
scaleX = 0.1;
scaleY = 0.1;
addChild(WaterGirl);
public function adjust2():void
this.y += grav;
if(this.y+this.height/2<floor)
grav++;
else
grav = 0;
this.y = floor - this.height / 2;
if (this.x - this.width / 2 < 0)
this.x = this.width / 2;
if (this.x + this.width / 2 > 800)
this.x = 800 - this.width / 2;You should make use of the trace function to troubleshoot your processing. Put traces in the different movement function conditionals to see which is being used under which circumstances. You might consider putting the movement code into one function since they all execute when you process a keyboard event anyways.
-
My mac updated softwar tonight and now I have no mal, can someone tell me how to udate my mail sofware please ?
I assume you're talking about Security Update 2012-004 for Snow Leopard? Have you by any changed moved your Mail application out of the Applications folder? This will cause updates to fail to work - Apple's included applications should always be left where Apple installed them.
If this is the case, move it back, then downlad the update from Security Update 2012-004 (Snow Leopard) and run it again. -
I bought my little brother an iPod touch 2nd generation for Xmas so we could text since we love states away but it won't verify and complete updating so I can download the texting apps required by iOS 4 or later can someone tell me how to update it please
What exactly happens when you try to update the iPod? What does the error message say?
Also, are you sure yo have a 2G iPod?
See:
Identifying iPod models
I ask since a 1G can only go to iOS 2.x via iTunes and highest is 3.1.3 via
Purchasing iOS 3.1 Software Update for iPod touch (1st generation) -
Can someone perform this speaker test for me please
Hi can someone perform this test for please, play some ipod music through your phone and and cover 1 speaker at a time with you finger, does 1 block out the music as if one speaker is much louder than the other ? just I have tried this on my new iphone 4 as thought it might be a problem but my 3GS is doing it to ??, is it fault or meant to be like that
There's only one speaker.
http://manuals.info.apple.com/enUS/iPhone_iOS4_UserGuide.pdf -
Can someone help as since downloading Lion, I have XL, Publisher and email opening up on reboot all at once, gets annoying. Can you switch these off. I am a pretty new user on Mac. Thanks
Think reset is the way to go. Settings>general>reset>erase all contents. reconnect to iTunes and set it up as a new phone, not from previous back up.
-
Can someone save these in Labview 7.0 please?
Can someone save these 2 vis in labview 7 please?
Attachments:
Time Variable FFT.vi 250 KB
Play 8-bit mono sound.vi 48 KBHere ya go madgreek.
Chris C
Message Edited by Chris_C. on 04-24-2007 09:40 AM
Message Edited by Chris_C. on 04-24-2007 09:40 AM
Chris Cilino
National Instruments
LabVIEW Product Marketing Manager
Certified LabVIEW Architect
Attachments:
bd.GIF 10 KB -
I have redeemed my Adobe Acrobat XI Serial Number, and created an adobe account, but can't find that link to download the entire program anywhere. I only see a link for a temporary version and a link for updates although I have purchased the program. So where is that download link, please?
I forgot to get back to you. Thank you very much for your prompt reply.
Your suggestion helped!
Pamela Oettel
*Oh by the way, referrals to your friends are the heart of my business! If
you know of someone who is buying or selling a home, please give me a call.*
cell: 510-703-8636
[email protected] <[email protected]>
Hablo espanol tambien
*Check out my Latest Facebook Post
<https://www.facebook.com/pameastbayrealtor>*
*Check out *What They Say About Me
<http://www.zillow.com/profile/Pamela-Oettel/Reviews/?my=y>
*BHG Mason McDuffie *
2095 Rose Street, Suite 100, Berkeley, CA 94709
BRE Lic No. 01761212
On Tue, May 27, 2014 at 2:29 AM, GautamBahl <[email protected]> -
Can someone point me to a link for the leanest, meanest apple post flow
thank you in advance
we are looking for finishing funds for our film and i was curious that with all the advances in technology, what is the most efficient workflow - we need to have a D5 master and a film print
or do we?
thanks
craigI don't know of a link to go to, but I would say don't do either unless you have to.
If you're shopping it and you need to exhibit in digital HD, have you thought about renting an Io HD or something, and running it from a MacBook Pro for screenings? HD video from ProRes HQ QT is sweet. Multichannel audio too. I think I read somewhere online about someone that was doing festivals in HD this way...
Screeners could also be Blu-Ray, or anamorphic SD DVD, depending on what your potential distributor/investor would prefer. You could probably do that yourself. Layback to D5 seems unnecessary, unless that's what your new distributor or post house wants, and film has a cost and print ecosystem all its own.
For theatrical stuff, the post house I work with takes digital files on hard drives anyway. This bypasses a tape step for them (and me) when doing a color pass, converting to DPX, film, etc.
I'm assuming you didn't shoot with RED or something too exotic, so make it easy, do a ProRes HQ version of your project, play with it, get the look you want, export it, exhibit that, or make DVD screeners and pitch those.
Once you're happy you can always change attributes and export to whatever, time base issues aside. Keep your FCP project well organized for later finishing. If possible, I would stay away from expensive output until your movie is locked. -
Can someone spot why my variable is being dropped between scripts?
T-Code 1/Flavor1/Script 1:
Copy Value – variable1 ‘instruction’ (from screen)
Copy Value – variable2 ‘anchor’ (from screen)
Pre-Process …..
If Success
Call Script2:
/nDP91 (Change T-Code) Refresh Screen
Paste value ‘anchor’
Push (i.e. trigger DP91 with the appropriate source sales order)
Refresh Screen (we are now in T-code2/Flavor2)
If NO Message (sbar empty) – Progress DP91 Resource Related Billing
Paste value ‘instruction’ to flavor work area for use later THIS DOES NOT WORK??
We are now sitting in a flavour of DP91 but my navigation reference ‘instruction’ is lost
If Message (no RRB to work with)
Use saved variables and circle back to T-Code 1/Flavor1 (This works fine and 'instruction' as part of that movement)
If NOT Success
Error Message
Any thought much appreciated.Can you post your script screenshots?
Thanks,
Bhaskar -
Can someone help with splitting a Linked List.??
Any help would be awesome!!!
My code just will not work!! Any help would be appreciated! My problem is in the last method SplitAt. These are the conditions set and my code:
Splitting a Linked List at a Given Node, into Two Sublists
a. Add the following as an abstract method to the class
LinkedListClass:
public void splitAt (LinkedListClass<T> secondList, T item);
//This method splits the list at the node with the info item into two sublists.
//Precondition: The list must exist.
//Postcondition: first and last point to the first and last nodes of the first sublist,
// respectively. secondList.first and secondList.last point to the first
// and last nodes of the second sublist.
Consider the following statements:
UnorderedLinkedList<Integer> myList;
UnorderedLinkedList<Integer> otherList;
Suppose myList points to the list with the elements 34, 65, 18, 39, 27, 89, and 12 (in this order). The statement
myList.splitAt(otherList, 18);
splits myList into two sublists: myList points to the list with elements 34 and 65, and otherList points to the sublist with elements 18, 39, 27, 89, and 12.
b. Provide the definition of the method splitAt in the class UnorderedLinkedList. Also write a program to test your method.
public class UnorderedLinkedList<T> extends LinkedListClass<T>
//Default constructor
public UnorderedLinkedList()
super();
//Method to determine whether searchItem is in
//the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public boolean search(T searchItem)
LinkedListNode<T> current; //variable to traverse
//the list
boolean found;
current = first; //set current to point to the first
//node in the list
found = false; //set found to false
while (current != null && !found) //search the list
if (current.info.equals(searchItem)) //item is found
found = true;
else
current = current.link; //make current point to
//the next node
return found;
//Method to insert newItem in the list.
//Postcondition: first points to the new list
// and newItem is inserted at the
// beginning of the list. Also,
// last points to the last node and
// count is incremented by 1.
public void insertFirst(T newItem)
LinkedListNode<T> newNode; //variable to create the
//new node
newNode =
new LinkedListNode<T>(newItem, first); //create and
//insert newNode before
//first
first = newNode; //make first point to the
//actual first node
if (last == null) //if the list was empty, newNode is
//also the last node in the list
last = newNode;
count++; //increment count
//Method to insert newItem at the end of the list.
//Postcondition: first points to the new list and
// newItem is inserted at the end
// of the list. Also, last points to
// the last node and
// count is incremented by 1.
public void insertLast(T newItem)
LinkedListNode newNode; //variable to create the
//new node
newNode =
new LinkedListNode(newItem, null); //create newNode
if (first == null) //if the list is empty, newNode is
//both the first and last node
first = newNode;
last = newNode;
else //if the list is not empty, insert
//newNode after last
last.link = newNode; //insert newNode after last
last = newNode; //set last to point to the
//actual last node
count++;
}//end insertLast
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list. Also, first points to the first
// node, last points to the last
// node of the updated list, and count
// is decremented by 1.
public void deleteNode(T deleteItem)
LinkedListNode<T> current; //variable to traverse
//the list
LinkedListNode<T> trailCurrent; //variable just
//before current
boolean found;
if ( first == null) //Case 1; the list is empty
System.err.println("Cannot delete from an empty "
+ "list.");
else
if (first.info.equals(deleteItem)) //Case 2
first = first.link;
if (first == null) //the list had only one node
last = null;
count--;
else //search the list for the given info
found = false;
trailCurrent = first; //set trailCurrent to
//point to the first node
current = first.link; //set current to point to
//the second node
while (current != null && !found)
if (current.info.equals(deleteItem))
found = true;
else
trailCurrent = current;
current = current.link;
}//end while
if (found) //Case 3; if found, delete the node
count--;
trailCurrent.link = current.link;
if (last == current) //node to be deleted
//was the last node
last = trailCurrent; //update the value
//of last
else
System.out.println("Item to be deleted is "
+ "not in the list.");
}//end else
}//end else
}//end deleteNode
public void splitAt(LinkedListClass<T> secondList, T item)
LinkedListNode<T> current;
LinkedListNode<T> trailCurrent;
int i;
boolean found;
if (first==null)
System.out.println("Empty.");
first=null;
last=null;
count--;
else
current=first;
found=false;
i=1;
while(current !=null &&!found)
if(current.info.equals(secondList))
found= true;
else
trailCurrent=current;
i++;
if(found)
if(first==current)
first=first;
last=last;
count=count;
count=0;
else
first=current;
last=last;
last=null;
count = count- i+1;
count = i-1;
else
System.out.println("Item to be split at is "
+ "not in the list.");
first=null;
last=null;
count=0;
}Edited by: romeAbides on Oct 10, 2008 1:24 PMI dont have a test program at all. The program is supposed to prompt for user input of numbers. (it does) Take the input and end at input of -999 (it does). Then it asks user where it wants to split list (it does). When I enter a number it does nothing after that. I am going to post updated code and see if that helps along with all the classes. Thanks!
This is the class to prompt:
import java.util.*;
public class Ch16_ProgEx6
static Scanner console = new Scanner(System.in);
public static void main(String[] args)
UnorderedLinkedList<Integer> list
= new UnorderedLinkedList<Integer>();
UnorderedLinkedList<Integer> subList =
new UnorderedLinkedList<Integer>();
Integer num;
System.out.println("Enter integers ending with -999.");
num = console.nextInt();
while (num != -999)
list.insertLast(num);
num = console.nextInt();
System.out.println();
System.out.println("list: ");
list.print();
System.out.println();
System.out.println("Length of list: " + list.length());
System.out.print("Enter the number at which to split list: ");
num = console.nextInt();
list.splitAt(subList, num);
System.out.println("Lists after splitting list");
System.out.print("list: ");
list.print();
System.out.println();
System.out.println("Length of list: " + list.length());
System.out.print("sublist: ");
subList.print();
System.out.println();
System.out.println("Length of sublist: " + subList.length());
}This is the ADT:
public interface LinkedListADT<T> extends Cloneable
public Object clone();
//Returns a copy of objects data in store.
//This method clones only the references stored in
//each node of the list. The objects that the
//list nodes point to are not cloned.
public boolean isEmptyList();
//Method to determine whether the list is empty.
//Postcondition: Returns true if the list is empty;
// false otherwise.
public void initializeList();
//Method to initialize the list to an empty state.
//Postcondition: The list is initialized to an empty
// state.
public void print();
//Method to output the data contained in each node.
public int length();
//Method to return the number of nodes in the list.
//Postcondition: The number of nodes in the list is
// returned.
public T front();
//Method to return a reference of the object containing
//the data of the first node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the first node
// is returned.
public T back();
//Method to return a reference of object containing
//the data of the last node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the last node
// is returned.
public boolean search(T searchItem);
//Method to determine whether searchItem is in the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public void insertFirst(T newItem);
//Method to insert newItem in the list.
//Postcondition: newItem is inserted at the
// beginning of the list.
public void insertLast(T newItem);
//Method to insert newItem at the end of the list.
//Postcondition: newItem is inserted at the end
// of the list.
public void deleteNode(T deleteItem);
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list.
public void splitAt(LinkedListClass<T> secondList, T item);
}This is the linked list class:
import java.util.NoSuchElementException;
public abstract class LinkedListClass<T> implements LinkedListADT<T>
protected class LinkedListNode<T> implements Cloneable
public T info;
public LinkedListNode<T> link;
//Default constructor
//Postcondition: info = null; link = null;
public LinkedListNode()
info = null;
link = null;
//Constructor with parameters
//This method sets info pointing to the object to
//which elem points to and link is set to point to
//the object to which ptr points to.
//Postcondition: info = elem; link = ptr;
public LinkedListNode(T elem, LinkedListNode<T> ptr)
info = elem;
link = ptr;
//Returns a copy of objects data in store.
//This method clones only the references stored in
//the node. The objects that the nodes point to
//are not cloned.
public Object clone()
LinkedListNode<T> copy = null;
try
copy = (LinkedListNode<T>) super.clone();
catch (CloneNotSupportedException e)
return null;
return copy;
//Method to return the info as a string.
//Postcondition: info as a String object is
// returned.
public String toString()
return info.toString();
} //end class LinkedListNode
public class LinkedListIterator<T>
protected LinkedListNode<T> current; //variable to
//point to the
//current node in
//list
protected LinkedListNode<T> previous; //variable to
//point to the
//node before the
//current node
//Default constructor
//Sets current to point to the first node in the
//list and sets previous to null.
//Postcondition: current = first; previous = null;
public LinkedListIterator()
current = (LinkedListNode<T>) first;
previous = null;
//Method to reset the iterator to the first node
//in the list.
//Postcondition: current = first; previous = null;
public void reset()
current = (LinkedListNode<T>) first;
previous = null;
//Method to return a reference of the info of the
//current node in the list and to advance iterator
//to the next node.
//Postcondition: previous = current;
// current = current.link;
// A refrence of the current node
// is returned.
public T next()
if (!hasNext())
throw new NoSuchElementException();
LinkedListNode<T> temp = current;
previous = current;
current = current.link;
return temp.info;
//Method to determine whether there is a next
//element in the list.
//Postcondition: Returns true if there is a next
// node in the list; otherwise
// returns false.
public boolean hasNext()
return (current != null);
//Method to remove the node currently pointed to
//by the iterator.
//Postcondition: If iterator is not null, then the
// node that the iterator points to
// is removed. Otherwise the method
// throws NoSuchElementException.
public void remove()
if (current == null)
throw new NoSuchElementException();
if (current == first)
first = first.link;
current = (LinkedListNode<T>) first;
previous = null;
if (first == null)
last = null;
else
previous.link = current.link;
if (current == last)
last = first;
while (last.link != null)
last = last.link;
current = current.link;
count--;
//Method to return the info as a string.
//Postcondition: info as a String object is returned.
public String toString()
return current.info.toString();
} //end class LinkedListIterator
//Instance variables of the class LinkedListClass
protected LinkedListNode<T> first; //variable to store the
//address of the first
//node of the list
protected LinkedListNode<T> last; //variable to store the
//address of the last
//node of the list
protected int count; //variable to store the number of
//nodes in the list
//Default constructor
//Initializes the list to an empty state.
//Postcondition: first = null, last = null,
// count = 0
public LinkedListClass()
first = null;
last = null;
count = 0;
//Method to determine whether the list is empty.
//Postcondition: Returns true if the list is empty;
// false otherwise.
public boolean isEmptyList()
return (first == null);
//Method to initialize the list to an empty state.
//Postcondition: first = null, last = null,
// count = 0
public void initializeList()
first = null;
last = null;
count = 0;
//Method to output the data contained in each node.
public void print()
LinkedListNode<T> current; //variable to traverse
//the list
current = first; //set current so that it points to
//the first node
while (current != null) //while more data to print
System.out.print(current.info + " ");
current = current.link;
}//end print
//Method to return the number of nodes in the list.
//Postcondition: The value of count is returned.
public int length()
return count;
//Method to return a reference of the object containing
//the data of the first node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the first node
// is returned.
public T front()
return first.info;
//Method to return a reference of object containing
//the data of the last node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the last node
// is returned.
public T back()
return last.info;
//Returns a copy of objects data in store.
//This method clones only the references stored in
//each node of the list. The objects that the
//list nodes point to are not cloned.
public Object clone()
LinkedListClass<T> copy = null;
try
copy = (LinkedListClass<T>) super.clone();
catch (CloneNotSupportedException e)
return null;
//If the list is not empty clone each node of
//the list.
if (first != null)
//Clone the first node
copy.first = (LinkedListNode<T>) first.clone();
copy.last = copy.first;
LinkedListNode<T> current;
if (first != null)
current = first.link;
else
current = null;
//Clone the remaining nodes of the list
while (current != null)
copy.last.link =
(LinkedListNode<T>) current.clone();
copy.last = copy.last.link;
current = current.link;
return copy;
//Method to return an iterator of the list.
//Postcondition: An iterator is instantiated and
// returned.
public LinkedListIterator<T> iterator()
return new LinkedListIterator<T>();
//Method to determine whether searchItem is in
//the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public abstract boolean search(T searchItem);
//Method to insert newItem in the list.
//Postcondition: first points to the new list
// and newItem is inserted at the
// beginning of the list. Also,
// last points to the last node and
// count is incremented by 1.
public abstract void insertFirst(T newItem);
//Method to insert newItem at the end of the list.
//Postcondition: first points to the new list and
// newItem is inserted at the end
// of the list. Also, last points to
// the last node and
// count is incremented by 1.
public abstract void insertLast(T newItem);
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list. Also, first points to the first
// node, last points to the last
// node of the updated list, and count
// is decremented by 1.
public abstract void deleteNode(T deleteItem);
public abstract void splitAt(LinkedListClass<T> secondList, T item);
}And this is the UnorderedLinked Class with the very last method the one being Im stuck on. The SplitAt Method.
public class UnorderedLinkedList<T> extends LinkedListClass<T>
//Default constructor
public UnorderedLinkedList()
super();
//Method to determine whether searchItem is in
//the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public boolean search(T searchItem)
LinkedListNode<T> current; //variable to traverse
//the list
boolean found;
current = first; //set current to point to the first
//node in the list
found = false; //set found to false
while (current != null && !found) //search the list
if (current.info.equals(searchItem)) //item is found
found = true;
else
current = current.link; //make current point to
//the next node
return found;
//Method to insert newItem in the list.
//Postcondition: first points to the new list
// and newItem is inserted at the
// beginning of the list. Also,
// last points to the last node and
// count is incremented by 1.
public void insertFirst(T newItem)
LinkedListNode<T> newNode; //variable to create the
//new node
newNode =
new LinkedListNode<T>(newItem, first); //create and
//insert newNode before
//first
first = newNode; //make first point to the
//actual first node
if (last == null) //if the list was empty, newNode is
//also the last node in the list
last = newNode;
count++; //increment count
//Method to insert newItem at the end of the list.
//Postcondition: first points to the new list and
// newItem is inserted at the end
// of the list. Also, last points to
// the last node and
// count is incremented by 1.
public void insertLast(T newItem)
LinkedListNode newNode; //variable to create the
//new node
newNode =
new LinkedListNode(newItem, null); //create newNode
if (first == null) //if the list is empty, newNode is
//both the first and last node
first = newNode;
last = newNode;
else //if the list is not empty, insert
//newNode after last
last.link = newNode; //insert newNode after last
last = newNode; //set last to point to the
//actual last node
count++;
}//end insertLast
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list. Also, first points to the first
// node, last points to the last
// node of the updated list, and count
// is decremented by 1.
public void deleteNode(T deleteItem)
LinkedListNode<T> current; //variable to traverse
//the list
LinkedListNode<T> trailCurrent; //variable just
//before current
boolean found;
if ( first == null) //Case 1; the list is empty
System.err.println("Cannot delete from an empty "
+ "list.");
else
if (first.info.equals(deleteItem)) //Case 2
first = first.link;
if (first == null) //the list had only one node
last = null;
count--;
else //search the list for the given info
found = false;
trailCurrent = first; //set trailCurrent to
//point to the first node
current = first.link; //set current to point to
//the second node
while (current != null && !found)
if (current.info.equals(deleteItem))
found = true;
else
trailCurrent = current;
current = current.link;
}//end while
if (found) //Case 3; if found, delete the node
count--;
trailCurrent.link = current.link;
if (last == current) //node to be deleted
//was the last node
last = trailCurrent; //update the value
//of last
else
System.out.println("Item to be deleted is "
+ "not in the list.");
}//end else
}//end else
}//end deleteNode
public void splitAt(LinkedListClass<T> secondList, T item)
LinkedListNode<T> current;
LinkedListNode<T> trailCurrent;
int i;
boolean found;
if (first==null)
System.out.println("Empty.");
first=null;
last=null;
count--;
count=0;
else
current=first;
found=false;
i=1;
while(current !=null &&!found)
if(current.info.equals(item))
found= true;
else
trailCurrent=first;
current=first;
i++;
if(found)
if(first==current)
first.link=first;
last.link=last;
count--;
count=0;
else
first.link=current;
last.link=last;
last=null;
count = count- i+1;
count = i-1;
} else {
System.out.println("Item to be split at is "
+ "not in the list.");
first=null;
last=null;
count=0;
Any help or just advice would be fine. Im not the best at Java, better at VB. Am completely stumped! Thanks so much! -
Can Someone Post Info or a Link to BIOS 1.9 for KT4V boards?
Been awhile since I seen or heard anything about the 1.9 BIOS. Anyone got any info on the Beta testing or BIOS fix details?
Bump.
-
Can someone help me write some ASP code please?
Hello, I'm useless at coding, so would be very grateful if
someone could
help me with this piece of code.
I've got a recordset which returns records with the following
fields:
CategoryName, ForumName, Last_Entry_Date.
There are many ForumNames to one CategoryName
I was using Tom Muck's simulated nested repeat which on the
surface was
doing the job, but it gave me problems when it came to
styling the table
because it gives me extra table rows.
I would like to put each category in a separate table. E.g.
Table header: Category Name 1
Table row: Forum 1 Last_Entry_Date
Table row: Forum 2 Last_Entry_Date
Table row: Forum 3 Last_Entry_Date
Table header: Category Name 2
Table row: Forum 4 Last_Entry_Date
Table row: Forum 5 Last_Entry_Date
Table row: Forum 6 Last_Entry_Date
I guess I need to say for each category write a table with
the category
name in the table header cell, then have a repeat region to
display the
list of forums for that category, but I don't know how to
write this loop.
Can anyone help me please?
Thanks
VickyHi Baxter,
If you go to
http://hcmm.org.uk.wehostwebsites.com/forum/forum.asp
this is the page I'm talking concerned with.
Vix
Baxter wrote:
> Hi! Vicky
> Do you have a link to the forum page? Need a look.
> Thanks
> Dave
> "Vix" <[email protected]> wrote in message
> news:ekh11p$pvo$[email protected]..
>> Hello, I'm useless at coding, so would be very
grateful if someone could
>> help me with this piece of code.
>>
>> I've got a recordset which returns records with the
following fields:
>> CategoryName, ForumName, Last_Entry_Date.
>>
>> There are many ForumNames to one CategoryName
>>
>> I was using Tom Muck's simulated nested repeat which
on the surface was
>> doing the job, but it gave me problems when it came
to styling the table
>> because it gives me extra table rows.
>>
>> I would like to put each category in a separate
table. E.g.
>>
>> Table header: Category Name 1
>> Table row: Forum 1 Last_Entry_Date
>> Table row: Forum 2 Last_Entry_Date
>> Table row: Forum 3 Last_Entry_Date
>>
>> Table header: Category Name 2
>> Table row: Forum 4 Last_Entry_Date
>> Table row: Forum 5 Last_Entry_Date
>> Table row: Forum 6 Last_Entry_Date
>>
>> I guess I need to say for each category write a
table with the category
>> name in the table header cell, then have a repeat
region to display the
>> list of forums for that category, but I don't know
how to write this loop.
>>
>> Can anyone help me please?
>> Thanks
>> Vicky
>
> -
Can someone review this nTPV (POS system) PKGBUILD, please ?
Hi, This is my first serious attempt to make a PKGBUILD, and I would like if someone can review it and make comments, bugfixes, and all kind of feedback you want. The package is nTPV, a POS (Point Of Sale) system for pubs, discos, restaurants, .... I think the program is very nice but the source tarball is not easy to build (It's mainly focused on debian). Right now the program is in spanish but the author says that for 1.2 final version it will be released in english also.
I have had to make many workarounds to make the program compile and I don't know if the process can be enhanced before trying it to be acce pted in the AUR. I Hope soon I would put a link to a binary package and a simple instruccions on how to build the complete POS system (database & customizations included).
Unfortunaly, this package depends on other one (gdchart) that hasn't an official archlinux package. So I submit two PKGBUILDS for your review.
Many thanx.
pkgname=ntpv
pkgver=1.2rc1
pkgrel=3
pkgdesc="nTPV POS System & libs"
url="http://www.napsis.com"
license=""
depends=('xorg' 'qt' 'kdelibs' 'libxml2' 'gd' 'gdchart' 'sudo' 'nmap' 'iproute')
makedepends=()
conflicts=()
replaces=()
backup=()
install=ntpv.install
source=(http://switch.dl.sourceforge.net/sourceforge/ntpv/ntpv_bundle-1.2-rc1.tar.gz)
md5sums=('0712a36f80c72c5b6c6011170683eac7')
dirname=ntpv_bundle-1.2rc1
build() {
# 1) Libbslxml
cd $startdir/src/$dirname/libbslxml
make INCLUDES+="-I/usr/include/libxml2 -I/opt/qt/include" LDFLAGS+="-L/opt/qt/lib" || return 1
mkdir -p $startdir/pkg/usr/lib $startdir/pkg/usr/include/libbslxml
cp libbslxml.so.0.2.1 $startdir/pkg/usr/lib
cp *.h $startdir/pkg/usr/include/libbslxml
cd $startdir/pkg/usr/lib
ln -s libbslxml.so.0.2.1 libbslxml.so.0.2
ln -s libbslxml.so.0.2.1 libbslxml.so
# 2) Libqutexr
cd $startdir/src/$dirname/libqutexr/src
qmake -makefile || return 1
make LDFLAGS+="-L$stardir/pkg/usr/lib" || return 1
mkdir -p $startdir/pkg/usr/include/libqutexr
cp *.h $startdir/pkg/usr/include/libqutexr
cp libqutexr.a $startdir/pkg/usr/lib
chmod 755 $startdir/pkg/usr/lib/libqutexr.a
# 3) ntpv-libs base
cd $startdir/src/$dirname/ntpvlibs
make -f Makefile-base INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include" LDFLAGS+="-L$startdir/pkg/usr/lib -lsql -lpsql" || return 1
mkdir -p $startdir/pkg/usr/include/liblinuxbar
cp -f *.h $startdir/pkg//usr/include/liblinuxbar/
cp -f liblinuxbar.so.0.1.1 $startdir/pkg/usr/lib/
cd $startdir/pkg/usr/lib
ln -s liblinuxbar.so.0.1.1 liblinuxbar.so.0.1
ln -s liblinuxbar.so.0.1.1 liblinuxbar.so.0
ln -s liblinuxbar.so.0.1.1 liblinuxbar.so
# 4) ntpv-libs widgets
cd $startdir/src/$dirname/ntpvlibs
sed -i -e "s:// ::" floatkeyboardbox.cpp
sed -i -e "s:/usr/bin/moc:/opt/qt/bin/moc:" Makefile-widgets
sed -i -e "s/-shared/-shared $(LDFLAGS)/ " Makefile-widgets
make -f Makefile-widgets INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include -I/opt/kde/include" LDFLAGS+="-L$startdir/pkg/usr/lib -L/opt/qt/lib" || return 1
mkdir -p $startdir/pkg/usr/include/liblinuxbarwidgets
cp -f *.h $startdir/pkg/usr/include/liblinuxbarwidgets/
cp -f liblinuxbarwidgets.so.0.0.4 $startdir/pkg/usr/lib/
cd $startdir/pkg/usr/lib
ln -s liblinuxbarwidgets.so.0.0.4 liblinuxbarwidgets.so.0.1
ln -s liblinuxbarwidgets.so.0.0.4 liblinuxbarwidgets.so.0
ln -s liblinuxbarwidgets.so.0.0.4 liblinuxbarwidgets.so
# 5) xmlmanage
cd $startdir/src/$dirname/xmlmanage-0.1
./configure
make INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include" LDFLAGS+="-L$startdir/pkg/usr/lib -L/opt/qt/lib" || return 1
mkdir -p $startdir/pkg/usr/bin
cp xmlmanage/xmlmanage $startdir/pkg/usr/bin/
# 6) dcopprinter
cd $startdir/src/$dirname/dcopprinter-0.3
grep -Rl --include "*.cpp" "namespace.*{}.*;" . | xargs sed -i -e "s/^namespace.*{}.*;/namespace std {}/"
./configure
sed -i -e "s:/usr/lib/libqutexr.a:$startdir/pkg/usr/lib/libqutexr.a:" dcopprinter/Makefile
sed -i -e "s:/usr/bin/dcopidl:/opt/kde/bin/dcopidl:" dcopprinter/Makefile
sed -i -e "s:/usr/bin/dcopudl2cpp:/opt/kde/bin/dcopidl2cpp:" dcopprinter/Makefile
make INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include -I/opt/kde/include" LDFLAGS+="-L$startdir/pkg/usr/lib -L/opt/qt/lib -L/opt/kde/lib" || return 1
cp dcopprinter/dcopprinter $startdir/pkg/usr/bin/
mkdir -p $startdir/pkg/etc/ntpv
cp -r etc_linuxbar/* $startdir/pkg/etc/ntpv
mkdir -p $startdir/pkg/usr/share/dcopprinter
cp -r usr_dcopprinter/* $startdir/pkg/usr/share/dcopprinter/
#7) ntpv
cd $startdir/src/$dirname/ntpv-1.2
sed -i -e "s/" "/" > "/" linuxbar/barcore/openbox.cpp # BUG FIX
sed -i -e "s/fewa/ntpv/" etc_ntpv/bar_database.xml
sed -i -e "s/192.168.2.201/localhost/" etc_ntpv/dcopprinter_config.xml
sed -i -e "s:/sbin/sync:/bin/sync:" linuxbar/menusystem/menus/bslexitactionswidget.cpp
./configure
grep -Rl --include "*.cpp" "namespace.*{}.*;" . | xargs sed -i -e "s/^namespace.*{}.*;/namespace std {}/"
make INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include -I/opt/kde/include -I/usr/include/gdchart" LDFLAGS+="-L$startdir/pkg/usr/lib" || return 1
cp linuxbar/linuxbar $startdir/pkg/usr/bin/ntpv
cp -r etc_ntpv/* $startdir/pkg/etc/ntpv/
mkdir -p $startdir/pkg/usr/share/ntpv
cp -r usr_share_ntpv/* $startdir/pkg/usr/share/ntpv
#8) ntpvbo
cd $startdir/src/$dirname/ntpvbo-1.2
sed -i -e "s:*proc << "sudo";://*proc << "sudo";:" linuxbarbackoffice/menusystem/database/bslddbbwidget.cpp
./configure
grep -Rl --include "*.cpp" --include "*.h" "/usr/include/" . | xargs sed -i -e "s:/usr/include/::"
grep -Rl --include "*.cpp" "namespace.*{}.*;" . | xargs sed -i -e "s/^namespace.*{}.*;/namespace std {}/"
make INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include -I/opt/kde/include" LDFLAGS+="-L$startdir/pkg/usr/lib" || return 1
cp linuxbarbackoffice/linuxbarbackoffice $startdir/pkg/usr/bin/ntpv_backoffice
mkdir -p $startdir/pkg/etc/ntpv_backoffice
cp -r etc_ntpv_backoffice/* $startdir/pkg/etc/ntpv_backoffice/
mkdir -p $startdir/pkg/usr/share/ntpv_backoffice
cp -r usr_share_linuxbarbackoffice/* $startdir/pkg/usr/share/ntpv_backoffice/
the ntpv.install file
create_group() {
grupo_ntpv=$(cat /etc/group |sed s/:/' '/ | awk '$1~/ntpv/ {print $1}' |wc -l)
ADDGRP=$(which addgroup 2>/dev/null)
if [ -z $ADDGRP ]
then
ADDGRP=$(which groupadd 2>/dev/null)
fi
if [ $grupo_ntpv -eq 0 ]
then
$ADDGRP ntpv
fi
check_perms() {
if [ -d $dir_ntpv ]
then
echo -ne "checking group and permissions of /etc/ntpv"
chgrp -R ntpv $dir_ntpv
chgrp -R ntpv ${dir_ntpv}/*
chmod g+rwx $dir_ntpv
find ${dir_ntpv}/ -type d | xargs chmod g+rwx
find ${dir_ntpv}/ -type f | xargs chmod g+rw
echo -e " ttt[DONE]"
fi
if [ -d $dir_ntpv_backoffice ]
then
echo -ne "checking group and permissions of /etc/ntpv_backoffice"
chgrp -R ntpv $dir_ntpv_backoffice
chgrp -R ntpv ${dir_ntpv_backoffice}/*
chmod g+rwx $dir_ntpv_backoffice
find ${dir_ntpv_backoffice}/ -type d | xargs chmod g+rwx
find ${dir_ntpv_backoffice}/ -type f | xargs chmod g+rw
echo -e " tt[DONE]"
fi
# arg 1: the new package version
post_install() {
create_group
check_perms
# arg 1: the new package version
# arg 2: the old package version
post_upgrade() {
check_perms
dir_ntpv=/etc/ntpv
dir_ntpv_backoffice=/etc/ntpv_backoffice
op=$1
shift
$op $*
and the other PKGBUILD
pkgname=gdchart
pkgver=0.11.5dev
pkgrel=1
pkgdesc="Create charts and graphs in PNG, GIF and WBMP format"
url="http://www.fred.net/brv/chart/"
license=""
depends=('gd')
makedepends=()
conflicts=()
replaces=()
backup=()
install=
source=(http://www.fred.net/brv/chart/$pkgname$pkgver.tar.gz)
md5sums=('a4af7bc927d8b88934da56fce10a7a3c')
build() {
cd $startdir/src/$pkgname$pkgver
sed -i -e "s:local/::" Makefile
make || return 1
mkdir -p $startdir/pkg/usr/include
cp *.h $startdir/pkg/usr/include/
mkdir -p $startdir/pkg/usr/lib
cp libgdc.a $startdir/pkg/usr/libHi, This is my first serious attempt to make a PKGBUILD, and I would like if someone can review it and make comments, bugfixes, and all kind of feedback you want. The package is nTPV, a POS (Point Of Sale) system for pubs, discos, restaurants, .... I think the program is very nice but the source tarball is not easy to build (It's mainly focused on debian). Right now the program is in spanish but the author says that for 1.2 final version it will be released in english also.
I have had to make many workarounds to make the program compile and I don't know if the process can be enhanced before trying it to be acce pted in the AUR. I Hope soon I would put a link to a binary package and a simple instruccions on how to build the complete POS system (database & customizations included).
Unfortunaly, this package depends on other one (gdchart) that hasn't an official archlinux package. So I submit two PKGBUILDS for your review.
Many thanx.
pkgname=ntpv
pkgver=1.2rc1
pkgrel=3
pkgdesc="nTPV POS System & libs"
url="http://www.napsis.com"
license=""
depends=('xorg' 'qt' 'kdelibs' 'libxml2' 'gd' 'gdchart' 'sudo' 'nmap' 'iproute')
makedepends=()
conflicts=()
replaces=()
backup=()
install=ntpv.install
source=(http://switch.dl.sourceforge.net/sourceforge/ntpv/ntpv_bundle-1.2-rc1.tar.gz)
md5sums=('0712a36f80c72c5b6c6011170683eac7')
dirname=ntpv_bundle-1.2rc1
build() {
# 1) Libbslxml
cd $startdir/src/$dirname/libbslxml
make INCLUDES+="-I/usr/include/libxml2 -I/opt/qt/include" LDFLAGS+="-L/opt/qt/lib" || return 1
mkdir -p $startdir/pkg/usr/lib $startdir/pkg/usr/include/libbslxml
cp libbslxml.so.0.2.1 $startdir/pkg/usr/lib
cp *.h $startdir/pkg/usr/include/libbslxml
cd $startdir/pkg/usr/lib
ln -s libbslxml.so.0.2.1 libbslxml.so.0.2
ln -s libbslxml.so.0.2.1 libbslxml.so
# 2) Libqutexr
cd $startdir/src/$dirname/libqutexr/src
qmake -makefile || return 1
make LDFLAGS+="-L$stardir/pkg/usr/lib" || return 1
mkdir -p $startdir/pkg/usr/include/libqutexr
cp *.h $startdir/pkg/usr/include/libqutexr
cp libqutexr.a $startdir/pkg/usr/lib
chmod 755 $startdir/pkg/usr/lib/libqutexr.a
# 3) ntpv-libs base
cd $startdir/src/$dirname/ntpvlibs
make -f Makefile-base INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include" LDFLAGS+="-L$startdir/pkg/usr/lib -lsql -lpsql" || return 1
mkdir -p $startdir/pkg/usr/include/liblinuxbar
cp -f *.h $startdir/pkg//usr/include/liblinuxbar/
cp -f liblinuxbar.so.0.1.1 $startdir/pkg/usr/lib/
cd $startdir/pkg/usr/lib
ln -s liblinuxbar.so.0.1.1 liblinuxbar.so.0.1
ln -s liblinuxbar.so.0.1.1 liblinuxbar.so.0
ln -s liblinuxbar.so.0.1.1 liblinuxbar.so
# 4) ntpv-libs widgets
cd $startdir/src/$dirname/ntpvlibs
sed -i -e "s:// ::" floatkeyboardbox.cpp
sed -i -e "s:/usr/bin/moc:/opt/qt/bin/moc:" Makefile-widgets
sed -i -e "s/-shared/-shared $(LDFLAGS)/ " Makefile-widgets
make -f Makefile-widgets INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include -I/opt/kde/include" LDFLAGS+="-L$startdir/pkg/usr/lib -L/opt/qt/lib" || return 1
mkdir -p $startdir/pkg/usr/include/liblinuxbarwidgets
cp -f *.h $startdir/pkg/usr/include/liblinuxbarwidgets/
cp -f liblinuxbarwidgets.so.0.0.4 $startdir/pkg/usr/lib/
cd $startdir/pkg/usr/lib
ln -s liblinuxbarwidgets.so.0.0.4 liblinuxbarwidgets.so.0.1
ln -s liblinuxbarwidgets.so.0.0.4 liblinuxbarwidgets.so.0
ln -s liblinuxbarwidgets.so.0.0.4 liblinuxbarwidgets.so
# 5) xmlmanage
cd $startdir/src/$dirname/xmlmanage-0.1
./configure
make INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include" LDFLAGS+="-L$startdir/pkg/usr/lib -L/opt/qt/lib" || return 1
mkdir -p $startdir/pkg/usr/bin
cp xmlmanage/xmlmanage $startdir/pkg/usr/bin/
# 6) dcopprinter
cd $startdir/src/$dirname/dcopprinter-0.3
grep -Rl --include "*.cpp" "namespace.*{}.*;" . | xargs sed -i -e "s/^namespace.*{}.*;/namespace std {}/"
./configure
sed -i -e "s:/usr/lib/libqutexr.a:$startdir/pkg/usr/lib/libqutexr.a:" dcopprinter/Makefile
sed -i -e "s:/usr/bin/dcopidl:/opt/kde/bin/dcopidl:" dcopprinter/Makefile
sed -i -e "s:/usr/bin/dcopudl2cpp:/opt/kde/bin/dcopidl2cpp:" dcopprinter/Makefile
make INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include -I/opt/kde/include" LDFLAGS+="-L$startdir/pkg/usr/lib -L/opt/qt/lib -L/opt/kde/lib" || return 1
cp dcopprinter/dcopprinter $startdir/pkg/usr/bin/
mkdir -p $startdir/pkg/etc/ntpv
cp -r etc_linuxbar/* $startdir/pkg/etc/ntpv
mkdir -p $startdir/pkg/usr/share/dcopprinter
cp -r usr_dcopprinter/* $startdir/pkg/usr/share/dcopprinter/
#7) ntpv
cd $startdir/src/$dirname/ntpv-1.2
sed -i -e "s/" "/" > "/" linuxbar/barcore/openbox.cpp # BUG FIX
sed -i -e "s/fewa/ntpv/" etc_ntpv/bar_database.xml
sed -i -e "s/192.168.2.201/localhost/" etc_ntpv/dcopprinter_config.xml
sed -i -e "s:/sbin/sync:/bin/sync:" linuxbar/menusystem/menus/bslexitactionswidget.cpp
./configure
grep -Rl --include "*.cpp" "namespace.*{}.*;" . | xargs sed -i -e "s/^namespace.*{}.*;/namespace std {}/"
make INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include -I/opt/kde/include -I/usr/include/gdchart" LDFLAGS+="-L$startdir/pkg/usr/lib" || return 1
cp linuxbar/linuxbar $startdir/pkg/usr/bin/ntpv
cp -r etc_ntpv/* $startdir/pkg/etc/ntpv/
mkdir -p $startdir/pkg/usr/share/ntpv
cp -r usr_share_ntpv/* $startdir/pkg/usr/share/ntpv
#8) ntpvbo
cd $startdir/src/$dirname/ntpvbo-1.2
sed -i -e "s:*proc << "sudo";://*proc << "sudo";:" linuxbarbackoffice/menusystem/database/bslddbbwidget.cpp
./configure
grep -Rl --include "*.cpp" --include "*.h" "/usr/include/" . | xargs sed -i -e "s:/usr/include/::"
grep -Rl --include "*.cpp" "namespace.*{}.*;" . | xargs sed -i -e "s/^namespace.*{}.*;/namespace std {}/"
make INCLUDES+="-I$startdir/pkg/usr/include -I/opt/qt/include -I/opt/kde/include" LDFLAGS+="-L$startdir/pkg/usr/lib" || return 1
cp linuxbarbackoffice/linuxbarbackoffice $startdir/pkg/usr/bin/ntpv_backoffice
mkdir -p $startdir/pkg/etc/ntpv_backoffice
cp -r etc_ntpv_backoffice/* $startdir/pkg/etc/ntpv_backoffice/
mkdir -p $startdir/pkg/usr/share/ntpv_backoffice
cp -r usr_share_linuxbarbackoffice/* $startdir/pkg/usr/share/ntpv_backoffice/
the ntpv.install file
create_group() {
grupo_ntpv=$(cat /etc/group |sed s/:/' '/ | awk '$1~/ntpv/ {print $1}' |wc -l)
ADDGRP=$(which addgroup 2>/dev/null)
if [ -z $ADDGRP ]
then
ADDGRP=$(which groupadd 2>/dev/null)
fi
if [ $grupo_ntpv -eq 0 ]
then
$ADDGRP ntpv
fi
check_perms() {
if [ -d $dir_ntpv ]
then
echo -ne "checking group and permissions of /etc/ntpv"
chgrp -R ntpv $dir_ntpv
chgrp -R ntpv ${dir_ntpv}/*
chmod g+rwx $dir_ntpv
find ${dir_ntpv}/ -type d | xargs chmod g+rwx
find ${dir_ntpv}/ -type f | xargs chmod g+rw
echo -e " ttt[DONE]"
fi
if [ -d $dir_ntpv_backoffice ]
then
echo -ne "checking group and permissions of /etc/ntpv_backoffice"
chgrp -R ntpv $dir_ntpv_backoffice
chgrp -R ntpv ${dir_ntpv_backoffice}/*
chmod g+rwx $dir_ntpv_backoffice
find ${dir_ntpv_backoffice}/ -type d | xargs chmod g+rwx
find ${dir_ntpv_backoffice}/ -type f | xargs chmod g+rw
echo -e " tt[DONE]"
fi
# arg 1: the new package version
post_install() {
create_group
check_perms
# arg 1: the new package version
# arg 2: the old package version
post_upgrade() {
check_perms
dir_ntpv=/etc/ntpv
dir_ntpv_backoffice=/etc/ntpv_backoffice
op=$1
shift
$op $*
and the other PKGBUILD
pkgname=gdchart
pkgver=0.11.5dev
pkgrel=1
pkgdesc="Create charts and graphs in PNG, GIF and WBMP format"
url="http://www.fred.net/brv/chart/"
license=""
depends=('gd')
makedepends=()
conflicts=()
replaces=()
backup=()
install=
source=(http://www.fred.net/brv/chart/$pkgname$pkgver.tar.gz)
md5sums=('a4af7bc927d8b88934da56fce10a7a3c')
build() {
cd $startdir/src/$pkgname$pkgver
sed -i -e "s:local/::" Makefile
make || return 1
mkdir -p $startdir/pkg/usr/include
cp *.h $startdir/pkg/usr/include/
mkdir -p $startdir/pkg/usr/lib
cp libgdc.a $startdir/pkg/usr/lib -
Can someone test my podcast on their iPod please?
hello -- i just set up my first podcast but don't have an iPod to test it on. is it possible someone could test it out? i subscribed to my own feed in itunes and it works, but it's not searchable yet via itunes, and i don't have an iPod to test that my clip was encoded properly. anyone willing to drop it into their iPod and test it out??
here's the rss link:
http://www.maplepalmmovie.com/podcasts/rss.xml
thxI don't have an iPod either, but one quick way to tell if it is in the correct format is to subscribe to your own podcast, you can manually subscribe to it using the Advanced >Subscribe to podcast option in iTunes. Once you've downloaded the video, select the video, then choose Advanced> Convert selection for iPod.
If it is in the correct format it will display a message "One or more selections couldn't be converted since they are already in the correct format"
If not, it will begin the conversion for you.
In this case, your video is not in the correct format.
The iTunes spec indicates which formats, sizes, bitrates, etc.. the iPod can play:
Creating Video Podcasts
Although iTunes can play a variety of .mp4, .m4v, and .mov video formats, video iPods require more specific formats. By following the steps in the Creating Video for iPod tutorial, QuickTime 7 Pro will automatically create an .m4v file containing H.264 video and AAC audio that is optimized for iPod. iPod can play the following video formats:
* H.264 video, up to 1.5 Mbps, 640 x 480, 30 frames per sec., Baseline Low-Complexity Profile with AAC-LC audio up to 160 kbps, 48 Khz, stereo audio in .m4v, .mp4, and .mov file formats
* H.264 video, up to 768 kbps, 320 x 240, 30 frames per sec., Baseline Profile up to Level 1.3 with AAC-LC audio up to 160 kbps, 48 Khz, stereo audio in .m4v, .mp4, and .mov file formats
* MPEG-4 video, up to 2.5 Mbps, 640 x 480, 30 frames per sec., Simple Profile with AAC-LC audio up to 160 kbps, 48 Khz, stereo audio in .m4v, .mp4, and .mov file formats
One quick and easy way to get it in the proper format is to use Quicktime Pro to export your original source video. There is a export option "Movie to iPod" this will convert it to a iPod compatible format.
Erik
Maybe you are looking for
-
Classic won't open in Tiger 10.4.6
I purchased Tiger 10.4.6 from the Apple Store to fix another problem and installed it over 10.3.9. The first problem was solved, but now I can't open Classic. I've spent 4 days reading other posts related to this new problem with launching Classic, b
-
I'm getting repeated iPhoto crashes. The library is OK. The application starts up, but then crashes before I can do anything. Any suggestions? The error is: Process: iPhoto [67770] Path: /Applications/iPhoto.app/Contents/MacOS/iPho
-
How do I create a transparent image (cutout) on top of a solid one?
Hello. I am trying to use Pathfinder>Minus front to create transparent rays over text outlines, but am having trouble. Here is a link to how it should appear: http://graphicmechanic.com/IMAGES/ingen.png. It's nearly exactly how I'd like it to look bu
-
CS5 - "quicktime and/or the appropriate codec do not appear"
Hey everyone, I'm trying to import a video file created in FCP7 into Encore CS5 to make a blu ray. I've exported my video as a 1080p/24 ProResHQ quicktime (NOT a QT reference, but the full contained QT file), and every time I try and import it into E
-
We want to restore an older 10.2.0.2 db to a 10.2.0.3 ORACLE_HOME installation. The backup is an RMAN hot backup so this will be incomplete recovery which requires a RESETLOGS on open. After the db is restored, we get error ORA-39700 (database must b