Speed Ferret Replacement or Built-in function?

We used to use a program called Speed Ferret to search through the directory of databases to look for ALL INSTANCES of a term or phrase.
For example, we have 55 databases, and in some of those databases we import a table called ZIP_CODES. Speed Ferret allowed us to perform a search for the term ZIP_CODES and it would look through every database in the directory and provide a list of which
databases contained that term and where in the database that term was located.
Is there anything that replaced this (Moshannon developed Speed Ferret and they are not upgrading it to work with 2010 or newer Access) or is there something within Access that can be used?
Thanks,
Jessica

Hi,
As far as I know, Access has no build-in feature that you descripted. We might develop an add-in via VBA code.
If you have further question about development, I recommend you post the question to the MSDN forum for Access
http://social.msdn.microsoft.com/Forums/en-US/home?forum=accessdev&filter=alltypes&sort=lastpostdesc
The reason why we recommend posting appropriately is you will get the most qualified pool of respondents, and other partners who read the forums regularly can either share their knowledge or learn from your interaction with us. Thank you for your understanding.
Regards,
George Zhao
TechNet Community Support
It's recommended to download and install
Configuration Analyzer Tool (OffCAT), which is developed by Microsoft Support teams. Once the tool is installed, you can run it at any time to scan for hundreds of known issues in Office
programs.

Similar Messages

A replacement for the Quicksort function in the C++ library

