int
mk_s_purchase(void *pDest, ds_key_t kIndex)
{
int i;
mk_master(pDest, kIndex);
genrand_integer(&nItemIndex, DIST_UNIFORM, 1, (int)getIDCount(ITEM), 0, S_PLINE_ITEM_ID);
for (i=1; i <= 12; i++)
{
mk_detail(i, 1);
}
return(0);
}
/*
* Routine:
* Purpose:
* Algorithm:
* Data Structures:
*
* Params:
* Returns:
* Called By:
* Calls:
* Assumptions:
* Side Effects:
* TODO: None
*/
int
vld_web_sales(int nTable, ds_key_t kRow, int *Permutation)
{
int nLineitem,
nMaxLineitem,
i;
row_skip(nTable, kRow - 1);
row_skip(WEB_RETURNS, (kRow - 1) );
jDate = skipDays(WEB_SALES, &kNewDateIndex);
mk_master(NULL, kRow);
genrand_integer(&nMaxLineitem, DIST_UNIFORM, 8, 16, 9, WS_ORDER_NUMBER);
genrand_integer(&nLineitem, DIST_UNIFORM, 1, nMaxLineitem, 0, WS_PRICING_QUANTITY);
for (i = 1; i < nLineitem; i++)
{
mk_detail(NULL, 0);
}
mk_detail(NULL, 1);
return(0);
}
/*
* mk_web_sales
*/
int
mk_w_web_sales (void *row, ds_key_t index)
{
int nLineitems,
i;
/* build the static portion of an order */
mk_master(row, index);
/* set the number of lineitems and build them */
genrand_integer(&nLineitems, DIST_UNIFORM, 8, 16, 9, WS_ORDER_NUMBER);
for (i = 1; i <= nLineitems; i++)
{
mk_detail(NULL, 1);
}
/**
* and finally return 1 since we have already printed the rows
*/
return (1);
}
int
vld_s_purchase(int nTable, ds_key_t kRow, int* bPermutation)
{
int nLineitem,
i;
row_skip(S_PURCHASE, kRow - 1);
row_skip(S_PURCHASE_LINEITEM, (kRow - 1));
row_skip(S_STORE_RETURNS, (kRow - 1));
mk_master(NULL, kRow);
genrand_integer(&nLineitem, DIST_UNIFORM, 1, 12, 0, S_PLINE_NUMBER);
genrand_integer(&nItemIndex, DIST_UNIFORM, 1, (int)getIDCount(ITEM), 0, S_PLINE_ITEM_ID);
for (i=1; i < nLineitem; i++)
mk_detail(i, 0);
print_start(S_PURCHASE_LINEITEM);
print_key(0, (kRow - 1) * 12 + nLineitem, 1);
mk_detail(i, 1);
return(0);
}
