Database

... WHERE (@FirstId=null OR FirstId=@FirstId) AND (@SecondId =null OR SecondId =@SecondId )

d@nish wrote:

Sean Claude Van Dam

J4amieC wrote:

Jean

SELECT COUNT(*) FROM sys.databases WHERE name=@database_name AND state_desc='online'

Liqz wrote:

Any ideas what is going wrong?

SELECT DATEADD(y, tblMembershipRecords.[YearJoined], getdate())

I are Troll

 select distinct nP.id, nP.NodeID, nP.parent, nP.Description, nRef.ID refParent, np.type 
from #Nodes nP
left outer join #Nodes nRef on nP.Parent = nRef.NodeID	-- look up the reference id of the parent
order by  np.Parent,np.Description,np.NodeID

Nodeid   Parent   Description     Type      Curr
==========================================================================================
89	 NULL     Compulsory        1	     10
90	  89	  B1052	            3	     10

4113	89	  B1061	            3	     10
2820      89	  One of	    2	     10
2821	2820	  B1054             3	     10
2822	2820	  B1055             3	     10

public void PopulateTreeFromCurr(int currID)
    {    
        // CurrStructDataSource calls sp_Traverse_Tree which returns an inordered list of nodes for a tree
        IEnumerable result = CurrStructDataSource.Select(DataSourceSelectArguments.Empty);
        // ID, Parent, Child, Description, Level, i
        int Parent, Child;
        CurriculumTreeView.Nodes.Clear();
        
        ArrayList CurrNodes = new ArrayList();

        if (result != null)
        {
            // an ordered set of nodes is given. parent always before current node except for root            
            foreach (System.Data.DataRowView row in result)
            {
                TreeNode newnode = new TreeNode(row["Description"].ToString(), row["NodeID"].ToString());
                CurrNodes.Add(newnode); // should setup a lookup between the id given by the ArrayList and that of the node
                // as we add the nodes, we can set up the hierarchy
                if (row["refParent"].ToString() == "")
                {   // don't have to add the root node to another node-it is the root
                }
                else
                {
                    Parent = Convert.ToInt32(row["Parent"]);
                    Child = Convert.ToInt32(row["ID"]);

                    TreeNode ParentNode = new TreeNode();
                    TreeNode ChildNode = new TreeNode();
                    [COLOR="DarkOrange"][B]ParentNode = (TreeNode)CurrNodes[Parent];[/B][/COLOR]
                    ChildNode = (TreeNode)CurrNodes[Child];
                    ParentNode.ChildNodes.Add(ChildNode);
                    CurrNodes[Parent] = ParentNode;
                }
            }
            if (CurrNodes.Count > 0)
            {
                // Add the first root compulsory which has all nodes attached to it
                CurriculumTreeView.Nodes.Add((TreeNode)CurrNodes[0]);
                CurriculumTreeView.ExpandAll();
            }
        }
    }

ParentNode = (TreeNode)CurrNodes[Parent];

Index was out of range. Must be non-negative and less than the size of the collection.
Parameter name: index

select firstname,lastname from
(select ROW_NUMBER() over(order by firstname) as rn,firstname,lastname 
from
(
	select 
			distinct(firstname),lastname 
	from @tbl t
)X(firstname,lastname))Y(rn,firstname,lastname)
where rn between 0 and 0 + 6 -1