Hi every one,
I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
Triple State Algorithm
The classical way of doing Quicksort is as follows:
- Choose one element p. Called pivot. Try to make it close to the median.
- Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
- Recursively sort the left and right parts using the same method above.
- Stop recursion when a part reaches a size that can be trivially sorted.
The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
[ <=p | ? | >=p ]
[ =p | ? ]
[ <=p | =p | ? | >p ]
[ =p | p ] Then swap = part to middle at the end
[ =p | p | =p ] Then swap = parts to middle at the end
Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
[ p ]
The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
[ p ]
Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
Further reducing number of swaps
A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
while (l<=r)
while (ar[l]<p)
l++;
while (ar[r]>p)
r--;
if (l<r)
{ Swap(ar[l],ar[r]);
l++; r--;
else if (l==r)
{ l++; r--; break;
The Swap macro above does three copy operations:
Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
the empty space will remain there juggling left and right. The following code snippet explains.
// Pre-scan from the right
while (ar[r]>p)
r--;
temp = ar[r];
// Main loop
while (l<r)
while (l<r && ar[l]<p)
l++;
if (l<r) ar[r--] = ar[l];
while (l<r && ar[r]>p)
r--;
if (l<r) ar[l++] = ar[r];
// After loop finishes, copy temp to left side
ar[r] = temp; l++;
if (temp==p) r--;
(For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
cases handling, it eventually proves more efficient than the classical swapping approach.
Run time tests
Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
size std::sort() Triple State QuickSort
5000 2039 1609
6000 2412 1900
7000 2733 2220
8000 2993 2484
9000 3361 2778
10000 3591 3093
It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
size std::sort() Triple State QuickSort
100000 1607 424
200000 3165 845
300000 4534 1287
400000 6461 1700
500000 7668 2123
600000 9794 2548
700000 10745 3001
800000 12343 3425
900000 13790 3865
1000000 15663 4348
Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
sawtooth: ar[i] = i % arange
random: ar[i] = GenRand() % arange + 1
stagger: ar[i] = (i* arange + i) % n
plateau: ar[i] = min(i, arange)
shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
I also add the following two input types, just to add a little torture:
Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
Organ Pipes: (see full code for details)
Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
Sorted, reversed, front half reversed, back half reversed, dithered, fort.
Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
The complete test results can be found here:
http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
or:
https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
Theoretical Analysis
A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
Using SSE2 instruction set
SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
decision is made only once when the function is called so it has minor overhead.
Few other notes
- The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
- Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
- You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
-When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
- The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
You can find the complete VC++ project/code along with a minimal test program here:
http://solostuff.net/tsqsort/
Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
it is!!
Ammar Muqaddas

Thanks for your interest.
Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
I Will try to look at your sorting code, lets see if I can compile it.

How to use a mysql built-in function with dataprovider

hi.
I want to use a mysql built-in function, for example, MD5() on a column when updating a table with dataprovider.
Something like this doesn't work:
MyDataProviderOne.setValue("tablename.field_name", "MD5('some text')");
How should it be done?
thanks.
Mike.

hi.
thanks. this helped, but I'd like to use also different functions, that's why, I'd rather do it by MySQL built-in functions with dataprovider... Is there any way to do that?
best regards.
Mike.

SSMS 2012: Import XML File to SQL Table - 'value' is not a recognized built-in function name!!??

Hi all,
I have the following xml file (books1.xml):
<bookstore>
<book>
<BookID>1</BookID>
<title>Everyday Italian</title>
<author>Giada De Laurentiis</author>
<year>2005</year>
<price>30.00</price>
</book>
<book>
<BookID>2<BookID>
<title>Harry Potter</title>
<author>J K. Rowling</author>
<year>2005</year>
<price>29.99</price>
</book>
<book>
<BookID>3<BookID>
<title>XQuery Kick Start</title>
<author>James McGovern</author>
<year>2003</year>
<price>49.99</price>
</book>
<book>
<BookID>4<BookID>
<title>Learning XML</title>
<author>Erik T. Ray</author>
<year>2003</year>
<price>39.95</price>
</book>
</bookstore>
In my Microsoft SQL Server 2012 Management Studio, I executed the following SQL Query code:
--XQuery w3schools example using books1.xml in C:\Temp folder
---SQL Query W3books Title
---9 March 2015
USE XML_XQUERY
GO
CREATE TABLE W3Books(
BookID INt Primary Key,
Title VARCHAR(30));
INSERT INTO W3Books (BookID, Title)
SELECT x.book.query('BookID'), value('.', 'INT'),
x.book.query('title'), value('.', 'VARCHAR(30)')
FROM (
SELECT CAST(x AS XML)
FROM OPENROWSET(
BULK 'C:\Temp\books1.xml',
SINGLE_BLOB) AS T(x)
) AS T(x)
CROSS APPLY x.nodes('W3Books/book') AS x(book);
SELECT BookID, Title
FROM W3Books;
I got the following error messages:
Msg 195, Level 15, State 10, Line 7
'value' is not a recognized built-in function name.
Msg 156, Level 15, State 1, Line 16
Incorrect syntax near the keyword 'AS'.
I don't know why I got the error of 'value' is not a recognized built-in function name. Please kindly help and tell me what is wrong in my code and how to correct the error.
Thanks, Scott Chang
P. S.
(1) I mimicked the xml file and SQL Qeury code of Import XML File to SQL Table in
http://pratchev.blogspot.com/2008/11/import-xml-file-to-sql-table.html. The xml file and the code of this sample worked in my SSMS 2012 program.
(2) I am learning the "CAST" and "CROSS APPLY" in the Create Instances of XML Data of Microsoft MSDN - it is very abstract to me.

Hi Stan210, Thanks for your nice response.
I corrected my xml file as you pointed out.
I made some changes in some code statements of my SQLQueryW3BookTitle.sql as you instructed:
--XQuery w3schools example using books1.xml in C:\Temp folder
---SQL Query W3books Title
---10 March 2015
USE XML_XQUERY
GO
CREATE TABLE W3Books(
BookID INt Primary Key,
Title VARCHAR(30));
INSERT INTO W3Books (BookID, Title)
SELECT x.book.value('/BookID[1]', 'INT'),
x.book.value('/title[1]', 'VARCHAR(30)')
FROM (
SELECT CAST(x AS XML)
FROM OPENROWSET(
BULK 'C:\Temp\books1.xml',SINGLE_BLOB) AS T(x)
) AS T(x)
CROSS APPLY x.nodes('bookstore/book') AS x(book);
SELECT BookID, Title
FROM W3Books;
I executed my revised sql and I got the following Message and Results:
Msg 515, Level 16, State 2, Line 6
Cannot insert the value NULL into column 'BookID', table 'XML_XQUERY.dbo.W3Books'; column does not allow nulls. INSERT fails.
The statement has been terminated.
(0 row(s) affected)
Results:
BookID Title
I don't know why I just got the names of columns in Results and the "Cannot insert the value NULL into column 'BookID', table 'XML_XQUERY.dbo.W3Books'; column does not allow nulls, insert fails." in Messages. Please kindly help, advise me
how to correct the errors and respond again.
Many Thanks again,
Scott Chang

How to call the built in functions from flex?

I want to use some of the Built in functions like the twelvesprints.getActivityOwnerId() in flex. From the java example i could make out that we needed to import some classes to do this but was unable to find them for flex.

You can download the SWC file for Flex Method app here:
https://sandbox.12sprints.com/FlashMethodLib.swc
Java samples are located at
https://streamwork.com/api/Java.zip
Method exaples are available at:
https://streamwork.com/api/methods/com.streamwork.hello_world.zip
https://streamwork.com/api/methods/com.streamwork.constants.zip
https://streamwork.com/api/methods/com.streamwork.using_arrays.zip
com.streamwork.testFlash

What are the Built-In-Functions in XSLT mapping?

what are the Built-In-Functions in XSLT mapping?

hi praveen
check the below blogs
XSLT MAPPING
Step u2013 By u2013 Step Simple Approach for XSLT Mapping
Step By Step Simple Approach for XSLT Mapping
XSLT mapping for multiple segments of XML
XSLT mapping for multiple segments of XML
IF - ELSE IF and XSLT - A Better work around ?
IF - ELSE IF and XSLT - A Better work around ?
Calling instance (object) method of ABAP Class into xslt mapping by using SAP: CALL-EXTERNAL
Calling instance (object) method of ABAP Class into xslt mapping by using SAP: CALL-EXTERNAL
xpath functions in xslt mapping
xpath functions in xslt mapping
Using XSLT Mapping within the J2EE Adapter Framework
https://www.sdn.sap.com/irj/sdn/weblogs?blog=/pub/wlg/3823 [original link is broken] [original link is broken] [original link is broken]
EDIFACT to XML - Stylus Studio Solution
EDIFACT to XML - Stylus Studio Solution
Running NetWeaver's XSLT processor from XMLSpy
Running NetWeaver's XSLT processor from XMLSpy
generic xslt mapping part 1
https://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/docs/library/uuid/01a57f0b-0501-0010-3ca9-d2ea3bb983c1
generic xslt mapping part 1          part2
https://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/docs/library/uuid/9692eb84-0601-0010-5ca0-923b4fb8674a
xslt recursive templates
XSLT: Recursive Templates
Generating Generic XML / HTML files without using XSLT Mappings
Generating Generic XML / HTML files without using XSLT Mappings
regards
kummari

List of built-in Functions in SAP system

Hi,
I am trying to find the complete list of built-in function available in SAP system. I searched in SAP help but could not find a comprehensive list at all. I am wondering if anyone can help me locate the list.
Thank you in advance,
Sunny

Hi Sunny,
in my system are already 77.197 transaction codes defined. OK, some are customer development, but on the other hand we are fare away from having all modules installed.
I'm not sure, if you are looking for all transactions, all function modules, all BAPIs, all interfaces...
...but be sure, no one can EVER go through a whole list.
You have to restrict your search: to a specific topic (e.g. only material master), specific technics (e.g. only IDOCs) - then you can successfully browse through the possibilities.
Regards,
Christian

List of Built in Functions

Hi,
Can anyone tell me how to get list of built in Oracle functions..eg(Sum,Count,Trim,etc)..
Thanx in adv
Balajee

Hi,
When we install Oracle Discoverer, it loads a table EUL functions which has some built in functions and its parameters, whcih in turn is used by the Report of Dicoverer.so in that line can we have something which loads the built in fiunctions into a table..
Balajee

Built-in functions inside text_io

I am using text_io to get dir information. When inside the loop built-in functions such as to_date are not working. It is simply ignoring the function. However if I put a simply message box, it works.
Is there a limitation to using functions inside text_io.
Also, any code, including message boxes, outside text_io exit loop is ignored. Is there something I can do to fix it?
Thanks,
Srikanth

But if I want to compare 2 dates, I cannot assign it to variables. I need to something like
If to_date(a) - to_date(b) > 0 then
else
end if;
This is not working inside text_io. Any ideas?
thanks

Built in Function to Populate an access table from an Oracle Table through VB 6.0

Dear all,
Is there any built in function in VB 6.0 to populate an access table directly from an oracle table or SQL Server(Assume Both has the same columns & data type).
(Just like the DoCmd command which can be used to populate an excel sheet directly from an access table).
Please help.
Regards
Sibby.

Sibby,
There is no "built-in" code in VB that I am aware of. However, you could use this code which I wrote for SQL Server. For Oracle, you would have to change to the appropriate table to get all the table names. You can filter by table name to get just your tables like I did below (My_).
'* Now select all the files and add to access.
sSQL = "SELECT name, id FROM sysobjects WHERE xtype = 'U' AND SUBSTRING(name, 1, 3) = 'My_' ORDER BY name"
Set rstTemp = OpenRdSetView(sSQL:=sSQL, adoConnection:=adoConnection)
On Error GoTo TableExistError
'* Loop through all my database tables and copy to the Access database.
With rstTemp
Do While Not .EOF
'* Copy this to the Access backup database.
sTableName = .Fields("Name").Value
'* Select all records from the SQL Server table and copy to the local Access database.
sSQL = "SELECT * INTO " & sTableName & " FROM "
sSQL = sSQL & "[odbc;dsn=" & sDSN & ";UID=" & sUID & ";pwd=" & spwd & ";]." & sTableName
adoBackupConnection.Execute sSQL, , adExecuteNoRecords
'* Go to next table.
.MoveNext
Loop
End With

'SUBSTRING_INDEX' is not a recognized built-in function name.

actually iam modifing the servlet code to connect with MSSQL.previously it was MYSQL.now compiling is ok.
while running it shows error at the top of the linked page as...
error
[Microsoft][SQLServer 2000 Driver for JDBC][SQLServer]'SUBSTRING_INDEX' is not a recognized built-in function name.
->can any one give me the solution for this error.

Don't use that function because it doesn't exist in SQL-Server.
OR
Change your SQL to use a function that does exist.
OR
Create a user defined function in SQL server that has that name.

[SQL Server]'TO_DATE' is not a recognized built-in function name

Running 11g dg4msq and getting the error :
SQL> select * from all_users@dg4msql;
select * from all_users@dg4msql
ERROR at line 1:
ORA-00604: error occurred at recursive SQL level 1
ORA-28500: connection from ORACLE to a non-Oracle system returned this message:
[Oracle][ODBC SQL Server Driver][SQL Server]'TO_DATE' is not a recognized
built-in function name. {10196,NativeErr = 195}

Hi,
This problem happened on Windows platforms after upgrading the RDBMS used to access the gateway from 10.2.0.3 to 10.2.0.4 patch 22.
The solution is to install and apply Oracle Database 10.2.0.4 Patch 29 (Windows Bundle Patch 29) or later to the RDBMS that is running the query and connecting to the Gateway.
This is detailed in the following note available on My Oracle Support -
Query Using DG4MSQL Returns Error After Upgrade of RDBMS From 10.2.0.3 to 10.2.0.4 (Doc ID 1078940.1)
Regards,
Mike

Error 'DAYOFWEEK' is not a recognized built-in function name.

hi friend I used the following query with sql server 2008 to select group by records
SELECT
sum(ljoin) as lct,
sum(rjoin) as rct,
CONCAT(DATE_FORMAT(DATE_ADD(date, INTERVAL(1-DAYOFWEEK(date)) DAY),'%Y-%m-%e'), ' TO ',
DATE_FORMAT(DATE_ADD(date, INTERVAL(7-DAYOFWEEK(date)) DAY),'%Y-%m-%e')) AS DateRange
FROM Pairs_Details
WHERE userid='jitu'
GROUP BY YEARWEEK(date)
it return the following error 'DAYOFWEEK' is not a recognized built-in function name.
But I can not get my desire result there are my following table, data and desire output which I want
Pairs_Details table definition:
CREATE TABLE [dbo].[Pairs_Details](
[sno] [int] IDENTITY(1,1) NOT NULL,
[userid] [nvarchar](50) NULL,
[date] [datetime] NULL,
[ljoin] [int] NULL,
[rjoin] [int] NULL
) ON [PRIMARY]
Example data:
sno userid date ljoin rjoin
1 jitu 2014-01-21 15:48:24.000 1 NULL
2 jitu 2014-01-22 15:48:24.000 NULL 1
3 tetu1234 2014-01-22 15:48:24.000 1 NULL
4 jitu 2014-01-24 15:48:24.000 NULL 1
5 saurbh123 2014-01-25 15:48:24.000 1 NULL
6 jitu 2014-01-26 15:48:24.000 1 NULL
7 tetu1234 2014-01-28 16:40:05.000 NULL 1
8 jitu 2014-01-28 16:40:05.000 NULL 1
Desired output: for perticular userid 'jitu'
userid | ljoin | rjoin | DATERANGE |
jitu | 2 | 2 | 2014-01-21 15:48:24.00 TO 2014-01-27 16:40:05.000 |
please any can help me.
thanks.
Jitendra Kumar Sr. Software Developer at Ruvixo Technologies 7895253402

Try below code..
SET DATEFIRST 2;
;WITH CTE AS
SELECT * , DATEPART(WW, [date]) AS week_num
FROM pairs_details
SELECT userid, SUM(ISNULL(ljoin,0)) as ljoin, SUM(ISNULL(rjoin,0)) as rjoin
FROM CTE b
GROUP BY userid, week_num
still missing date_range concatenated field.. I will get back to it... Meanwhile you can use this..
Please mark as answer, if this has helped you resolving the issue.
Good Luck :) .. Visit www.sqlsaga.com for more t-sql code snippets and BI related how to articles.

Length of a string without using any built-in functions

code that returns the length of a string without using any built-in functions.
thanks
Sam

A string is internally represented by a character array. An array of characters will reside on the stack, not the heap. Yes, we always learned that String is a reference type, but what goes on in your memory might still surprise you...
A struct is internally represented by only it's private properties, sequentially on the stack.
So basically, what I thought is happening by messing with the structlayout: is only tricking our programming a bit into thinking that the top X bytes on the stack represent a chararray, while actually we put them there as a string.
Wrong. True. And wrong.
A string is internally represented by, in that order, an array length, a string length, the chars. None of them resides on the stack.
An array is internally represented by, in that order, an array length and the chars. None of them resides on the stack.
When you use the FieldOffset attribute to handle the string as a char array, you don't get anything right:
- the Length returned is the "array length" of the string, which is equal to the string length + 1.
- the chars returned by the array indexer are shifted by 2 chars (the length of the "string length" field).
You can use the FieldOffset to make that work, but it needs a little bit more work.
unsafe static int Test()
string myString = "This string may contain many string inside this string";
string testString = "string";
int countResult = 0;
fixed (char* myChars = new StringToChar { str = myString }.chr, testChar = new StringToChar { str = testString }.chr)
// The 2 first chars of the array are actually the string length.
int myCharsLength = myChars[1] << 16 | myChars[0];
int testCharLength = testChar[1] << 16 | testChar[0];
for (int i = 0; i < myCharsLength - testCharLength + 1; i++)
if (myChars[i + 2] == testChar[2])
for (int j = 1; j < testCharLength; j++)
var c = testChar[7];
if (myChars[i + 2 + j] != testChar[j + 2])
goto endOfCharAnalyses;
countResult++;
endOfCharAnalyses:
continue;
return countResult;

Using SSRS Built in Functions in SharePoint

Hi there,
I currently have a number of reports deployed on a SharePoint site at work. I would like to monitor who actually uses which report and when they ran the report and also how long the report ran for. This is for auditing purposes and getting an idea
of the performance of these reports.
I came across the following built in functions on SSRS; UserID, ReportName, ReportServerUrl and ExecutionTime. Is it possible to use these functions somehow in SSRS & SharePoint whenever someone accesses a particular report and perhaps write this
information to a SharePoint list within our SharePoint site.
If this is possible, how would I go about doing this?
Also, some of our reports run off parameters, is it possible to capture what parameters were used as well?
Any help would be much appreciated. Thanks.

you can get most of these information from executionlog tables available from reportserver database
http://www.mssqltips.com/sqlservertip/2722/sql-server-report-server-2008-r2-execution-log-reports/
Please Mark This As Answer if it helps to solve the issue Visakh ---------------------------- http://visakhm.blogspot.com/ https://www.facebook.com/VmBlogs

Speed Ferret Replacement or Built-in function?

Similar Messages

Maybe you are looking for