eTRM uses javascript that opens and focuses a separate window to display reports. Your browser does not appear to support javascript. This should not prevent you from using eTRM but it does mean the window focus feature will not work. Please check the contents of other windows on your desktop if you click on a link that does not appear to do anything.

APPS.BEN_RT_PRFL_CACHE dependencies on BEN_HASH_UTILITY

Line 40: ben_hash_utility.write_mastDet_Cache to

36: 115.11 29-May-00 mhoyes - Upgraded various get procedures to latest
37: cache on demand.
38: 115.13 31-May-00 mhoyes - Fixed age and los problems.
39: 115.14 15-Dec-00 Tmathers - Change calls for
40: ben_hash_utility.write_mastDet_Cache to
41: call ben_cache.write_mastDet_Cache.
42: WWBUG 1545633.
43: 115.15 29-Dec-00 Tmathers - fixed check_sql errors
44: 115.16 20-Mar-02 vsethi added dbdrv lines

Line 110: ', ben_hash_utility.get_hash_key);' ||

106: --
107: -- Hash the master id
108: --
109: 'l_master_hv := mod(' || to_char(p_vrbl_rt_prfl_id) ||
110: ', ben_hash_utility.get_hash_key);' ||
111: --
112: -- Check if hashed value is already cached
113: --
114: 'begin ' ||

Line 135: 'l_master_hv := l_master_hv + ben_hash_utility.get_hash_jump; ' ||

131: -- Loop until un-allocated has value is derived
132: --
133: 'while l_hash_found = FALSE loop ' ||
134: --
135: 'l_master_hv := l_master_hv + ben_hash_utility.get_hash_jump; ' ||
136: --
137: -- Check if the hash index exists, if not we can use it
138: --
139: 'l_entry_exists := true; ' ||

Line 1255: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);

1251: end if;
1252: --
1253: -- Get the instance details
1254: --
1255: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);
1256: --
1257: -- Check if hashed value is already allocated
1258: --
1259: if g_ftpt_lookup.exists(l_index) then

Line 1271: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);

1267: -- Loop until un-allocated has value is derived
1268: --
1269: while not l_not_hash_found loop
1270: --
1271: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
1272: --
1273: -- Check if the hash index exists, if not we can use it
1274: --
1275: if not g_ftpt_lookup.exists(l_index) then

Line 1947: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);

1943: end if;
1944: --
1945: -- Get the instance details
1946: --
1947: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);
1948: --
1949: -- Check if hashed value is already allocated
1950: --
1951: if g_loa_lookup.exists(l_index) then

Line 1963: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);

1959: -- Loop until un-allocated has value is derived
1960: --
1961: while not l_not_hash_found loop
1962: --
1963: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
1964: --
1965: -- Check if the hash index exists, if not we can use it
1966: --
1967: if not g_loa_lookup.exists(l_index) then

Line 2076: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);

2072: end if;
2073: --
2074: -- Get the instance details
2075: --
2076: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);
2077: --
2078: -- Check if hashed value is already allocated
2079: --
2080: if g_org_lookup.exists(l_index) then

Line 2092: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);

2088: -- Loop until un-allocated has value is derived
2089: --
2090: while not l_not_hash_found loop
2091: --
2092: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
2093: --
2094: -- Check if the hash index exists, if not we can use it
2095: --
2096: if not g_org_lookup.exists(l_index) then

Line 2984: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);

2980: end if;
2981: --
2982: -- Get the instance details
2983: --
2984: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);
2985: --
2986: -- Check if hashed value is already allocated
2987: --
2988: if g_age_lookup.exists(l_index) then

Line 3000: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);

2996: -- Loop until un-allocated has value is derived
2997: --
2998: while not l_not_hash_found loop
2999: --
3000: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
3001: --
3002: -- Check if the hash index exists, if not we can use it
3003: --
3004: if not g_age_lookup.exists(l_index) then

Line 3245: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);

3241: end if;
3242: --
3243: -- Get the instance details
3244: --
3245: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);
3246: --
3247: -- Check if hashed value is already allocated
3248: --
3249: if g_los_lookup.exists(l_index) then

Line 3261: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);

3257: -- Loop until un-allocated has value is derived
3258: --
3259: while not l_not_hash_found loop
3260: --
3261: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
3262: --
3263: -- Check if the hash index exists, if not we can use it
3264: --
3265: if not g_los_lookup.exists(l_index) then

Line 3571: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);

3567: end if;
3568: --
3569: -- Get the instance details
3570: --
3571: l_index := ben_hash_utility.get_hashed_index(p_id => p_vrbl_rt_prfl_id);
3572: --
3573: -- Check if hashed value is already allocated
3574: --
3575: if g_ttl_prtt_lookup.exists(l_index) then

Line 3587: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);

3583: -- Loop until un-allocated has value is derived
3584: --
3585: while not l_not_hash_found loop
3586: --
3587: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
3588: --
3589: -- Check if the hash index exists, if not we can use it
3590: --
3591: if not g_ttl_prtt_lookup.exists(l_index) then